[
https://issues.apache.org/jira/browse/GIRAPH-28?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13103343#comment-13103343
]
Avery Ching commented on GIRAPH-28:
-----------------------------------
Would we guarantee that iterator() would always be sorted? For instance, what
about something like TinyVertex? A pair of arrays would be expensive to keep
sorted...
Or are you suggesting that whether iterator is sorted or not depends on the
implementation?
I agree that implementing Iterable is pretty convenient for users. Perhaps
have both (implement Iterable and the two other methods)? This would allow
applications based on TinyVertex to be optimized when not requiring sorting.
> 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
