--
You received this message because you are subscribed to the Google Groups "Google App Engine Ranklist" group.
To view this discussion on the web visit https://groups.google.com/d/msg/google-app-engine-ranklist/-/9xZeZJpbuPYJ.
To post to this group, send email to google-app-en...@googlegroups.com.
To unsubscribe from this group, send email to google-app-engine-r...@googlegroups.com.
For more options, visit this group at http://groups.google.com/group/google-app-engine-ranklist?hl=en.
--
You received this message because you are subscribed to the Google Groups "Google App Engine Ranklist" group.
To view this discussion on the web visit https://groups.google.com/d/msg/google-app-engine-ranklist/-/8ocCDp2Us9kJ.
The information is there, but not convenient. It's like there's a hash table mapping from name to score. The mapping from score to names exists in principle, but is hard to get at in practice.
--
You received this message because you are subscribed to the Google Groups "Google App Engine Ranklist" group.
To view this discussion on the web visit https://groups.google.com/d/msg/google-app-engine-ranklist/-/8ocCDp2Us9kJ.
I don't need the ranker at all to find people with lower score than person X. I look up X's score in his scoreboard row entity, and then query for scoreboard row entities with smaller scores (sorting descending by score).
Ah, I see. For that we find the rank R of X using the ranker, then assume the first person returned by the query has rank R+1, etc., with special logic for dealing with ties. FindRanks would work too, but it's an unnecessary datastore call.