reference, declarationdefinition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced

Declarations

tools/clang/tools/extra/clangd/index/dex/PostingList.h
   66   std::unique_ptr<Iterator> iterator(const Token *Tok = nullptr) const;

References

tools/clang/tools/extra/clangd/index/dex/Dex.cpp
  106                                    : It->second.iterator(&It->first);
tools/clang/tools/extra/clangd/unittests/DexTests.cpp
   50   auto DocIterator = L.iterator();
   76   auto And = C.intersect(L1.iterator(), L0.iterator());
   76   auto And = C.intersect(L1.iterator(), L0.iterator());
   81   And = C.intersect(L0.iterator(), L1.iterator());
   81   And = C.intersect(L0.iterator(), L1.iterator());
  102   auto And = C.intersect(L0.iterator(), L1.iterator(), L2.iterator());
  102   auto And = C.intersect(L0.iterator(), L1.iterator(), L2.iterator());
  102   auto And = C.intersect(L0.iterator(), L1.iterator(), L2.iterator());
  116   auto Empty1 = C.intersect(L1.iterator(), L2.iterator());
  116   auto Empty1 = C.intersect(L1.iterator(), L2.iterator());
  117   auto Empty2 = C.intersect(L1.iterator(), L2.iterator());
  117   auto Empty2 = C.intersect(L1.iterator(), L2.iterator());
  128   auto Or = C.unionOf(L0.iterator(), L1.iterator());
  128   auto Or = C.unionOf(L0.iterator(), L1.iterator());
  151   Or = C.unionOf(L0.iterator(), L1.iterator());
  151   Or = C.unionOf(L0.iterator(), L1.iterator());
  163   auto Or = C.unionOf(L0.iterator(), L1.iterator(), L2.iterator());
  163   auto Or = C.unionOf(L0.iterator(), L1.iterator(), L2.iterator());
  163   auto Or = C.unionOf(L0.iterator(), L1.iterator(), L2.iterator());
  221       C.intersect(L0.iterator(), C.boost(L1.iterator(), 2U)),
  221       C.intersect(L0.iterator(), C.boost(L1.iterator(), 2U)),
  223       C.unionOf(C.boost(L2.iterator(), 3U), C.boost(L3.iterator(), 4U)));
  223       C.unionOf(C.boost(L2.iterator(), 3U), C.boost(L3.iterator(), 4U)));
  250   auto I1 = L1.iterator();
  255   auto I2 = L1.iterator(&Tok);
  270   auto DocIterator = C.limit(L0.iterator(), 42);
  273   DocIterator = C.limit(L0.iterator(), 3);
  276   DocIterator = C.limit(L0.iterator(), 0);
  280       C.intersect(C.limit(C.all(), 343), C.limit(L0.iterator(), 2),
  281                   C.limit(L1.iterator(), 3), C.limit(L2.iterator(), 42));
  281                   C.limit(L1.iterator(), 3), C.limit(L2.iterator(), 42));
  299   auto Root = C.unionOf(C.all(), C.boost(L0.iterator(), 2U),
  300                         C.boost(L1.iterator(), 3U));
  330   EXPECT_EQ(llvm::to_string(*C.intersect(L1.iterator(), C.all())), "[1]");
  331   EXPECT_EQ(llvm::to_string(*C.intersect(L1.iterator(), C.none())), "false");
  333   EXPECT_EQ(llvm::to_string(*C.unionOf(L1.iterator(), C.all())),
  335   EXPECT_EQ(llvm::to_string(*C.unionOf(L1.iterator(), C.none())), "[1]");
  339                 L1.iterator(), C.intersect(L1.iterator(), L1.iterator()))),
  339                 L1.iterator(), C.intersect(L1.iterator(), L1.iterator()))),
  339                 L1.iterator(), C.intersect(L1.iterator(), L1.iterator()))),
  342                 L1.iterator(), C.unionOf(L2.iterator(), L3.iterator()))),
  342                 L1.iterator(), C.unionOf(L2.iterator(), L3.iterator()))),
  342                 L1.iterator(), C.unionOf(L2.iterator(), L3.iterator()))),
  347                 C.intersect(L1.iterator(), C.intersect()), C.unionOf(C.all()))),