| /dports/japanese/mozc-server/mozc-2.23.2815.102.01/src/storage/louds/ |
| H A D | louds_trie.h | 84 bool IsTerminalNode(const Node &node) const { in IsTerminalNode() function
161 return Traverse(key, &node) && IsTerminalNode(node); in HasKey()
191 if (IsTerminalNode(node)) { in PrefixSearch()
|
| H A D | louds_trie_test.cc | 169 EXPECT_FALSE(trie.IsTerminalNode(root)); in TEST_P()
182 ASSERT_TRUE(trie.IsTerminalNode(node_a)); in TEST_P()
201 EXPECT_FALSE(trie.IsTerminalNode(node_b)); in TEST_P()
220 ASSERT_TRUE(trie.IsTerminalNode(node_aa)); in TEST_P()
242 ASSERT_TRUE(trie.IsTerminalNode(node_ab)); in TEST_P()
264 ASSERT_TRUE(trie.IsTerminalNode(node_bd)); in TEST_P()
287 EXPECT_FALSE(trie.IsTerminalNode(node_abc)); in TEST_P()
303 ASSERT_TRUE(trie.IsTerminalNode(node_abd)); in TEST_P()
326 ASSERT_TRUE(trie.IsTerminalNode(node_abcd)); in TEST_P()
|
| H A D | louds_trie.cc | 126 if (Traverse(key, &node) && IsTerminalNode(node)) { in ExactSearch()
|
| /dports/japanese/uim-mozc/mozc-2.23.2815.102.01/src/storage/louds/ |
| H A D | louds_trie.h | 84 bool IsTerminalNode(const Node &node) const { in IsTerminalNode() function
161 return Traverse(key, &node) && IsTerminalNode(node); in HasKey()
191 if (IsTerminalNode(node)) { in PrefixSearch()
|
| H A D | louds_trie_test.cc | 169 EXPECT_FALSE(trie.IsTerminalNode(root)); in TEST_P()
182 ASSERT_TRUE(trie.IsTerminalNode(node_a)); in TEST_P()
201 EXPECT_FALSE(trie.IsTerminalNode(node_b)); in TEST_P()
220 ASSERT_TRUE(trie.IsTerminalNode(node_aa)); in TEST_P()
242 ASSERT_TRUE(trie.IsTerminalNode(node_ab)); in TEST_P()
264 ASSERT_TRUE(trie.IsTerminalNode(node_bd)); in TEST_P()
287 EXPECT_FALSE(trie.IsTerminalNode(node_abc)); in TEST_P()
303 ASSERT_TRUE(trie.IsTerminalNode(node_abd)); in TEST_P()
326 ASSERT_TRUE(trie.IsTerminalNode(node_abcd)); in TEST_P()
|
| H A D | louds_trie.cc | 126 if (Traverse(key, &node) && IsTerminalNode(node)) { in ExactSearch()
|
| /dports/japanese/mozc-tool/mozc-2.23.2815.102.01/src/storage/louds/ |
| H A D | louds_trie.h | 84 bool IsTerminalNode(const Node &node) const { in IsTerminalNode() function
161 return Traverse(key, &node) && IsTerminalNode(node); in HasKey()
191 if (IsTerminalNode(node)) { in PrefixSearch()
|
| H A D | louds_trie_test.cc | 169 EXPECT_FALSE(trie.IsTerminalNode(root)); in TEST_P()
182 ASSERT_TRUE(trie.IsTerminalNode(node_a)); in TEST_P()
201 EXPECT_FALSE(trie.IsTerminalNode(node_b)); in TEST_P()
220 ASSERT_TRUE(trie.IsTerminalNode(node_aa)); in TEST_P()
242 ASSERT_TRUE(trie.IsTerminalNode(node_ab)); in TEST_P()
264 ASSERT_TRUE(trie.IsTerminalNode(node_bd)); in TEST_P()
287 EXPECT_FALSE(trie.IsTerminalNode(node_abc)); in TEST_P()
303 ASSERT_TRUE(trie.IsTerminalNode(node_abd)); in TEST_P()
326 ASSERT_TRUE(trie.IsTerminalNode(node_abcd)); in TEST_P()
|
| H A D | louds_trie.cc | 126 if (Traverse(key, &node) && IsTerminalNode(node)) { in ExactSearch()
|
| /dports/japanese/mozc-el/mozc-2.23.2815.102.01/src/storage/louds/ |
| H A D | louds_trie.h | 84 bool IsTerminalNode(const Node &node) const { in IsTerminalNode() function
161 return Traverse(key, &node) && IsTerminalNode(node); in HasKey()
191 if (IsTerminalNode(node)) { in PrefixSearch()
|
| H A D | louds_trie_test.cc | 169 EXPECT_FALSE(trie.IsTerminalNode(root)); in TEST_P()
182 ASSERT_TRUE(trie.IsTerminalNode(node_a)); in TEST_P()
201 EXPECT_FALSE(trie.IsTerminalNode(node_b)); in TEST_P()
220 ASSERT_TRUE(trie.IsTerminalNode(node_aa)); in TEST_P()
242 ASSERT_TRUE(trie.IsTerminalNode(node_ab)); in TEST_P()
264 ASSERT_TRUE(trie.IsTerminalNode(node_bd)); in TEST_P()
287 EXPECT_FALSE(trie.IsTerminalNode(node_abc)); in TEST_P()
303 ASSERT_TRUE(trie.IsTerminalNode(node_abd)); in TEST_P()
326 ASSERT_TRUE(trie.IsTerminalNode(node_abcd)); in TEST_P()
|
| H A D | louds_trie.cc | 126 if (Traverse(key, &node) && IsTerminalNode(node)) { in ExactSearch()
|
| /dports/japanese/fcitx-mozc/mozc-2.23.2815.102.01/src/storage/louds/ |
| H A D | louds_trie.h | 84 bool IsTerminalNode(const Node &node) const { in IsTerminalNode() function
161 return Traverse(key, &node) && IsTerminalNode(node); in HasKey()
191 if (IsTerminalNode(node)) { in PrefixSearch()
|
| H A D | louds_trie_test.cc | 169 EXPECT_FALSE(trie.IsTerminalNode(root)); in TEST_P()
182 ASSERT_TRUE(trie.IsTerminalNode(node_a)); in TEST_P()
201 EXPECT_FALSE(trie.IsTerminalNode(node_b)); in TEST_P()
220 ASSERT_TRUE(trie.IsTerminalNode(node_aa)); in TEST_P()
242 ASSERT_TRUE(trie.IsTerminalNode(node_ab)); in TEST_P()
264 ASSERT_TRUE(trie.IsTerminalNode(node_bd)); in TEST_P()
287 EXPECT_FALSE(trie.IsTerminalNode(node_abc)); in TEST_P()
303 ASSERT_TRUE(trie.IsTerminalNode(node_abd)); in TEST_P()
326 ASSERT_TRUE(trie.IsTerminalNode(node_abcd)); in TEST_P()
|
| H A D | louds_trie.cc | 126 if (Traverse(key, &node) && IsTerminalNode(node)) { in ExactSearch()
|
| /dports/japanese/ibus-mozc/mozc-2.23.2815.102.01/src/storage/louds/ |
| H A D | louds_trie.h | 84 bool IsTerminalNode(const Node &node) const { in IsTerminalNode() function
161 return Traverse(key, &node) && IsTerminalNode(node); in HasKey()
191 if (IsTerminalNode(node)) { in PrefixSearch()
|
| H A D | louds_trie_test.cc | 169 EXPECT_FALSE(trie.IsTerminalNode(root)); in TEST_P()
182 ASSERT_TRUE(trie.IsTerminalNode(node_a)); in TEST_P()
201 EXPECT_FALSE(trie.IsTerminalNode(node_b)); in TEST_P()
220 ASSERT_TRUE(trie.IsTerminalNode(node_aa)); in TEST_P()
242 ASSERT_TRUE(trie.IsTerminalNode(node_ab)); in TEST_P()
264 ASSERT_TRUE(trie.IsTerminalNode(node_bd)); in TEST_P()
287 EXPECT_FALSE(trie.IsTerminalNode(node_abc)); in TEST_P()
303 ASSERT_TRUE(trie.IsTerminalNode(node_abd)); in TEST_P()
326 ASSERT_TRUE(trie.IsTerminalNode(node_abcd)); in TEST_P()
|
| H A D | louds_trie.cc | 126 if (Traverse(key, &node) && IsTerminalNode(node)) { in ExactSearch()
|
| /dports/math/vtk9/VTK-9.1.0/Common/DataModel/ |
| H A D | vtkHyperTreeGridEntry.cxx | 114 bool vtkHyperTreeGridEntry::IsTerminalNode( in IsTerminalNode() function in vtkHyperTreeGridEntry
122 result = tree->IsTerminalNode(this->Index); in IsTerminalNode()
|
| H A D | vtkHyperTreeGridLevelEntry.cxx | 146 bool vtkHyperTreeGridLevelEntry::IsTerminalNode(const vtkHyperTreeGrid* grid) const in IsTerminalNode() function in vtkHyperTreeGridLevelEntry
152 result = this->Tree->IsTerminalNode(this->Index); in IsTerminalNode()
|
| H A D | vtkHyperTreeGridGeometryEntry.cxx | 128 bool vtkHyperTreeGridGeometryEntry::IsTerminalNode( in IsTerminalNode() function in vtkHyperTreeGridGeometryEntry
135 result = tree->IsTerminalNode(this->Index); in IsTerminalNode()
|
| H A D | vtkHyperTreeGridGeometryLevelEntry.cxx | 124 bool vtkHyperTreeGridGeometryLevelEntry::IsTerminalNode(const vtkHyperTreeGrid* grid) const in IsTerminalNode() function in vtkHyperTreeGridGeometryLevelEntry
130 result = this->Tree->IsTerminalNode(this->Index); in IsTerminalNode()
|
| H A D | vtkHyperTreeGridEntry.h | 172 bool IsTerminalNode(
|
| /dports/math/vtk6/VTK-6.2.0/Common/DataModel/ |
| H A D | vtkHyperTreeCursor.h | 80 virtual bool IsTerminalNode() = 0;
|
| /dports/devel/p5-Data-TreeDumper/Data-TreeDumper-0.40/ |
| H A D | TreeDumper.pm | 355 my $is_terminal_node = IsTerminalNode
880 $is_terminal_node = IsTerminalNode
927 $is_terminal_node = IsTerminalNode
1060 = IsTerminalNode
1117 sub IsTerminalNode subroutine
|