topological-sort-0.2.2/.cargo_vcs_info.json0000644000000001360000000000100143360ustar { "git": { "sha1": "77dfea844188db5d275959db0a128b3c0774ca80" }, "path_in_vcs": "" }topological-sort-0.2.2/.github/dependabot.yml000064400000000000000000000012400072674642500173430ustar 00000000000000# To get started with Dependabot version updates, you'll need to specify which # package ecosystems to update and where the package manifests are located. # Please see the documentation for all configuration options: # https://docs.github.com/github/administering-a-repository/configuration-options-for-dependency-updates version: 2 updates: - package-ecosystem: "github-actions" # See documentation for possible values directory: "/" # Location of package manifests schedule: interval: "daily" - package-ecosystem: "cargo" # See documentation for possible values directory: "/" # Location of package manifests schedule: interval: "daily" topological-sort-0.2.2/.github/workflows/rust-ci.yml000064400000000000000000000062410072674642500206670ustar 00000000000000name: Rust CI on: push env: CARGO_TERM_COLOR: always jobs: rustfmt_check: name: Rustfmt Check runs-on: ubuntu-latest steps: - uses: actions/checkout@v3 - uses: actions-rs/toolchain@v1 with: toolchain: stable profile: minimal components: rustfmt override: true - name: rustfmt-check run: cargo fmt --all --check clippy_check: name: Clippy Check runs-on: ubuntu-latest steps: - uses: actions/checkout@v3 - name: Check workflow permissions id: check_permissions uses: scherermichael-oss/action-has-permission@1.0.6 with: required-permission: write env: GITHUB_TOKEN: ${{ secrets.GITHUB_TOKEN }} - name: Run clippy action to produce annotations uses: actions-rs/clippy-check@v1 if: ${{ steps.check_permissions.outputs.has-permission }} with: # GitHub displays the clippy job and its results as separate entries name: Clippy (stable) Results token: ${{ secrets.GITHUB_TOKEN }} args: --all-features --all-targets -- -D warnings - uses: actions-rs/toolchain@v1 with: toolchain: stable profile: minimal components: clippy override: true - name: Run clippy manually without annotations if: ${{ !steps.check_permissions.outputs.has-permission }} run: cargo clippy --all-features --all-targets -- -D warnings security_audit: name: Security Audit runs-on: ubuntu-latest steps: - uses: actions/checkout@v3 - uses: actions-rs/audit-check@v1 with: token: ${{ secrets.GITHUB_TOKEN }} test: name: Test runs-on: ubuntu-latest strategy: matrix: rust: - stable - 1.43.1 steps: - uses: actions/checkout@v3 - uses: actions-rs/toolchain@v1 with: toolchain: ${{ matrix.rust }} profile: minimal override: true - name: cargo test run: cargo test --workspace --all-targets --all-features build: name: Build runs-on: ubuntu-latest strategy: matrix: rust: - stable - 1.43.1 steps: - uses: actions/checkout@v3 - uses: actions-rs/toolchain@v1 with: toolchain: ${{ matrix.rust }} profile: minimal override: true - name: cargo build run: cargo build --workspace --all-targets --all-features coverage: name: Code coverage runs-on: ubuntu-latest steps: - uses: actions/checkout@v3 - uses: actions-rs/toolchain@v1 with: toolchain: stable profile: minimal override: true components: llvm-tools-preview - name: Install cargo-llvm-cov uses: taiki-e/install-action@cargo-llvm-cov - name: Generate code coverage run: cargo llvm-cov --all-features --workspace --lcov --output-path lcov.info - name: Upload coverage to Codecov uses: codecov/codecov-action@v3 with: files: lcov.info fail_ci_if_error: true topological-sort-0.2.2/.gitignore000064400000000000000000000000240072674642500151420ustar 00000000000000/target /Cargo.lock topological-sort-0.2.2/Cargo.toml0000644000000021700000000000100123340ustar # THIS FILE IS AUTOMATICALLY GENERATED BY CARGO # # When uploading crates to the registry Cargo will automatically # "normalize" Cargo.toml files for maximal compatibility # with all versions of Cargo and also rewrite `path` dependencies # to registry (e.g., crates.io) dependencies. # # If you are reading this file be aware that the original Cargo.toml # will likely look very different (and much more reasonable). # See Cargo.toml.orig for the original contents. [package] edition = "2018" rust-version = "1.43.1" name = "topological-sort" version = "0.2.2" authors = ["gifnksm "] description = "Performs topological sorting." documentation = "https://docs.rs/topological-sort" readme = "README.md" license = "MIT OR Apache-2.0" repository = "https://github.com/gifnksm/topological-sort-rs" [[package.metadata.release.pre-release-replacements]] file = "README.md" search = 'topological-sort = "[0-9\.]+"' replace = "{{crate_name}} = \"{{version}}\"" [dev-dependencies.quickcheck] version = "1.0.3" [dev-dependencies.quickcheck_macros] version = "1.0.0" [badges.maintenance] status = "passively-maintained" topological-sort-0.2.2/Cargo.toml.orig000064400000000000000000000012300072674642500160410ustar 00000000000000[package] name = "topological-sort" version = "0.2.2" edition = "2018" rust-version = "1.43.1" authors = ["gifnksm "] license = "MIT OR Apache-2.0" readme = "README.md" repository = "https://github.com/gifnksm/topological-sort-rs" description = "Performs topological sorting." documentation = "https://docs.rs/topological-sort" [badges] maintenance = { status = "passively-maintained" } [dev-dependencies] quickcheck_macros = "1.0.0" quickcheck = "1.0.3" [package.metadata.release] pre-release-replacements = [ { file = "README.md", search = "topological-sort = \"[0-9\\.]+\"", replace = "{{crate_name}} = \"{{version}}\"" } ] topological-sort-0.2.2/LICENSE-APACHE000064400000000000000000000261360072674642500151120ustar 00000000000000 Apache License Version 2.0, January 2004 http://www.apache.org/licenses/ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 1. Definitions. "License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document. "Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License. "Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity. "You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License. "Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files. "Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types. "Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below). "Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof. "Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution." "Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work. 2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form. 3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed. 4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions: (a) You must give any other recipients of the Work or Derivative Works a copy of this License; and (b) You must cause any modified files to carry prominent notices stating that You changed the files; and (c) You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and (d) If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License. You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License. 5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions. 6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file. 7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License. 8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages. 9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability. END OF TERMS AND CONDITIONS APPENDIX: How to apply the Apache License to your work. To apply the Apache License to your work, attach the following boilerplate notice, with the fields enclosed by brackets "{}" replaced with your own identifying information. (Don't include the brackets!) The text should be enclosed in the appropriate comment syntax for the file format. We also recommend that a file or class name and description of purpose be included on the same "printed page" as the copyright notice for easier identification within third-party archives. Copyright {yyyy} {name of copyright owner} Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. topological-sort-0.2.2/LICENSE-MIT000064400000000000000000000020660072674642500146160ustar 00000000000000Copyright (c) 2015 The topological-sort-rs Developers Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. topological-sort-0.2.2/README.md000064400000000000000000000040250072674642500144360ustar 00000000000000# topological-sort-rs [![maintenance status: passively-maintained](https://img.shields.io/badge/maintenance-passively--maintained-yellowgreen.svg)](https://doc.rust-lang.org/cargo/reference/manifest.html#the-badges-section) [![license](https://img.shields.io/crates/l/topological-sort.svg)](#license) [![crates.io](https://img.shields.io/crates/v/topological-sort.svg)](https://crates.io/crates/topological-sort) [![docs.rs](https://img.shields.io/docsrs/topological-sort/latest)](https://docs.rs/topological-sort/latest/) [![rust 1.43.1+ badge](https://img.shields.io/badge/rust-1.43.1+-93450a.svg)](https://doc.rust-lang.org/cargo/reference/manifest.html#the-rust-version-field) [![Rust CI](https://github.com/gifnksm/topological-sort-rs/actions/workflows/rust-ci.yml/badge.svg)](https://github.com/gifnksm/topological-sort-rs/actions/workflows/rust-ci.yml) [![Codecov](https://codecov.io/gh/gifnksm/topological-sort-rs/branch/master/graph/badge.svg?token=VreVOoM3Yb)](https://codecov.io/gh/gifnksm/topological-sort-rs) Performs topological sorting. [Documentation](https://docs.rs/topological-sort) ## How to use? Add this to your `Cargo.toml`: ```toml [dependencies] topological-sort = "0.2.2" ``` ## Minimum supported Rust version (MSRV) The minimum supported Rust version is **Rust 1.43.1**. At least the last 3 versions of stable Rust are supported at any given time. While a crate is pre-release status (0.x.x) it may have its MSRV bumped in a patch release. Once a crate has reached 1.x, any MSRV bump will be accompanied with a new minor version. ## License Licensed under either of * Apache License, Version 2.0, ([LICENSE-APACHE](LICENSE-APACHE) or ) * MIT license ([LICENSE-MIT](LICENSE-MIT) or ) at your option. ### Contribution Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions. topological-sort-0.2.2/src/lib.rs000064400000000000000000000326750072674642500150760ustar 00000000000000// Copyright 2016 oauth-client-rs Developers // // Licensed under the Apache License, Version 2.0, or the MIT license , at your option. This file may not be // copied, modified, or distributed except according to those terms. //! Performs topological sorting. #![warn(bad_style)] #![warn(missing_copy_implementations)] #![warn(missing_debug_implementations)] #![warn(missing_docs)] #![warn(trivial_casts)] #![warn(trivial_numeric_casts)] #![warn(unused)] #![warn(unused_extern_crates)] #![warn(unused_import_braces)] #![warn(unused_qualifications)] #![warn(unused_results)] #![warn(clippy::if_not_else)] #![warn(clippy::invalid_upcast_comparisons)] #![warn(clippy::items_after_statements)] #![warn(clippy::mut_mut)] #![warn(clippy::never_loop)] #![warn(clippy::nonminimal_bool)] #![warn(clippy::used_underscore_binding)] use std::cmp::Ordering; use std::collections::hash_map::Entry; use std::collections::{HashMap, HashSet}; use std::fmt; use std::hash::Hash; use std::iter::FromIterator; #[derive(Clone)] struct Dependency { num_prec: usize, succ: HashSet, } impl Dependency { fn new() -> Dependency { Dependency { num_prec: 0, succ: HashSet::new(), } } } /// Performs topological sorting. #[derive(Clone)] pub struct TopologicalSort { top: HashMap>, } impl Default for TopologicalSort { fn default() -> TopologicalSort { TopologicalSort { top: HashMap::new(), } } } impl TopologicalSort { /// Creates new empty `TopologicalSort`. /// /// ```rust /// # extern crate topological_sort; /// # fn main() { /// use topological_sort::TopologicalSort; /// let mut ts = TopologicalSort::<&str>::new(); /// ts.add_dependency("hello_world.o", "hello_world"); /// ts.add_dependency("hello_world.c", "hello_world"); /// ts.add_dependency("stdio.h", "hello_world.o"); /// ts.add_dependency("glibc.so", "hello_world"); /// assert_eq!(vec!["glibc.so", "hello_world.c", "stdio.h"], /// { let mut v = ts.pop_all(); v.sort(); v }); /// assert_eq!(vec!["hello_world.o"], /// { let mut v = ts.pop_all(); v.sort(); v }); /// assert_eq!(vec!["hello_world"], /// { let mut v = ts.pop_all(); v.sort(); v }); /// assert!(ts.pop_all().is_empty()); /// # } /// ``` #[inline] pub fn new() -> TopologicalSort { Default::default() } /// Returns the number of elements in the `TopologicalSort`. #[inline] pub fn len(&self) -> usize { self.top.len() } /// Returns true if the `TopologicalSort` contains no elements. #[inline] pub fn is_empty(&self) -> bool { self.top.is_empty() } /// Registers the two elements' dependency. /// /// # Arguments /// /// * `prec` - The element appears before `succ`. `prec` is depended on by `succ`. /// * `succ` - The element appears after `prec`. `succ` depends on `prec`. pub fn add_dependency(&mut self, prec: P, succ: S) where P: Into, S: Into, { self.add_dependency_impl(prec.into(), succ.into()) } fn add_dependency_impl(&mut self, prec: T, succ: T) { match self.top.entry(prec) { Entry::Vacant(e) => { let mut dep = Dependency::new(); let _ = dep.succ.insert(succ.clone()); let _ = e.insert(dep); } Entry::Occupied(e) => { if !e.into_mut().succ.insert(succ.clone()) { // Already registered return; } } } match self.top.entry(succ) { Entry::Vacant(e) => { let mut dep = Dependency::new(); dep.num_prec += 1; let _ = e.insert(dep); } Entry::Occupied(e) => { e.into_mut().num_prec += 1; } } } /// Registers a dependency link. pub fn add_link(&mut self, link: DependencyLink) { self.add_dependency(link.prec, link.succ) } /// Inserts an element, without adding any dependencies from or to it. /// /// If the `TopologicalSort` did not have this element present, `true` is returned. /// /// If the `TopologicalSort` already had this element present, `false` is returned. pub fn insert(&mut self, elt: U) -> bool where U: Into, { match self.top.entry(elt.into()) { Entry::Vacant(e) => { let dep = Dependency::new(); let _ = e.insert(dep); true } Entry::Occupied(_) => false, } } /// Removes the item that is not depended on by any other items and returns it, or `None` if /// there is no such item. /// /// If `pop` returns `None` and `len` is not 0, there is cyclic dependencies. pub fn pop(&mut self) -> Option { self.peek().map(T::clone).map(|key| { let _ = self.remove(&key); key }) } /// Removes all items that are not depended on by any other items and returns it, or empty /// vector if there are no such items. /// /// If `pop_all` returns an empty vector and `len` is not 0, there is cyclic dependencies. pub fn pop_all(&mut self) -> Vec { let keys = self .top .iter() .filter(|&(_, v)| v.num_prec == 0) .map(|(k, _)| k.clone()) .collect::>(); for k in &keys { let _ = self.remove(k); } keys } /// Return a reference to the first item that does not depend on any other items, or `None` if /// there is no such item. pub fn peek(&self) -> Option<&T> { self.top .iter() .filter(|&(_, v)| v.num_prec == 0) .map(|(k, _)| k) .next() } /// Return a vector of references to all items that do not depend on any other items, or an /// empty vector if there are no such items. pub fn peek_all(&self) -> Vec<&T> { self.top .iter() .filter(|&(_, v)| v.num_prec == 0) .map(|(k, _)| k) .collect::>() } fn remove(&mut self, prec: &T) -> Option> { let result = self.top.remove(prec); if let Some(ref p) = result { for s in &p.succ { if let Some(y) = self.top.get_mut(s) { y.num_prec -= 1; } } } result } } impl FromIterator for TopologicalSort { fn from_iter>(iter: I) -> TopologicalSort { let mut top = TopologicalSort::new(); let mut seen = Vec::::default(); for item in iter { let _ = top.insert(item.clone()); for seen_item in seen.iter().cloned() { match seen_item.partial_cmp(&item) { Some(Ordering::Less) => { top.add_dependency(seen_item, item.clone()); } Some(Ordering::Greater) => { top.add_dependency(item.clone(), seen_item); } _ => (), } } seen.push(item); } top } } /// A link between two items in a sort. #[derive(Copy, Clone, Debug)] pub struct DependencyLink { /// The element which is depened upon by `succ`. pub prec: T, /// The element which depends on `prec`. pub succ: T, } impl From<(T, T)> for DependencyLink { fn from(tuple: (T, T)) -> Self { DependencyLink { succ: tuple.0, prec: tuple.1, } } } impl FromIterator> for TopologicalSort { fn from_iter>>(iter: I) -> TopologicalSort { let mut top = TopologicalSort::new(); for link in iter { top.add_link(link); } top } } impl Iterator for TopologicalSort { type Item = T; fn next(&mut self) -> Option { self.pop() } } impl fmt::Debug for Dependency { fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result { write!(f, "prec={}, succ={:?}", self.num_prec, self.succ) } } impl fmt::Debug for TopologicalSort { fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result { write!(f, "{:?}", self.top) } } #[cfg(test)] mod test { use super::TopologicalSort; use quickcheck_macros::quickcheck; use std::iter::FromIterator; #[test] fn from_iter() { let t = vec![4, 3, 3, 5, 7, 6, 8]; let mut ts = TopologicalSort::::from_iter(t); assert_eq!(Some(3), ts.next()); assert_eq!(Some(4), ts.next()); assert_eq!(Some(5), ts.next()); assert_eq!(Some(6), ts.next()); assert_eq!(Some(7), ts.next()); assert_eq!(Some(8), ts.next()); assert_eq!(None, ts.next()); } #[test] fn iter() { let mut ts = TopologicalSort::::new(); ts.add_dependency(1, 2); ts.add_dependency(2, 3); ts.add_dependency(3, 4); assert_eq!(Some(1), ts.next()); assert_eq!(Some(2), ts.next()); assert_eq!(Some(3), ts.next()); assert_eq!(Some(4), ts.next()); assert_eq!(None, ts.next()); } #[test] fn pop_all() { fn check(result: &[i32], ts: &mut TopologicalSort) { let l = ts.len(); let mut v = ts.pop_all(); v.sort(); assert_eq!(result, &v[..]); assert_eq!(l - result.len(), ts.len()); } let mut ts = TopologicalSort::new(); ts.add_dependency(7, 11); assert_eq!(2, ts.len()); ts.add_dependency(7, 8); assert_eq!(3, ts.len()); ts.add_dependency(5, 11); assert_eq!(4, ts.len()); ts.add_dependency(3, 8); assert_eq!(5, ts.len()); ts.add_dependency(3, 10); assert_eq!(6, ts.len()); ts.add_dependency(11, 2); assert_eq!(7, ts.len()); ts.add_dependency(11, 9); assert_eq!(8, ts.len()); ts.add_dependency(11, 10); assert_eq!(8, ts.len()); ts.add_dependency(8, 9); assert_eq!(8, ts.len()); check(&[3, 5, 7], &mut ts); check(&[8, 11], &mut ts); check(&[2, 9, 10], &mut ts); check(&[], &mut ts); } #[test] fn cyclic_deadlock() { let mut ts = TopologicalSort::new(); ts.add_dependency("stone", "sharp"); ts.add_dependency("bucket", "hole"); ts.add_dependency("hole", "straw"); ts.add_dependency("straw", "axe"); ts.add_dependency("axe", "sharp"); ts.add_dependency("sharp", "water"); ts.add_dependency("water", "bucket"); assert_eq!(ts.pop(), Some("stone")); assert!(ts.pop().is_none()); println!("{:?}", ts); } #[quickcheck] fn topo_test_quickcheck(n: usize, edges: Vec<(usize, usize)>) { use std::collections::{HashMap, HashSet}; let n = n.max(1).min(1000); let mut marked = vec![false; n]; let edges = edges .into_iter() .map(|(x, y)| (x % n, y % n)) .collect::>(); let mut deps = HashMap::new(); let mut toposort = TopologicalSort::::new(); for i in 0..n { let _ = deps.insert(i, HashSet::new()); assert!(toposort.insert(i)); } for (op, inp) in edges.iter().map(|(x, y)| (y, x)) { let inps = deps.get_mut(op).unwrap(); let _ = inps.insert(*inp); } let deps = deps; for (inp, op) in edges { toposort.add_dependency(inp, op); } while let Some(x) = toposort.pop() { for dep in deps.get(&x).unwrap().iter() { assert!(marked[*dep]); } marked[x] = true; } if toposort.is_empty() { assert!(marked.into_iter().all(|x| x)); } else { let dep_fixed = { let mut ret = (0..n) .map(|i| (i, HashSet::new())) .collect::>(); let mut new_to_add = deps; while !new_to_add.is_empty() { for (k, v) in new_to_add.drain() { let inps = ret.get_mut(&k).unwrap(); inps.extend(v.into_iter()); } for (k, vs) in ret.iter() { for k2 in vs.iter() { for v2 in ret.get(k2).unwrap().iter() { if !vs.contains(v2) { let _ = new_to_add .entry(*k) .or_insert_with(HashSet::new) .insert(*v2); } } } } } ret }; assert!(dep_fixed.into_iter().any(|(op, deps)| deps.contains(&op))); } } }