Home
last modified time | relevance | path

Searched refs:is_subtree (Results 1 – 25 of 50) sorted by relevance

12

/dports/net/wireshark-lite/wireshark-3.6.1/wsutil/wmem/
H A Dwmem_tree.c263 if (node->is_subtree) { in free_tree_node()
324 void *data, wmem_node_color_t color, gboolean is_subtree) in create_node() argument
338 node->is_subtree = is_subtree; in create_node()
352 void*(*func)(void*), void* data, gboolean is_subtree, gboolean replace) in lookup_or_insert32_node() argument
360 CREATE_DATA(func, data), WMEM_NODE_COLOR_BLACK, is_subtree); in lookup_or_insert32_node()
384 is_subtree); in lookup_or_insert32_node()
396 is_subtree); in lookup_or_insert32_node()
731 if (node->is_subtree) { in wmem_tree_foreach_nodes()
786 node->is_subtree?"tree":"data", node->data); in wmem_tree_print_nodes()
792 if (data_printer && !node->is_subtree) { in wmem_tree_print_nodes()
[all …]
H A Dwmem_tree-int.h36 gboolean is_subtree; member
/dports/net/wireshark/wireshark-3.6.1/wsutil/wmem/
H A Dwmem_tree.c263 if (node->is_subtree) { in free_tree_node()
324 void *data, wmem_node_color_t color, gboolean is_subtree) in create_node() argument
338 node->is_subtree = is_subtree; in create_node()
352 void*(*func)(void*), void* data, gboolean is_subtree, gboolean replace) in lookup_or_insert32_node() argument
360 CREATE_DATA(func, data), WMEM_NODE_COLOR_BLACK, is_subtree); in lookup_or_insert32_node()
384 is_subtree); in lookup_or_insert32_node()
396 is_subtree); in lookup_or_insert32_node()
731 if (node->is_subtree) { in wmem_tree_foreach_nodes()
786 node->is_subtree?"tree":"data", node->data); in wmem_tree_print_nodes()
792 if (data_printer && !node->is_subtree) { in wmem_tree_print_nodes()
[all …]
H A Dwmem_tree-int.h36 gboolean is_subtree; member
/dports/net/tshark-lite/wireshark-3.6.1/wsutil/wmem/
H A Dwmem_tree.c263 if (node->is_subtree) { in free_tree_node()
324 void *data, wmem_node_color_t color, gboolean is_subtree) in create_node() argument
338 node->is_subtree = is_subtree; in create_node()
352 void*(*func)(void*), void* data, gboolean is_subtree, gboolean replace) in lookup_or_insert32_node() argument
360 CREATE_DATA(func, data), WMEM_NODE_COLOR_BLACK, is_subtree); in lookup_or_insert32_node()
384 is_subtree); in lookup_or_insert32_node()
396 is_subtree); in lookup_or_insert32_node()
731 if (node->is_subtree) { in wmem_tree_foreach_nodes()
786 node->is_subtree?"tree":"data", node->data); in wmem_tree_print_nodes()
792 if (data_printer && !node->is_subtree) { in wmem_tree_print_nodes()
[all …]
H A Dwmem_tree-int.h36 gboolean is_subtree; member
/dports/net/tshark/wireshark-3.6.1/wsutil/wmem/
H A Dwmem_tree.c263 if (node->is_subtree) { in free_tree_node()
324 void *data, wmem_node_color_t color, gboolean is_subtree) in create_node() argument
338 node->is_subtree = is_subtree; in create_node()
352 void*(*func)(void*), void* data, gboolean is_subtree, gboolean replace) in lookup_or_insert32_node() argument
360 CREATE_DATA(func, data), WMEM_NODE_COLOR_BLACK, is_subtree); in lookup_or_insert32_node()
384 is_subtree); in lookup_or_insert32_node()
396 is_subtree); in lookup_or_insert32_node()
731 if (node->is_subtree) { in wmem_tree_foreach_nodes()
786 node->is_subtree?"tree":"data", node->data); in wmem_tree_print_nodes()
792 if (data_printer && !node->is_subtree) { in wmem_tree_print_nodes()
[all …]
/dports/net-p2p/bazarr/bazarr-1.0.2/libs/libfuturize/fixes/
H A Dfix_next_call.py90 elif is_subtree(child, node):
101 def is_subtree(root, node): function
104 return any(is_subtree(c, node) for c in root.children)
/dports/multimedia/tautulli/Tautulli-2.8.0/lib/libfuturize/fixes/
H A Dfix_next_call.py90 elif is_subtree(child, node):
101 def is_subtree(root, node): function
104 return any(is_subtree(c, node) for c in root.children)
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/catapult/third_party/google-endpoints/libfuturize/fixes/
H A Dfix_next_call.py90 elif is_subtree(child, node):
101 def is_subtree(root, node): function
104 return any(is_subtree(c, node) for c in root.children)
/dports/devel/py-future/future-0.18.2/src/libfuturize/fixes/
H A Dfix_next_call.py90 elif is_subtree(child, node):
101 def is_subtree(root, node): function
104 return any(is_subtree(c, node) for c in root.children)
/dports/databases/py-sqlite3/Python-3.8.12/Lib/lib2to3/fixes/
H A Dfix_next.py89 elif is_subtree(child, node):
100 def is_subtree(root, node): function
103 return any(is_subtree(c, node) for c in root.children)
/dports/databases/py-gdbm/Python-3.8.12/Lib/lib2to3/fixes/
H A Dfix_next.py89 elif is_subtree(child, node):
100 def is_subtree(root, node): function
103 return any(is_subtree(c, node) for c in root.children)
/dports/lang/python310/Python-3.10.1/Lib/lib2to3/fixes/
H A Dfix_next.py89 elif is_subtree(child, node):
100 def is_subtree(root, node): function
103 return any(is_subtree(c, node) for c in root.children)
/dports/lang/python37/Python-3.7.12/Lib/lib2to3/fixes/
H A Dfix_next.py89 elif is_subtree(child, node):
100 def is_subtree(root, node): function
103 return any(is_subtree(c, node) for c in root.children)
/dports/lang/python38/Python-3.8.12/Lib/lib2to3/fixes/
H A Dfix_next.py89 elif is_subtree(child, node):
100 def is_subtree(root, node): function
103 return any(is_subtree(c, node) for c in root.children)
/dports/lang/python-tools/Python-3.8.12/Lib/lib2to3/fixes/
H A Dfix_next.py89 elif is_subtree(child, node):
100 def is_subtree(root, node): function
103 return any(is_subtree(c, node) for c in root.children)
/dports/lang/python39/Python-3.9.9/Lib/lib2to3/fixes/
H A Dfix_next.py89 elif is_subtree(child, node):
100 def is_subtree(root, node): function
103 return any(is_subtree(c, node) for c in root.children)
/dports/x11-toolkits/py-tkinter/Python-3.8.12/Lib/lib2to3/fixes/
H A Dfix_next.py89 elif is_subtree(child, node):
100 def is_subtree(root, node): function
103 return any(is_subtree(c, node) for c in root.children)
/dports/lang/python311/Python-3.11.0a3/Lib/lib2to3/fixes/
H A Dfix_next.py89 elif is_subtree(child, node):
100 def is_subtree(root, node): function
103 return any(is_subtree(c, node) for c in root.children)
/dports/lang/python-legacy/Python-2.7.18/Lib/lib2to3/fixes/
H A Dfix_next.py89 elif is_subtree(child, node):
100 def is_subtree(root, node): function
103 return any(is_subtree(c, node) for c in root.children)
/dports/lang/python27/Python-2.7.18/Lib/lib2to3/fixes/
H A Dfix_next.py89 elif is_subtree(child, node):
100 def is_subtree(root, node): function
103 return any(is_subtree(c, node) for c in root.children)
/dports/java/eclipse-pydev/eclipse-pydev-8.2.0/plugins/org.python.pydev.core_8.2.0.202102211157/pysrc/third_party/pep8/lib2to3/lib2to3/fixes/
H A Dfix_next.py89 elif is_subtree(child, node):
100 def is_subtree(root, node): function
103 return any(is_subtree(c, node) for c in root.children)
/dports/devel/pycharm-pro/pycharm-2020.2.3/plugins/python/helpers/pydev/third_party/pep8/lib2to3/lib2to3/fixes/
H A Dfix_next.py89 elif is_subtree(child, node):
100 def is_subtree(root, node): function
103 return any(is_subtree(c, node) for c in root.children)
/dports/sysutils/uefi-edk2-bhyve-csm/uefi-edk2-aa8d718/AppPkg/Applications/Python/Python-2.7.2/Lib/lib2to3/fixes/
H A Dfix_next.py89 elif is_subtree(child, node):
100 def is_subtree(root, node): function
103 return any(is_subtree(c, node) for c in root.children)

12