6 results (0.37 seconds) 

Did you mean: "Dictionary Trees"

    Google
     Custom Search
  1. DictionaryTrees
    Aug 24, 2013 ... These dictionary tree data structures are a hybrid between Tries and hash tables.
    The data is stored in a trie, but results of queries that take ...

    https://www.emacswiki.org/emacs/DictionaryTrees
  2. EmacsWiki: Category Persistence
    Aug 24, 2013 ... DeskTop · DictionaryTrees · SavePlace · BookMarks · RecentFiles · DiredPlus –
    use of dired-hack-local-variables to save the way a directory is ...

    https://www.emacswiki.org/emacs/CategoryPersistence
  3. EmacsWiki: Category Extensions
    Aug 24, 2013 ... AVLtrees – AVL tree data structures (self-balancing binary trees); DictionaryTrees
    – Advanced dictionary data structures; Heaps – Heap data ...

    https://www.emacswiki.org/emacs/CategoryExtensions
  4. EmacsWiki: Toby Cubitt
    Jan 17, 2015 ... PredictiveMode · UndoTree · AutoOverlays · CompletionUI · DictionaryTrees ·
    TernarySearchTrees (obsolete - use Tries instead); Tries ...

    https://www.emacswiki.org/emacs/TobyCubitt
  5. EmacsWiki: Predictive Mode
    Aug 24, 2013 ... The predictive completion package uses the CompletionUI, AutoOverlays,
    DictionaryTrees, Tries, TaggedNFA, Heaps, AVLtrees, and Queues ...

    https://www.emacswiki.org/emacs/PredictiveMode
  6. EmacsWiki: Category Code
    May 23, 2015 ... DictionaryTrees – Advanced dictionary data structures; ElispParser – A small
    parser tool written in EmacsLisp. EmacsDataBase is a flexible ...

    https://www.emacswiki.org/emacs/CategoryCode

Did you mean to search for: "Dictionary Trees"



 

Search Tips


©2017 Google