作者:书友36110188 | 来源:互联网 | 2023-05-28 19:23
Imlookingintoimplementinganin-firebaseindexasdescribedhere:https:stackoverflow.coma10
I'm looking into implementing an in-firebase index as described here: https://stackoverflow.com/a/10559689/534086, and trying to figure out how to deal with sorting data in descending order. Is it possible if you have a node with children 'a', 'b', 'c' to retrieve them 'c', 'b', 'a'? (while still being able to retrieve them in the original order as well?)
我正在考虑实现这里描述的in-firebase索引:https://stackoverflow.com/a/10559689/534086,并试图找出如何处理按降序排序数据。如果你有一个带有'a','b','c'的节点来检索它们'c','b','a',这是否可能? (虽然仍能按原始顺序检索它们?)
If it's not possible to traverse the node both forwards and backwards and I need to create two indexes, is their an easy algorithm for generating keys that sort in reverse lexographic order? For numbers, I think you can multiply by -1, but not sure how to handle strings...
如果无法向前和向后遍历节点并且我需要创建两个索引,那么它们是一种简单的算法,用于生成按反向词法顺序排序的密钥吗?对于数字,我认为你可以乘以-1,但不知道如何处理字符串...
2 个解决方案