Groups
Sign in
Groups
concurrent-trees-discuss
Conversations
Labels
About
Send feedback
Help
concurrent-trees-discuss
Contact owners and managers
1–21 of 21
Welcome to the discussion group for the
Concurrent-Trees
library. Here you can ask questions about using the library, or discuss issues or post suggestions.
Mark all as read
Report group
0 selected
Giannis Evagorou
12/19/19
NodeFactory for integer sequences
Hello, I'm trying to index large sequences of integers (each character is guaranteed to be
unread,
NodeFactory for integer sequences
Hello, I'm trying to index large sequences of integers (each character is guaranteed to be
12/19/19
Vishesh Joshi
, …
Chris Miller
3
6/27/18
Collection values
Is the same thing possible for the inverted tree? It doesn't seem like it but maybe I'm
unread,
Collection values
Is the same thing possible for the inverted tree? It doesn't seem like it but maybe I'm
6/27/18
david...@consensys.net
12/5/17
run through a search result alphabetically
Hi, I am using a Suffix Tree and I want to show the result in an alphabetical order. Is this possible
unread,
run through a search result alphabetically
Hi, I am using a Suffix Tree and I want to show the result in an alphabetical order. Is this possible
12/5/17
John Leach
,
Niall Gallagher
4
9/5/17
Serialization of ConcurrentRadixTree
Hi John. Sorry for the delay. That would be an interesting use case for a radix tree. However I can
unread,
Serialization of ConcurrentRadixTree
Hi John. Sorry for the delay. That would be an interesting use case for a radix tree. However I can
9/5/17
Alper Sağlam
,
Niall Gallagher
2
7/30/17
byte arrays in memory
Hi Alper, I don't understand what you mean. It's an intrinsic part of radix trees to store
unread,
ConcurrentInvertedRadixTree
array
byte
consumption
memory
byte arrays in memory
Hi Alper, I don't understand what you mean. It's an intrinsic part of radix trees to store
7/30/17
Joel Fuentes
,
Niall
2
11/2/16
Non-blocking operations
Hi Joel, I did consider concurrent writes in the past, but I don't have any immediate plans to
unread,
Non-blocking operations
Hi Joel, I did consider concurrent writes in the past, but I don't have any immediate plans to
11/2/16
Ali Shahbour
,
Niall
3
11/2/16
CountryCode Searching
I'm not sure I understand the problem completely, but have you tried to use the
unread,
ConcurrentRadixTree
CountryCode Searching
I'm not sure I understand the problem completely, but have you tried to use the
11/2/16
Hamid Bagheri
,
Niall Gallagher
2
9/18/16
How to save index on the disc for future use?
Hi Hamid, One option is to consider using a CharSequence-based NodeFactory which should allow the
unread,
How to save index on the disc for future use?
Hi Hamid, One option is to consider using a CharSequence-based NodeFactory which should allow the
9/18/16
Lokesh Madan
,
Niall Gallagher
4
8/2/16
Multiple languages
Actually, Please ignore my last question. Regards, On Tuesday, August 2, 2016 at 12:23:59 PM UTC-7,
unread,
ConcurrentRadixTree
MultiLanguageSupport
Multiple languages
Actually, Please ignore my last question. Regards, On Tuesday, August 2, 2016 at 12:23:59 PM UTC-7,
8/2/16
shi yang
,
Niall Gallagher
2
6/4/16
How to traverse all trie
Hi Shi, You can use tree.getKeysStartingWith("") HTH, Niall On 3 Jun 2016, at 09:40, shi
unread,
How to traverse all trie
Hi Shi, You can use tree.getKeysStartingWith("") HTH, Niall On 3 Jun 2016, at 09:40, shi
6/4/16
Kyle Bolton
,
Niall
4
3/30/16
subtree or view of tree
No problem, glad it helped! On Wednesday, 30 March 2016 22:31:17 UTC+1, Kyle Bolton wrote: What. A.
unread,
subtree or view of tree
No problem, glad it helped! On Wednesday, 30 March 2016 22:31:17 UTC+1, Kyle Bolton wrote: What. A.
3/30/16
Vishesh Joshi
,
Niall
2
1/24/16
Serializable trees. (2.5.0)
Hi Vishesh, I have released 2.5.0. It should sync to Maven Central in ~2 hours. Let me know if you
unread,
Serializable trees. (2.5.0)
Hi Vishesh, I have released 2.5.0. It should sync to Maven Central in ~2 hours. Let me know if you
1/24/16
Phuong Dao
,
Niall
4
11/3/15
reduce memory usage for single thread
Hi Phuong, I see. Normally I would recommend to use the DefaultCharSequenceNodeFactory to reduce
unread,
reduce memory usage for single thread
Hi Phuong, I see. Normally I would recommend to use the DefaultCharSequenceNodeFactory to reduce
11/3/15
dusan....@gmail.com
, …
hcouplet
4
6/24/14
Expose API to get longest prefix match
TreeMap will not work if you add in you sample map.put("4210", "3"); System.out.
unread,
Expose API to get longest prefix match
TreeMap will not work if you add in you sample map.put("4210", "3"); System.out.
6/24/14
Stefan Bunk
,
Niall Gallagher
2
6/6/14
Prefix tree on a word basis
Hi Stefan, Do you want to do lookups on the tree based on entries being prefixed by whole words? That
unread,
Prefix tree on a word basis
Hi Stefan, Do you want to do lookups on the tree based on entries being prefixed by whole words? That
6/6/14
Haluk Dogan
,
Niall Gallagher
2
3/25/14
LCSubstringSolverUsage how to return indexes and matched length
Hi Haluk, You can get the length of the common substring by calling CharSequence.length() on the
unread,
LCSSubstring
suffixtree
LCSubstringSolverUsage how to return indexes and matched length
Hi Haluk, You can get the length of the common substring by calling CharSequence.length() on the
3/25/14
Nino Walker
,
Niall
2
2/27/14
Fast whole word matching in text
Hi Nino, I don't follow exactly how your example works (without spending time to examine it more
unread,
ConcurrentInvertedRadixTree
Fast whole word matching in text
Hi Nino, I don't follow exactly how your example works (without spending time to examine it more
2/27/14
Tom Pierce
,
Niall
3
12/3/13
Counting members of ConcurrentRadixTree?
I've implemented tree.size() methods on the trees. You can track it in issue 8. On Tuesday, 3
unread,
Counting members of ConcurrentRadixTree?
I've implemented tree.size() methods on the trees. You can track it in issue 8. On Tuesday, 3
12/3/13
Happy Hamster
,
Niall
3
10/20/13
How to lower memory usage?
This is implemented in concurrent-trees 2.3.0. Try DefaultByteArrayNodeFactory or
unread,
How to lower memory usage?
This is implemented in concurrent-trees 2.3.0. Try DefaultByteArrayNodeFactory or
10/20/13
Beth Tirado
,
Niall
3
10/7/13
Why doesn't InvertedRadixTree include all the methods in RadixTree?
Hi Beth, You are right that the underlying tree structure is the same in both RadixTree and
unread,
Why doesn't InvertedRadixTree include all the methods in RadixTree?
Hi Beth, You are right that the underlying tree structure is the same in both RadixTree and
10/7/13
tom-m...@att.net
,
Niall
2
4/7/13
Spell correction possible?
Thanks! Spelling correction is an interesting question. I guess there are a few levels of spelling
unread,
Spell correction possible?
Thanks! Spelling correction is an interesting question. I guess there are a few levels of spelling
4/7/13