check for exceeded order

Author: jermp

test_data/queries.not_found

@@ -9,3 +9,6 @@ identified, been then
 (XMM vector registers
 are...
 programmers software of to some
+appendix at www.agner.org/optimize/cppexamples.zip for how for how
+appendix at www.agner.org/optimize/cppexamples.zip for how for how appendix should
+appendix at www.agner.org/optimize/cppexamples.zip for how for how appendix should for how for how appendix should

trie_count_lm.hpp

@@ -268,28 +268,27 @@ namespace tongrams {
         uint64_t lookup(T gram, Adaptor adaptor)
         {
             static uint64_t word_ids[global::max_order];
-            uint64_t order =
+            uint64_t o =
                 m_mapper.map_query(adaptor(gram), word_ids,
                                    &m_vocab, &m_arrays.front(),
                                    m_remapping_order);
 
-            if (order == global::not_found) {
+            if (o == global::not_found or o > order()) {
                 return global::not_found;
             }
-            assert(order < m_order);
 
             pointer_range r;
             uint64_t pos = word_ids[0];
-            for (uint64_t i = 1; i <= order; ++i) {
+            for (uint64_t i = 1; i <= o; ++i) {
                 r = m_arrays[i - 1].range(pos);
                 pos = m_arrays[i].position(r, word_ids[i]);
                 if (pos == global::not_found) {
                     return global::not_found;
                 }
             }
 
-            uint64_t count_rank = m_arrays[order].count_rank(pos);
-            return m_distinct_counts.access(order, count_rank);
+            uint64_t count_rank = m_arrays[o].count_rank(pos);
+            return m_distinct_counts.access(o, count_rank);
         }
 
         inline uint64_t order() const {