Age | Commit message (Collapse) | Author |
|
Change-Id: If56abefa81b41479e3ea9890dee1c43f006086de
Reviewed-on: https://gerrit.libreoffice.org/24384
Tested-by: Jenkins <ci@libreoffice.org>
Reviewed-by: Noel Grandin <noelgrandin@gmail.com>
|
|
using an idea from dtardon:
<dtardon> noelgrandin, hi. could you try to run the unusedmethods clang
plugin with "make build-nocheck"? that would catch functions that are
only used in tests. e.g., i just removed the whole o3tl::range class,
which has not been used in many years, but htere was a test for it...
<noelgrandin> dtardon, interesting idea! Sure, I can do that.
Change-Id: I5653953a426a2186a1e43017212d87ffce520387
Reviewed-on: https://gerrit.libreoffice.org/22041
Reviewed-by: Noel Grandin <noelgrandin@gmail.com>
Tested-by: Noel Grandin <noelgrandin@gmail.com>
|
|
Change-Id: I9fe00eef7ddcd4a3c87e497a8d62f98e71a0d6d8
|
|
Change-Id: I2a1add8cf526cdb305ad99ccb138454a88f2fdbd
|
|
Change-Id: I332d3b3158b46cf130540c6e1479dd01cb457d03
|
|
Change-Id: If3e2dd3905cc33f1e7fc9fbfbb9f2bb49a756a34
|
|
Change-Id: I01d9123fcad19aa84a41eb990fb65954314a4802
|
|
Change-Id: I7611c5307e4d4e925dc3e54c6b3f2d1a47bd9080
|
|
Change-Id: I9603cc51545f72fdb0854f2d76e2326706329000
|
|
Change-Id: Ibf04062ca86ed866202d748c3b62a210d30ed6ec
|
|
Change-Id: Ib2d2b668f2ec17742a069d63506cdd2d25d10f0d
|
|
Change-Id: Ie8ce0ebb9ec979575657a89ebbfe4d01142b04e5
|
|
Added simple Trie lookup tree which is more tailored to what is needed
in autocomplete implementation, but still has the speed of the
LatinLookupTree that has been used till now. As the implementation
is much simpler it should be more managable and easier fixable.
For now two actions: insert (word) and findSuggestions are supported.
Acttion findSuggestion returns all words in a list for a searched
sub-word, it also fixes fdo#62945.
Change-Id: I63b69c30d28b4e1c465c2122ebc537f7f75a033a
|
|
Change-Id: I7a32e8d7c21c1e87e1acab9020f9ecbb7e441f2c
|
|
...when running editeng/CppunitTest_editeng_lookuptree.mk
Change-Id: Ida1cbb16965138a42bec9e675b630bcbf2f6617e
|
|
LookupTree is a tree structure for fast autocompletion lookups.
Additionally the tree structure stores word probabilities, so each
autocompletion request returns a result with highest probability.
LatinLookupTree is an implementation which was designed to be even
faster and more efficient latin text, however it works with any kind
of unicode strings.
The tree structure was coded by Nico Weyand, Unicode strings support
and conversion to Libreoffice code structure was done by me.
Change-Id: I6549ee45d0952407b8a070f30ed0598fcb420aa7
|