Jake Mannix commented on GIRAPH-28:

re: Iterable - I was thinking we'd just pick on way to iterate over the edges, 
not multiple: we could either have the getSortedOutEdges(), or simply 
iterator(), as a consequence of implementing Iterable, but not both.

The benefits of Iterable is the nice for-loop, and plays nice with google 
collections api: Iterables.any() / .concat() / .transform() / .partition() / 

The downside is the non-informative method name.

> Introduce new primitive-specific MutableVertex subclasses
> ---------------------------------------------------------
>                 Key: GIRAPH-28
>                 URL: https://issues.apache.org/jira/browse/GIRAPH-28
>             Project: Giraph
>          Issue Type: New Feature
>          Components: graph
>    Affects Versions: 0.70.0
>            Reporter: Jake Mannix
>            Assignee: Jake Mannix
>         Attachments: GIRAPH-28.diff
> As discussed on the list, 
> MutableVertex<LongWritable,DoubleWritable,FloatWritable,DoubleWritable> (for 
> example) could be highly optimized in its memory footprint if the vertex and 
> edge data were held in a form which minimized Java object usage.

This message is automatically generated by JIRA.
For more information on JIRA, see: http://www.atlassian.com/software/jira


Reply via email to