Package br.edu.utfpr.cm.JGitMinerWeb.services.matrix.auxiliary

Examples of br.edu.utfpr.cm.JGitMinerWeb.services.matrix.auxiliary.AuxUserUser.toStringUserAndUser2()

159
160
161
162
163
164
165
166
167
168
169
            if ("false".equalsIgnoreCase(weightedEdge)) {
                // binary edge weight
                edgeWeigth.put(edgeName, 1);
            } else {
                /* Sum commit for each pair file that the pair dev has commited. */
                if (edgeWeigth.containsKey(pairUser.toStringUserAndUser2())) {
                    // edgeName = user + user2
                    edgeWeigth.put(pairUser.toStringUserAndUser2(), edgeWeigth.get(pairUser.toStringUserAndUser2()) + Integer.valueOf(columns[4]));
                } else if (edgeWeigth.containsKey(pairUser.toStringUser2AndUser())) {
                    // edgeName = user2 + user
                    edgeWeigth.put(pairUser.toStringUser2AndUser(), edgeWeigth.get(pairUser.toStringUser2AndUser()) + Integer.valueOf(columns[4]));
View Full Code Here
161
162
163
164
165
166
167
168
169
170
171
                edgeWeigth.put(edgeName, 1);
            } else {
                /* Sum commit for each pair file that the pair dev has commited. */
                if (edgeWeigth.containsKey(pairUser.toStringUserAndUser2())) {
                    // edgeName = user + user2
                    edgeWeigth.put(pairUser.toStringUserAndUser2(), edgeWeigth.get(pairUser.toStringUserAndUser2()) + Integer.valueOf(columns[4]));
                } else if (edgeWeigth.containsKey(pairUser.toStringUser2AndUser())) {
                    // edgeName = user2 + user
                    edgeWeigth.put(pairUser.toStringUser2AndUser(), edgeWeigth.get(pairUser.toStringUser2AndUser()) + Integer.valueOf(columns[4]));
                } else {
                    edgeWeigth.put(edgeName, Integer.valueOf(columns[4]));
View Full Code Here
161
162
163
164
165
166
167
168
169
170
171
                edgeWeigth.put(edgeName, 1);
            } else {
                /* Sum commit for each pair file that the pair dev has commited. */
                if (edgeWeigth.containsKey(pairUser.toStringUserAndUser2())) {
                    // edgeName = user + user2
                    edgeWeigth.put(pairUser.toStringUserAndUser2(), edgeWeigth.get(pairUser.toStringUserAndUser2()) + Integer.valueOf(columns[4]));
                } else if (edgeWeigth.containsKey(pairUser.toStringUser2AndUser())) {
                    // edgeName = user2 + user
                    edgeWeigth.put(pairUser.toStringUser2AndUser(), edgeWeigth.get(pairUser.toStringUser2AndUser()) + Integer.valueOf(columns[4]));
                } else {
                    edgeWeigth.put(edgeName, Integer.valueOf(columns[4]));
View Full Code Here
213
214
215
216
217
218
219
220
221
222
223
//            String edgeName = pairFile.getFileName() + "-" + pairFile.getFileName2() + "-" + i;
            AuxUserUser pairUser = new AuxUserUser(columns[0], columns[3]);
           
            /* Sum commit for each pair file that the pair devCommentter has commited. */
            // user > user2 - directed edge
            if (edgesWeigth.containsKey(pairUser.toStringUserAndUser2())) {
                // edgeName = user + user2
                edgesWeigth.put(pairUser.toStringUserAndUser2(), edgesWeigth.get(pairUser.toStringUserAndUser2()) + Integer.valueOf(columns[4]));
//            // for undirectional graph
//            } else if (edgesWeigth.containsKey(pairUser.toStringUser2AndUser())) {
//                // edgeName = user2 + user - undirected edge
View Full Code Here
215
216
217
218
219
220
221
222
223
224
225
           
            /* Sum commit for each pair file that the pair devCommentter has commited. */
            // user > user2 - directed edge
            if (edgesWeigth.containsKey(pairUser.toStringUserAndUser2())) {
                // edgeName = user + user2
                edgesWeigth.put(pairUser.toStringUserAndUser2(), edgesWeigth.get(pairUser.toStringUserAndUser2()) + Integer.valueOf(columns[4]));
//            // for undirectional graph
//            } else if (edgesWeigth.containsKey(pairUser.toStringUser2AndUser())) {
//                // edgeName = user2 + user - undirected edge
//                edgesWeigth.put(pairUser.toStringUser2AndUser(), edgesWeigth.get(pairUser.toStringUser2AndUser()) + Integer.valueOf(columns[4]));
            } else {
View Full Code Here
215
216
217
218
219
220
221
222
223
224
225
           
            /* Sum commit for each pair file that the pair devCommentter has commited. */
            // user > user2 - directed edge
            if (edgesWeigth.containsKey(pairUser.toStringUserAndUser2())) {
                // edgeName = user + user2
                edgesWeigth.put(pairUser.toStringUserAndUser2(), edgesWeigth.get(pairUser.toStringUserAndUser2()) + Integer.valueOf(columns[4]));
//            // for undirectional graph
//            } else if (edgesWeigth.containsKey(pairUser.toStringUser2AndUser())) {
//                // edgeName = user2 + user - undirected edge
//                edgesWeigth.put(pairUser.toStringUser2AndUser(), edgesWeigth.get(pairUser.toStringUser2AndUser()) + Integer.valueOf(columns[4]));
            } else {
View Full Code Here
221
222
223
224
225
226
227
228
229
230
231
//            // for undirectional graph
//            } else if (edgesWeigth.containsKey(pairUser.toStringUser2AndUser())) {
//                // edgeName = user2 + user - undirected edge
//                edgesWeigth.put(pairUser.toStringUser2AndUser(), edgesWeigth.get(pairUser.toStringUser2AndUser()) + Integer.valueOf(columns[4]));
            } else {
                edgesWeigth.put(pairUser.toStringUserAndUser2(), Integer.valueOf(columns[4]));
            }
           
            if (!graph.containsVertex(pairUser.getUser())
                    || !graph.containsVertex(pairUser.getUser2())
                    || !graph.containsEdge(pairUser.toStringUserAndUser2())) {
View Full Code Here
226
227
228
229
230
231
232
233
234
235
236
                edgesWeigth.put(pairUser.toStringUserAndUser2(), Integer.valueOf(columns[4]));
            }
           
            if (!graph.containsVertex(pairUser.getUser())
                    || !graph.containsVertex(pairUser.getUser2())
                    || !graph.containsEdge(pairUser.toStringUserAndUser2())) {
                graph.addEdge(pairUser.toStringUserAndUser2(), pairUser.getUser(), pairUser.getUser2(), EdgeType.DIRECTED);
            }
               
            // check if network already created
            if (pairFileNetwork.containsKey(pairFile)) {
View Full Code Here
227
228
229
230
231
232
233
234
235
236
237
            }
           
            if (!graph.containsVertex(pairUser.getUser())
                    || !graph.containsVertex(pairUser.getUser2())
                    || !graph.containsEdge(pairUser.toStringUserAndUser2())) {
                graph.addEdge(pairUser.toStringUserAndUser2(), pairUser.getUser(), pairUser.getUser2(), EdgeType.DIRECTED);
            }
               
            // check if network already created
            if (pairFileNetwork.containsKey(pairFile)) {
                pairFileNetwork.get(pairFile)
View Full Code Here
233
234
235
236
237
238
239
240
241
242
243
            }
               
            // check if network already created
            if (pairFileNetwork.containsKey(pairFile)) {
                pairFileNetwork.get(pairFile)
                        .addEdge(pairUser.toStringUserAndUser2(), pairUser.getUser(), pairUser.getUser2(), EdgeType.DIRECTED);
            } else {
                DirectedSparseGraph<String, String> graphMulti
                        = new DirectedSparseGraph<>();
                graphMulti.addEdge(pairUser.toStringUserAndUser2(), pairUser.getUser(), pairUser.getUser2(), EdgeType.DIRECTED);
                pairFileNetwork.put(pairFile, graphMulti);
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.