Avery Ching commented on GIRAPH-28:

Jake, I agree with all 3 of your points.  The only question I have is regarding 
implementing Iterable.  Will the user expect to get back a sorted iterator or a 
non-sorted one?  I'm guessing we'll lose some functionality here?  I don't 
think we would want to add a "switch" of sorts to choose.  The other way we had 
discussed way the methods

Iterator<Edge<I, E>> getOutEdgeIterator();
Iterator<Edge<I, E>> getSortedOutEdgeIterator();

as opposed to Iterable.

> 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, 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