[Neo] Infinite recursion bug in SimpleIndexHits.java (LuceneIndexService.getNodes)

2010-01-19 Thread Lachlan Cotter
Hi all, I've just started working with Neo4j and I've run into a problem (bug?) with the indexing component. I did a simple test calling getNodes() on a LuceneIndexService instance. This results in a stack overflow error caused by apparently infinite recursion in SimpleIndexHits. When I

Re: [Neo] Infinite recursion bug in SimpleIndexHits.java (LuceneIndexService.getNodes)

2010-01-20 Thread Lachlan Cotter
, Mattias Persson wrote: The index-util component has changed name to index (with the artifactId neo4j-index) after our refactoring... so please considering using that instead (where this bug is fixed). But I'll fix this bug anyways, well spotted! 2010/1/20 Lachlan Cotter l...@lachlanc.id.au

Re: [Neo] Leaderboard?

2010-03-15 Thread Lachlan Cotter
Probably depends on the logic of your scoring system, I would think. On 16/03/2010, at 8:43 AM, Rick Bullotta wrote: Perhaps a linked list using relationships? Or even a btree should be doable? --Original Message-- From: Mattias Ask Sender: user-boun...@lists.neo4j.org To: Neo

Re: [Neo] Leaderboard?

2010-03-16 Thread Lachlan Cotter
have to sort when getting the top scores. What I really was hoping for some magic Lucene-sorted-index-type-of-thingy ;) Any ideas on that? /Mattias On Mon, Mar 15, 2010 at 11:19 PM, Lachlan Cotter l...@lachlanc.id.au wrote: Probably depends on the logic of your scoring system, I