| /dports/www/firefox-esr/firefox-91.8.0/gfx/harfbuzz/src/ |
| H A D | hb-repacker.hh | 245 sorted_graph.push (next); in sort_kahn()
265 vertices_ = sorted_graph; in sort_kahn()
266 sorted_graph.fini_deep (); in sort_kahn()
301 sorted_graph.push (next); in sort_shortest_distance()
327 vertices_ = sorted_graph; in sort_shortest_distance()
328 sorted_graph.fini_deep (); in sort_shortest_distance()
675 graph_t sorted_graph (packed); in hb_resolve_overflows() local
676 sorted_graph.sort_kahn (); in hb_resolve_overflows()
679 sorted_graph.serialize (c); in hb_resolve_overflows()
749 if (sorted_graph.in_error ()) in hb_resolve_overflows()
[all …]
|
| /dports/www/lagrange/lagrange-1.7.3/lib/harfbuzz/src/ |
| H A D | hb-repacker.hh | 245 sorted_graph.push (next); in sort_kahn()
265 vertices_ = sorted_graph; in sort_kahn()
266 sorted_graph.fini_deep (); in sort_kahn()
301 sorted_graph.push (next); in sort_shortest_distance()
327 vertices_ = sorted_graph; in sort_shortest_distance()
328 sorted_graph.fini_deep (); in sort_shortest_distance()
686 graph_t sorted_graph (packed); in hb_resolve_overflows() local
687 sorted_graph.sort_kahn (); in hb_resolve_overflows()
690 sorted_graph.serialize (c); in hb_resolve_overflows()
760 if (sorted_graph.in_error ()) in hb_resolve_overflows()
[all …]
|
| /dports/mail/thunderbird/thunderbird-91.8.0/gfx/harfbuzz/src/ |
| H A D | hb-repacker.hh | 245 sorted_graph.push (next); in sort_kahn()
265 vertices_ = sorted_graph; in sort_kahn()
266 sorted_graph.fini_deep (); in sort_kahn()
301 sorted_graph.push (next); in sort_shortest_distance()
327 vertices_ = sorted_graph; in sort_shortest_distance()
328 sorted_graph.fini_deep (); in sort_shortest_distance()
675 graph_t sorted_graph (packed); in hb_resolve_overflows() local
676 sorted_graph.sort_kahn (); in hb_resolve_overflows()
679 sorted_graph.serialize (c); in hb_resolve_overflows()
749 if (sorted_graph.in_error ()) in hb_resolve_overflows()
[all …]
|
| /dports/www/firefox/firefox-99.0/gfx/harfbuzz/src/ |
| H A D | hb-repacker.hh | 281 sorted_graph[new_id] = next; in sort_kahn()
298 hb_swap (vertices_, sorted_graph); in sort_kahn()
299 sorted_graph.fini (); in sort_kahn()
335 sorted_graph[new_id] = next; in sort_shortest_distance()
358 hb_swap (vertices_, sorted_graph); in sort_shortest_distance()
359 sorted_graph.fini (); in sort_shortest_distance()
1216 graph_t sorted_graph (packed); in hb_resolve_overflows() local
1217 sorted_graph.sort_kahn (); in hb_resolve_overflows()
1237 while (!sorted_graph.in_error () in hb_resolve_overflows()
1257 if (sorted_graph.in_error ()) in hb_resolve_overflows()
[all …]
|
| /dports/print/harfbuzz/harfbuzz-3.4.0/src/ |
| H A D | hb-repacker.hh | 281 sorted_graph[new_id] = next; in sort_kahn()
298 hb_swap (vertices_, sorted_graph); in sort_kahn()
299 sorted_graph.fini (); in sort_kahn()
335 sorted_graph[new_id] = next; in sort_shortest_distance()
358 hb_swap (vertices_, sorted_graph); in sort_shortest_distance()
359 sorted_graph.fini (); in sort_shortest_distance()
1216 graph_t sorted_graph (packed); in hb_resolve_overflows() local
1217 sorted_graph.sort_kahn (); in hb_resolve_overflows()
1237 while (!sorted_graph.in_error () in hb_resolve_overflows()
1257 if (sorted_graph.in_error ()) in hb_resolve_overflows()
[all …]
|
| /dports/print/harfbuzz-icu/harfbuzz-3.4.0/src/ |
| H A D | hb-repacker.hh | 281 sorted_graph[new_id] = next; in sort_kahn()
298 hb_swap (vertices_, sorted_graph); in sort_kahn()
299 sorted_graph.fini (); in sort_kahn()
335 sorted_graph[new_id] = next; in sort_shortest_distance()
358 hb_swap (vertices_, sorted_graph); in sort_shortest_distance()
359 sorted_graph.fini (); in sort_shortest_distance()
1216 graph_t sorted_graph (packed); in hb_resolve_overflows() local
1217 sorted_graph.sort_kahn (); in hb_resolve_overflows()
1237 while (!sorted_graph.in_error () in hb_resolve_overflows()
1257 if (sorted_graph.in_error ()) in hb_resolve_overflows()
[all …]
|
| /dports/print/harfbuzz-hb-view/harfbuzz-3.4.0/src/ |
| H A D | hb-repacker.hh | 281 sorted_graph[new_id] = next; in sort_kahn()
298 hb_swap (vertices_, sorted_graph); in sort_kahn()
299 sorted_graph.fini (); in sort_kahn()
335 sorted_graph[new_id] = next; in sort_shortest_distance()
358 hb_swap (vertices_, sorted_graph); in sort_shortest_distance()
359 sorted_graph.fini (); in sort_shortest_distance()
1216 graph_t sorted_graph (packed); in hb_resolve_overflows() local
1217 sorted_graph.sort_kahn (); in hb_resolve_overflows()
1237 while (!sorted_graph.in_error () in hb_resolve_overflows()
1257 if (sorted_graph.in_error ()) in hb_resolve_overflows()
[all …]
|
| /dports/science/qiskit-aer/qiskit-aer-0.5.2/qiskit/providers/aer/pulse/ |
| H A D | duffing_model_generators.py | 142 sorted_coupling_edges = coupling_graph.sorted_graph
438 self.sorted_graph = graph_list
442 for edge in self.sorted_graph:
463 return self.sorted_graph.index(tuple(edge_list))
|
| /dports/science/py-pymatgen/pymatgen-2022.0.15/pymatgen/analysis/ |
| H A D | dimensionality.py | 161 sorted_graph = nx.convert_node_labels_to_integers(graph, ordering="sorted")
162 …ent_graph = StructureGraph(component_structure, graph_data=json_graph.adjacency_data(sorted_graph))
292 sorted_graph = nx.convert_node_labels_to_integers(graph, ordering="sorted")
294 mol_graph = MoleculeGraph.with_edges(mol, nx.Graph(sorted_graph).edges())
|
| /dports/devel/brz/breezy-3.2.0/breezy/plugins/stats/ |
| H A D | cmds.py | 301 sorted_graph = tsort.merge_sort(graph.iter_ancestry([last_rev]),
303 for num, node_name, depth, isend in reversed(sorted_graph):
|
| /dports/math/vtk9/VTK-9.1.0/Utilities/Maintenance/ |
| H A D | vtk_generate_pyi.py | 141 def sorted_graph(graph): function
152 return sorted_graph(build_graph(d))
|
| /dports/science/qiskit-aer/qiskit-aer-0.5.2/test/terra/openpulse/ |
| H A D | test_duffing_model_generators.py | 501 self.assertEqual(coupling_graph.sorted_graph, [(0,1), (1,2), (2,3)])
|