[ 
https://issues.apache.org/jira/browse/FLINK-2254?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15733483#comment-15733483
 ] 

ASF GitHub Bot commented on FLINK-2254:
---------------------------------------

Github user greghogan commented on a diff in the pull request:

    https://github.com/apache/flink/pull/2564#discussion_r91613888
  
    --- Diff: 
flink-test-utils-parent/flink-test-utils/src/main/java/org/apache/flink/test/util/TestBaseUtils.java
 ---
    @@ -480,16 +480,22 @@ protected static File asFile(String path) {
                                resultStrings[i] = (val == null) ? "null" : 
val.toString();
                        }
                }
    -           
    -           assertEquals("Wrong number of elements result", 
expectedStrings.length, resultStrings.length);
    +
    +           //
    +           String msg = String.format(
    +                   "Different elements in arrays. Expected %d elements: 
%s. Actual %d elements: %s",
    +                   expectedStrings.length, 
Arrays.toString(expectedStrings),
    +                   resultStrings.length, Arrays.toString(resultStrings));
    +
    +           assertEquals(msg, expectedStrings.length, resultStrings.length);
     
                if (sort) {
                        Arrays.sort(expectedStrings);
                        Arrays.sort(resultStrings);
                }
                
                for (int i = 0; i < expectedStrings.length; i++) {
    -                   assertEquals(expectedStrings[i], resultStrings[i]);
    +                   assertEquals(msg, expectedStrings[i], resultStrings[i]);
    --- End diff --
    
    Do we need to include `msg` here?


> Add Bipartite Graph Support for Gelly
> -------------------------------------
>
>                 Key: FLINK-2254
>                 URL: https://issues.apache.org/jira/browse/FLINK-2254
>             Project: Flink
>          Issue Type: New Feature
>          Components: Gelly
>    Affects Versions: 0.10.0
>            Reporter: Andra Lungu
>            Assignee: Ivan Mushketyk
>              Labels: requires-design-doc
>
> A bipartite graph is a graph for which the set of vertices can be divided 
> into two disjoint sets such that each edge having a source vertex in the 
> first set, will have a target vertex in the second set. We would like to 
> support efficient operations for this type of graphs along with a set of 
> metrics(http://jponnela.com/web_documents/twomode.pdf). 



--
This message was sent by Atlassian JIRA
(v6.3.4#6332)

Reply via email to