-
The current algorithm is slow and will take FOREVER on longer strings. Could it be broken up somehow? Streamlined? ~Could I maybe use heuristics?~
-
## 🚀 Feature
(A clear and concise description of what the feature is.)
## Have you spent some time to check if this issue has been raised before?
Yes, this issue hasn't been raised earlier.
…
-
Hey there, i am a zig newbie here.
It looks to me that the router is splitting the called url path by slash and matching on those substrings.
The trie is the correct data structure for this but it w…
-
Hi,
I´m loading 4,6 million keywords + their replacements into flashtext.
The raw data in a pandas dataframe consumes approx. 1 GB RAM, profiled with pd.DataFrame.memory_usage(True, True) and gu…
-
Different plugin ideas require to filter / modify the results according to the host of the URL.
Usage examples:
* the https_rewrite plugin, and the current implementation fails to do so: https://…
-
```[tasklist]
### Tasks
- [ ] openssl/openssl#20940
- [ ] https://github.com/openssl/project/issues/193
- [ ] https://github.com/openssl/project/issues/192
- [ ] Analyse the TLS Handshake test to iden…
-
实现一个 Trie (前缀树)，包含 `insert`, `search`, 和 `startsWith `这三个操作。
#### 示例:
- Trie trie = new Trie();
-
- trie.insert("apple");
- trie.search("apple"); // 返回 true
- trie.search("app"); // 返…
-
Currently, string keys are rather unwieldy. They cannot be used directly in QP-tries, and must either be wrapped individually or funnelled through ancillary inherent methods – loose methods which exis…
-
Would it be possible to extend your implementation with a function : Partial-Match Searching
F.i. pmsearch(root, 'a.a.a.' )
like in the DrDobbs Article from 1998?
Thanks in advise.
joe63 updated
2 years ago
-
Hi,
I have successful run all those steps in README and have bible.arpa bible.binary but there is no trie file
How can I generate trie? I cant find any tutorial about this