ch complexity now to do it, and
> later on we may regret it and by then it becomes harder to do because there
> is an installed base.
> Niels
>
> > Date: Sat, 17 Sep 2011 14:19:04 +1200
> > From: bryc...@gmail.com
> > To: user@lists.neo4j.org
> > Subject: Re: [Neo4
e may regret it and by then it becomes harder to do because there is an
installed base.
Niels
> Date: Sat, 17 Sep 2011 14:19:04 +1200
> From: bryc...@gmail.com
> To: user@lists.neo4j.org
> Subject: Re: [Neo4j] Neo4j graph collections introduction of NodeCollection
> interface
>
ions of both Relationships
> and Nodes.
> Niels
>
> > Date: Fri, 16 Sep 2011 17:37:29 +1200
> > From: bryc...@gmail.com
> > To: user@lists.neo4j.org
> > Subject: [Neo4j] Neo4j graph collections introduction of NodeCollection
> interface
> >
> > Hi,
>
To: user@lists.neo4j.org
> Subject: [Neo4j] Neo4j graph collections introduction of NodeCollection
> interface
>
> Hi,
>
> I had mentioned in a previous thread that I was working on introducing a
> NodeCollection interface to remove the dependency from IndexedRelationsh
j.org
> Subject: Re: [Neo4j] Neo4j graph collections introduction of NodeCollection
> interface
>
> Also,
> since you can do node.getGraphDatabase(), I think we don't need to
> pass in the graphdb instance in
> new SortedTree( graphDb(), graph
Also,
since you can do node.getGraphDatabase(), I think we don't need to
pass in the graphdb instance in
new SortedTree( graphDb(), graphDb().createNode(), new IdComparator(),
true, RelTypes.INDEXED_RELATIONSHIP.name() );
?
Cheers,
/peter neubauer
GTalk: neubauer.peter
Skype peter.neu
Hi,
I had mentioned in a previous thread that I was working on introducing a
NodeCollection interface to remove the dependency from IndexedRelationship
to SortedTree. I have an initial cut of this up now in my github repo:
https://github.com/brycenz/graph-collections
It would be great to get com
7 matches
Mail list logo
