concurrent-trees

concurrent-trees copied to clipboard

New types of tree: ConcurrentPermutermTree, ConcurrentWildcardTree for wildcard queries

8

``` It would be useful to support wildcard queries. Two approaches to be investigated (both of which will be tracked in this issue): (1) A permuterm index on top of...

GoogleCodeExporter

Reduce compile target to Java 5, address serialization issues and improve performance

4

Thanks for this library, I have not found an equally comprehensive standalone implementation of a radix tree for Java, I really appreciate that you put this out! I was planning...

raphw

I am not sure if you wanted to add this, but with these changes all trees become iterable over their values. This can be rather convenient, especially with newer Java...

raphw

`03-30 12:31:41.152 3068 9801 E AndroidRuntime: java.lang.IllegalStateException: Unexpected failure to classify SearchResult: SearchResult{key=537742223652646, nodeFound=Node{edge=23652646, value=[29], edges=[]}, charsMatched=15, charsMatchedInNodeFound=8, parentNode=Node{edge=422, value=null, edges=[Node{edge=23652646, value=[29], edges=[]}, Node{edge=78335, value=[26], edges=[]}]}, parentNodesParent=Node{edge=77, value=null, edges=[Node{edge=334262, value=[10],...

Haydnp74

Crash: faliure to classiffy

2

```java java.lang.IllegalStateException: Unexpected failure to classify SearchResult: SearchResult{key=/storage/emulated/0, nodeFound=Node{edge=/storage/emulated/0, value=0, edges=[]}, charsMatched=19, charsMatchedInNodeFound=19, parentNode=Node{edge=, value=null, edges=[Node{edge=/storage/emulated/0, value=0, edges=[]}, Node{edge=0, value=3, edges=[]}, Node{edge=1, value=4, edges=[]}, Node{edge=2, value=5, edges=[]}, Node{edge=3, value=6, edges=[]},...

EmmanuelMess

Bumps [junit](https://github.com/junit-team/junit4) from 4.8.2 to 4.13.1. Release notes Sourced from junit's releases. JUnit 4.13.1 Please refer to the release notes for details. JUnit 4.13 Please refer to the release notes...

dependabot[bot]

Non-linearizable behavior of ConcurrentSuffixTree

2

There is a bug that an element, that is added in a concurrent thread, can be found by `getValueForExactKey` and not found by the following `getValuesForKeysEndingWith`. The bug can be...

alefedor

Initial idea of porting this code to C#

1

Hi Niall, I've started to basically port your code to C# initially without any support for **thread-safety** nor consistency for concurrent modifications. I'd like to know if you have any...

rodfsouza

The current documentation does not mention these methods in InvertedRadixTree: - `getLongestKeyPrefixing(CharSequence var1)` - `getValueForLongestKeyPrefixing(CharSequence var1)` - `getKeyValuePairForLongestKeyPrefixing(CharSequence var1)` I had a usecase for creating simple URL wild card matching,...

shully

Why not implement trie directly in byte array?

publicocean0