/dports/textproc/mdbook-linkcheck/mdbook-linkcheck-0.7.6/cargo-crates/topological-sort-0.1.0/ |
H A D | README.md | 1 # topological-sort-rs 3 …uild Status](https://travis-ci.org/gifnksm/topological-sort-rs.svg)](https://travis-ci.org/gifnksm… 4 …alls.io/repos/gifnksm/topological-sort-rs/badge.svg?branch=master&service=github)](https://coveral… 5 [![crates.io](http://meritbadge.herokuapp.com/topological-sort)](https://crates.io/crates/topologic… 7 Performs topological sorting. 9 [Documentation](https://docs.rs/topological-sort/~0.0) 17 topological-sort = "0.0"
|
H A D | Cargo.toml.orig-cargo | 3 name = "topological-sort" 8 repository = "https://github.com/gifnksm/topological-sort-rs" 9 description = "Performs topological sorting." 10 documentation = "https://docs.rs/topological-sort/~0.0"
|
H A D | Cargo.toml | 14 name = "topological-sort" 17 description = "Performs topological sorting." 18 documentation = "https://docs.rs/topological-sort/~0.0" 21 repository = "https://github.com/gifnksm/topological-sort-rs"
|
/dports/textproc/mdbook/mdBook-0.4.13/cargo-crates/topological-sort-0.1.0/ |
H A D | README.md | 1 # topological-sort-rs 3 …uild Status](https://travis-ci.org/gifnksm/topological-sort-rs.svg)](https://travis-ci.org/gifnksm… 4 …alls.io/repos/gifnksm/topological-sort-rs/badge.svg?branch=master&service=github)](https://coveral… 5 [![crates.io](http://meritbadge.herokuapp.com/topological-sort)](https://crates.io/crates/topologic… 7 Performs topological sorting. 9 [Documentation](https://docs.rs/topological-sort/~0.0) 17 topological-sort = "0.0"
|
H A D | Cargo.toml.orig-cargo | 3 name = "topological-sort" 8 repository = "https://github.com/gifnksm/topological-sort-rs" 9 description = "Performs topological sorting." 10 documentation = "https://docs.rs/topological-sort/~0.0"
|
H A D | Cargo.toml | 14 name = "topological-sort" 17 description = "Performs topological sorting." 18 documentation = "https://docs.rs/topological-sort/~0.0" 21 repository = "https://github.com/gifnksm/topological-sort-rs"
|
/dports/x11-wm/awesome/awesome-4.3/spec/gears/ |
H A D | sort_topological_spec.lua | 5 local ts = tsort.topological() 21 local ts = tsort.topological() 36 local ts = tsort.topological() 51 local ts = tsort.topological() 79 local ts = tsort.topological() 117 local ts = tsort.topological() 137 local ts = tsort.topological() 146 local ts = tsort.topological() 155 local ts = tsort.topological() 165 local ts = tsort.topological()
|
/dports/databases/py-sqlalchemy14/SQLAlchemy-1.4.27/test/base/ |
H A D | test_dependency.py | 6 from sqlalchemy.util import topological 15 result = list(topological.sort(tuples, allitems)) 19 result = list(topological.sort(tuples, allitems)) 122 list(topological.sort(tuples, allitems)) 159 list(topological.sort(tuples, allitems)) 198 topological.sort(tuples, allitems), 227 topological.find_cycles(tuples, self._nodes_from_tuples(tuples)), 259 topological.find_cycles(tuples, allnodes), 293 topological.find_cycles(tuples, allnodes), 316 eq_(topological.find_cycles(tuples, allnodes), allnodes) [all …]
|
/dports/databases/py-sqlalchemy12/SQLAlchemy-1.2.19/test/base/ |
H A D | test_dependency.py | 6 from sqlalchemy.util import topological 15 result = list(topological.sort(tuples, allitems)) 20 topological.sort(tuples, allitems, deterministic_order=True) 124 list(topological.sort(tuples, allitems)) 161 list(topological.sort(tuples, allitems)) 200 topological.sort(tuples, allitems), 229 topological.find_cycles(tuples, self._nodes_from_tuples(tuples)), 261 topological.find_cycles(tuples, allnodes), 295 topological.find_cycles(tuples, allnodes), 318 eq_(topological.find_cycles(tuples, allnodes), allnodes) [all …]
|
/dports/databases/py-sqlalchemy11/SQLAlchemy-1.1.18/test/base/ |
H A D | test_dependency.py | 1 from sqlalchemy.util import topological 15 result = list(topological.sort(tuples, allitems)) 19 result = list(topological.sort(tuples, 115 list(topological.sort(tuples, allitems)) 138 list(topological.sort(tuples, allitems)) 161 topological.sort(tuples, allitems)) 183 eq_(topological.find_cycles(tuples, 221 eq_(topological.find_cycles(tuples, allnodes), set([ 258 topological.find_cycles(tuples, allnodes), 288 eq_(topological.find_cycles(tuples, allnodes), allnodes) [all …]
|
/dports/databases/py-sqlalchemy13/SQLAlchemy-1.3.24/test/base/ |
H A D | test_dependency.py | 6 from sqlalchemy.util import topological 15 result = list(topological.sort(tuples, allitems)) 20 topological.sort(tuples, allitems, deterministic_order=True) 124 list(topological.sort(tuples, allitems)) 161 list(topological.sort(tuples, allitems)) 200 topological.sort(tuples, allitems), 229 topological.find_cycles(tuples, self._nodes_from_tuples(tuples)), 261 topological.find_cycles(tuples, allnodes), 295 topological.find_cycles(tuples, allnodes), 318 eq_(topological.find_cycles(tuples, allnodes), allnodes) [all …]
|
/dports/databases/py-sqlalchemy10/SQLAlchemy-1.0.14/test/base/ |
H A D | test_dependency.py | 1 from sqlalchemy.util import topological 14 result = list(topological.sort(tuples, allitems)) 18 result = list(topological.sort(tuples, allitems, deterministic_order=True)) 112 list(topological.sort(tuples, allitems)) 135 list(topological.sort(tuples, allitems)) 158 topological.sort(tuples, allitems)) 180 eq_(topological.find_cycles(tuples, 219 eq_(topological.find_cycles(tuples, allnodes), set([ 256 topological.find_cycles(tuples, allnodes), 286 eq_(topological.find_cycles(tuples, allnodes), allnodes) [all …]
|
/dports/devel/R-cran-git2r/git2r/tests/ |
H A D | commits_path.R | 237 commits(repo, topological = TRUE, time = FALSE, path = "test-time.txt"), 241 commits(repo, topological = TRUE, time = FALSE, path = "test-time.txt"), 242 commits(repo, topological = TRUE, time = FALSE)[1:6] 246 commits(repo, topological = FALSE, time = TRUE, path = "test-time.txt"), 251 commits(repo, topological = FALSE, time = TRUE)[1:6] 255 commits(repo, topological = TRUE, time = TRUE, path = "test-time.txt"), 259 commits(repo, topological = TRUE, time = TRUE, path = "test-time.txt"), 260 commits(repo, topological = TRUE, time = TRUE)[1:6] 264 commits(repo, topological = TRUE, time = FALSE, reverse = TRUE, 269 commits(repo, topological = FALSE, time = TRUE, reverse = TRUE, [all …]
|
/dports/databases/grass7/grass-7.8.6/lib/vector/ |
H A D | vectorlib_pg.dox | 46 without topology. Topological (pseudo-topological for simple features) 71 \par Write new feature or topological element 75 - V2_write_line_pg() - write new topological element in PostGIS Topology schema 77 \par Delete existing feature or topological element 81 - V2_delete_line_pg() - delete topological element from PostGIS Topology schema 83 \par Modify existing feature or topological element 87 - V2_rewrite_line_pg() - modify topological element from PostGIS Topology schema
|
/dports/math/R-cran-igraph/igraph/man/ |
H A D | topo_sort.Rd | 5 \alias{topological.sort} 25 A topological sorting of a directed acyclic graph is a linear ordering of 29 Every DAG has at least one topological sort, and may have many. This 30 function returns a possible topological sort among them. If the graph is not 31 acyclic (it has at least one cycle), a partial topological sort is returned
|
/dports/devel/R-cran-git2r/git2r/src/ |
H A D | git2r_revwalk.h | 25 SEXP git2r_revwalk_contributions(SEXP repo, SEXP topological, SEXP time, SEXP reverse); 26 SEXP git2r_revwalk_list(SEXP repo, SEXP sha, SEXP topological, SEXP time, SEXP reverse, SEXP max_n); 27 SEXP git2r_revwalk_list2(SEXP repo, SEXP sha, SEXP topological, SEXP time, SEXP reverse, SEXP max_n…
|
H A D | git2r_revwalk.c | 102 SEXP topological, in git2r_revwalk_list() argument 117 if (git2r_arg_check_logical(topological)) in git2r_revwalk_list() 137 if (LOGICAL(topological)[0]) in git2r_revwalk_list() local 224 SEXP topological, in git2r_revwalk_list2() argument 242 if (git2r_arg_check_logical(topological)) in git2r_revwalk_list2() 273 if (LOGICAL(topological)[0]) in git2r_revwalk_list2() local 400 SEXP topological, in git2r_revwalk_contributions() argument 415 if (git2r_arg_check_logical(topological)) in git2r_revwalk_contributions() 429 if (LOGICAL(topological)[0]) in git2r_revwalk_contributions() local
|
/dports/net-im/py-matrix-synapse/synapse-1.50.2/synapse/ |
H A D | types.py | 469 topological = attr.ib( variable in RoomStreamToken 488 if self.instance_map and self.topological: 497 return cls(topological=None, stream=int(string[1:])) 515 topological=None, 527 return cls(topological=None, stream=int(string[1:])) 537 if self.topological or other.topological: 557 if self.topological is None: 562 return self.topological, self.stream 570 assert self.topological is None 587 if self.topological is not None: [all …]
|
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/src/ |
H A D | UnstructuredElemSeq.cpp | 63 bool topological ) const in get_connectivity() 66 int len = topological ? CN::VerticesPerEntity(type()) : nodes_per_element(); in get_connectivity() 77 bool topological, in get_connectivity() argument 81 len = topological ? CN::VerticesPerEntity(type()) : nodes_per_element(); in get_connectivity()
|
/dports/science/axom/axom-0.6.1/src/axom/mint/docs/sphinx/sections/ |
H A D | mesh_representation.rst | 41 defined by the collection of topological entities, e.g. the :ref:`Cells`, 43 *adjacency* information that encodes the topological connections between them, 59 In Mint, the three fundamental topological entities comprising a mesh are 89 Consequently, the constituent faces of a 3D cell are 2D topological entities, 92 are 0D topological entities, i.e. :ref:`Nodes`. 106 of a 3D cell are 2D topological entities, such as *triangles* or *quads*, 107 depending on the cell type. The faces of a 2D cell are 1D topological 214 The topological connections or *adjecencies* between the :ref:`Cells`, 235 * The downward topological connections encode the connections from 247 defines the :ref:`Connectivity` information. Consequently, the topological [all …]
|
/dports/lang/racket/racket-8.3/doc/profile/ |
H A D | blueboxes.rktd | 16 renderer : (-> profile? (or/c 'topological 'self 'total) any/c) 20 (or/c 'topological 'self 'total) 24 order : (or/c 'topological 'self 'total) = 'topological 83 order : (or/c 'topological 'self 'total) = 'topological 93 order : (or/c 'topological 'self 'total) = 'topological
|
/dports/x11-wm/awesome/awesome-4.3/lib/gears/sort/ |
H A D | topological.lua | 67 local new = tsort.topological() 109 function tsort.topological() function 116 return tsort.topological(...)
|
/dports/graphics/mirtk/MIRTK-2.0.0-122-g38210fa/CMake/Basis/ |
H A D | TopologicalSort.cmake | 38 # @brief CMake implementation of topological sorting algorithm. 40 # Perform a reverse topological sort on the given LIST. 45 # sorted in reverse topological order. Each element in the list has a 47 # it depends on). In the resulting reverse topological ordering 52 # on build targets, for example, the reverse topological ordering is 66 # variables, the resulting reverse topological ordering will be b, a, c. 77 # Loop over all of the vertices, starting the topological sort from
|
/dports/graphics/qgis-ltr/qgis-3.16.16/python/core/auto_generated/ |
H A D | qgsvectorlayereditutils.sip.in | 169 :param topologicalEditing: ``True`` if topological editing is enabled 189 :param topologicalEditing: ``True`` if topological editing is enabled 206 :param topologicalEditing: ``True`` if topological editing is enabled 219 :param topologicalEditing: ``True`` if topological editing is enabled 229 \param[out] topologyTestPoints topological points to be tested against other layers 231 :param topologicalEditing: ``True`` if topological editing is enabled 240 Adds topological points for every vertex of the geometry. 259 no additional vertex is inserted. This method is useful for topological 273 no additional vertex is inserted. This method is useful for topological 289 no additional vertex is inserted. This method is useful for topological
|
/dports/x11-wm/awesome/awesome-4.3/tests/examples/text/gears/sort/ |
H A D | topological.lua | 2 local gears = {sort={topological = require("gears.sort.topological")}} --DOC_HIDE 4 local tsort = gears.sort.topological()
|