From 5c2b3e2a07d4a91c7ca289ef76dc56119abb0aa1 Mon Sep 17 00:00:00 2001 From: ngtkana Date: Tue, 10 Dec 2024 11:02:23 +0000 Subject: [PATCH] deploy: a5bed60613e3b5b21b20b3e064752b3c69ea1f4d --- crates.js | 2 +- dependencies.js | 2 +- dijkstra_radix_heap/all.html | 35 --- dijkstra_radix_heap/fn.calc_dist.html | 36 --- dijkstra_radix_heap/fn.calc_dist_restore.html | 39 --- dijkstra_radix_heap/index.html | 36 --- dijkstra_radix_heap/sidebar-items.js | 1 - help.html | 4 +- implementors/core/clone/trait.Clone.js | 1 - implementors/core/cmp/trait.Eq.js | 1 - implementors/core/cmp/trait.PartialEq.js | 1 - implementors/core/default/trait.Default.js | 1 - implementors/core/fmt/trait.Debug.js | 1 - implementors/core/marker/trait.Freeze.js | 1 - implementors/core/marker/trait.Send.js | 1 - .../core/marker/trait.StructuralEq.js | 1 - .../core/marker/trait.StructuralPartialEq.js | 1 - implementors/core/marker/trait.Sync.js | 1 - implementors/core/marker/trait.Unpin.js | 1 - .../panic/unwind_safe/trait.RefUnwindSafe.js | 1 - .../panic/unwind_safe/trait.UnwindSafe.js | 1 - radix_heap/all.html | 35 --- radix_heap/index.html | 36 --- radix_heap/sidebar-items.js | 1 - radix_heap/struct.RadixHeap.html | 53 ---- search-index.js | 2 - settings.html | 4 +- source-files.js | 2 - src/dijkstra_radix_heap/lib.rs.html | 263 ------------------ src/radix_heap/lib.rs.html | 245 ---------------- 30 files changed, 6 insertions(+), 803 deletions(-) delete mode 100644 dijkstra_radix_heap/all.html delete mode 100644 dijkstra_radix_heap/fn.calc_dist.html delete mode 100644 dijkstra_radix_heap/fn.calc_dist_restore.html delete mode 100644 dijkstra_radix_heap/index.html delete mode 100644 dijkstra_radix_heap/sidebar-items.js delete mode 100644 radix_heap/all.html delete mode 100644 radix_heap/index.html delete mode 100644 radix_heap/sidebar-items.js delete mode 100644 radix_heap/struct.RadixHeap.html delete mode 100644 src/dijkstra_radix_heap/lib.rs.html delete mode 100644 src/radix_heap/lib.rs.html diff --git a/crates.js b/crates.js index 03b06c55..83a463f6 100644 --- a/crates.js +++ b/crates.js @@ -1 +1 @@ -window.ALL_CRATES = ["accum","avl_tree","binary","bitvec","bsgs","cht","cipolla","convex_hull","dijkstra_radix_heap","dinic","dual_segtree","elim","erato","euclid","fp","fps","gco","graph","gss","heap_slope_trick","heap_tricks","hld","hopkarp","hungarian","interval_heap","io","lagrange","lazy_segbeats","lazy_segtree","lg","lin_ineq","link_cut_tree","low_link","manacher","mincost_flow","monotone_minima","naive_poly","newton","next_permutation","numeric_search","partially_persistent_union_find","radix_heap","randtools","rational","rb","rbtree","riff","segbeats","segbeats_task3","segtree","skew_heap","snippetter","sparse_table","splay_tree","suffix_array","swag","tree_fold","trial","trie","uf_checklist","union_find","veb","vec_lines","wavelet_matrix","z_algo","zeta"]; \ No newline at end of file +window.ALL_CRATES = ["accum","avl_tree","binary","bitvec","bsgs","cht","cipolla","convex_hull","dinic","dual_segtree","elim","erato","euclid","fp","fps","gco","graph","gss","heap_slope_trick","heap_tricks","hld","hopkarp","hungarian","interval_heap","io","lagrange","lazy_segbeats","lazy_segtree","lg","lin_ineq","link_cut_tree","low_link","manacher","mincost_flow","monotone_minima","naive_poly","newton","next_permutation","numeric_search","partially_persistent_union_find","randtools","rational","rb","rbtree","riff","segbeats","segbeats_task3","segtree","skew_heap","snippetter","sparse_table","splay_tree","suffix_array","swag","tree_fold","trial","trie","uf_checklist","union_find","veb","vec_lines","wavelet_matrix","z_algo","zeta"]; \ No newline at end of file diff --git a/dependencies.js b/dependencies.js index db765334..8fa71b98 100644 --- a/dependencies.js +++ b/dependencies.js @@ -1 +1 @@ -dependencies = {"rbtree":{"dependencies":[],"tags":[]},"trial":{"dependencies":[],"tags":[]},"lg":{"dependencies":[],"tags":[]},"mincost_flow":{"dependencies":[],"tags":[]},"dinic":{"dependencies":[],"tags":[]},"z_algo":{"dependencies":[],"tags":[]},"lazy_segtree":{"dependencies":[],"tags":[]},"segbeats_task3":{"dependencies":[],"tags":[]},"sparse_table":{"dependencies":[],"tags":[]},"dual_segtree":{"dependencies":[],"tags":[]},"lin_ineq":{"dependencies":[],"tags":[]},"accum":{"dependencies":[],"tags":[]},"veb":{"dependencies":[],"tags":[]},"erato":{"dependencies":[],"tags":[]},"dijkstra_radix_heap":{"dependencies":["radix_heap"],"tags":[]},"swag":{"dependencies":[],"tags":[]},"cipolla":{"dependencies":[],"tags":[]},"heap_slope_trick":{"dependencies":[],"tags":[]},"rational":{"dependencies":[],"tags":[]},"monotone_minima":{"dependencies":[],"tags":[]},"tree_fold":{"dependencies":[],"tags":[]},"hungarian":{"dependencies":[],"tags":[]},"euclid":{"dependencies":[],"tags":[]},"wavelet_matrix":{"dependencies":[],"tags":[]},"next_permutation":{"dependencies":[],"tags":[]},"lagrange":{"dependencies":["fp"],"tags":[]},"elim":{"dependencies":[],"tags":[]},"segbeats":{"dependencies":[],"tags":[]},"uf_checklist":{"dependencies":["union_find"],"tags":[]},"vec_lines":{"dependencies":[],"tags":[]},"manacher":{"dependencies":[],"tags":[]},"interval_heap":{"dependencies":[],"tags":[]},"naive_poly":{"dependencies":[],"tags":[]},"radix_heap":{"dependencies":[],"tags":[]},"riff":{"dependencies":[],"tags":[]},"hld":{"dependencies":[],"tags":[]},"bitvec":{"dependencies":[],"tags":[]},"splay_tree":{"dependencies":[],"tags":[]},"graph":{"dependencies":[],"tags":[]},"fp":{"dependencies":[],"tags":[]},"newton":{"dependencies":[],"tags":[]},"io":{"dependencies":[],"tags":[]},"skew-heap":{"dependencies":[],"tags":[]},"heap_tricks":{"dependencies":[],"tags":[]},"cht":{"dependencies":[],"tags":[]},"link_cut_tree":{"dependencies":[],"tags":[]},"trie":{"dependencies":[],"tags":[]},"fps":{"dependencies":["fp"],"tags":[]},"avl_tree":{"dependencies":[],"tags":[]},"convex_hull":{"dependencies":[],"tags":[]},"randtools":{"dependencies":[],"tags":[]},"gss":{"dependencies":[],"tags":[]},"partially_persistent_union_find":{"dependencies":[],"tags":[]},"rb":{"dependencies":[],"tags":[]},"numeric_search":{"dependencies":[],"tags":[]},"low_link":{"dependencies":[],"tags":[]},"zeta":{"dependencies":[],"tags":[]},"binary":{"dependencies":[],"tags":[]},"bsgs":{"dependencies":[],"tags":[]},"suffix_array":{"dependencies":[],"tags":[]},"segtree":{"dependencies":[],"tags":[]},"hopkarp":{"dependencies":[],"tags":[]},"gco":{"dependencies":["dinic"],"tags":[]},"union_find":{"dependencies":[],"tags":[]},"lazy_segbeats":{"dependencies":[],"tags":[]}} \ No newline at end of file +dependencies = {"manacher":{"dependencies":[],"tags":[]},"gss":{"dependencies":[],"tags":[]},"cht":{"dependencies":[],"tags":[]},"naive_poly":{"dependencies":[],"tags":[]},"riff":{"dependencies":[],"tags":[]},"lagrange":{"dependencies":["fp"],"tags":[]},"graph":{"dependencies":[],"tags":[]},"convex_hull":{"dependencies":[],"tags":[]},"interval_heap":{"dependencies":[],"tags":[]},"tree_fold":{"dependencies":[],"tags":[]},"trial":{"dependencies":[],"tags":[]},"bsgs":{"dependencies":[],"tags":[]},"lazy_segtree":{"dependencies":[],"tags":[]},"wavelet_matrix":{"dependencies":[],"tags":[]},"cipolla":{"dependencies":[],"tags":[]},"hungarian":{"dependencies":[],"tags":[]},"veb":{"dependencies":[],"tags":[]},"newton":{"dependencies":[],"tags":[]},"splay_tree":{"dependencies":[],"tags":[]},"gco":{"dependencies":["dinic"],"tags":[]},"z_algo":{"dependencies":[],"tags":[]},"euclid":{"dependencies":[],"tags":[]},"swag":{"dependencies":[],"tags":[]},"low_link":{"dependencies":[],"tags":[]},"vec_lines":{"dependencies":[],"tags":[]},"mincost_flow":{"dependencies":[],"tags":[]},"hopkarp":{"dependencies":[],"tags":[]},"rbtree":{"dependencies":[],"tags":[]},"link_cut_tree":{"dependencies":[],"tags":[]},"dual_segtree":{"dependencies":[],"tags":[]},"lin_ineq":{"dependencies":[],"tags":[]},"monotone_minima":{"dependencies":[],"tags":[]},"rb":{"dependencies":[],"tags":[]},"io":{"dependencies":[],"tags":[]},"rational":{"dependencies":[],"tags":[]},"lazy_segbeats":{"dependencies":[],"tags":[]},"segtree":{"dependencies":[],"tags":[]},"zeta":{"dependencies":[],"tags":[]},"partially_persistent_union_find":{"dependencies":[],"tags":[]},"numeric_search":{"dependencies":[],"tags":[]},"heap_tricks":{"dependencies":[],"tags":[]},"bitvec":{"dependencies":[],"tags":[]},"fps":{"dependencies":["fp"],"tags":[]},"erato":{"dependencies":[],"tags":[]},"suffix_array":{"dependencies":[],"tags":[]},"avl_tree":{"dependencies":[],"tags":[]},"union_find":{"dependencies":[],"tags":[]},"dinic":{"dependencies":[],"tags":[]},"segbeats":{"dependencies":[],"tags":[]},"hld":{"dependencies":[],"tags":[]},"uf_checklist":{"dependencies":["union_find"],"tags":[]},"fp":{"dependencies":[],"tags":[]},"binary":{"dependencies":[],"tags":[]},"elim":{"dependencies":[],"tags":[]},"next_permutation":{"dependencies":[],"tags":[]},"skew-heap":{"dependencies":[],"tags":[]},"lg":{"dependencies":[],"tags":[]},"randtools":{"dependencies":[],"tags":[]},"accum":{"dependencies":[],"tags":[]},"heap_slope_trick":{"dependencies":[],"tags":[]},"trie":{"dependencies":[],"tags":[]},"segbeats_task3":{"dependencies":[],"tags":[]},"sparse_table":{"dependencies":[],"tags":[]}} \ No newline at end of file diff --git a/dijkstra_radix_heap/all.html b/dijkstra_radix_heap/all.html deleted file mode 100644 index 17d59279..00000000 --- a/dijkstra_radix_heap/all.html +++ /dev/null @@ -1,35 +0,0 @@ -List of all items in this crate
- - - - - -

List of all items

Functions

\ No newline at end of file diff --git a/dijkstra_radix_heap/fn.calc_dist.html b/dijkstra_radix_heap/fn.calc_dist.html deleted file mode 100644 index 4e5d4c26..00000000 --- a/dijkstra_radix_heap/fn.calc_dist.html +++ /dev/null @@ -1,36 +0,0 @@ -calc_dist in dijkstra_radix_heap - Rust
- - - - - -

Function dijkstra_radix_heap::calc_dist

source · 
pub fn calc_dist(s: usize, g: &[Vec<(usize, u32)>]) -> Vec<u32>
👎Deprecated
Expand description

一点からの距離配列を作ります。

-
\ No newline at end of file diff --git a/dijkstra_radix_heap/fn.calc_dist_restore.html b/dijkstra_radix_heap/fn.calc_dist_restore.html deleted file mode 100644 index fc00df6a..00000000 --- a/dijkstra_radix_heap/fn.calc_dist_restore.html +++ /dev/null @@ -1,39 +0,0 @@ -calc_dist_restore in dijkstra_radix_heap - Rust
- - - - - -

Function dijkstra_radix_heap::calc_dist_restore

source · 
pub fn calc_dist_restore(
-    s: usize,
-    g: &[Vec<(usize, u32)>]
-) -> (Vec<u32>, Vec<usize>)
Expand description

一点からの距離配列を作ります。

-
\ No newline at end of file diff --git a/dijkstra_radix_heap/index.html b/dijkstra_radix_heap/index.html deleted file mode 100644 index 9060b772..00000000 --- a/dijkstra_radix_heap/index.html +++ /dev/null @@ -1,36 +0,0 @@ -dijkstra_radix_heap - Rust
- - - - - -

Crate dijkstra_radix_heap

source ·
Expand description

CAUTION: RadixHeap fails in testst!

-

Functions

\ No newline at end of file diff --git a/dijkstra_radix_heap/sidebar-items.js b/dijkstra_radix_heap/sidebar-items.js deleted file mode 100644 index 15e161db..00000000 --- a/dijkstra_radix_heap/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -window.SIDEBAR_ITEMS = {"fn":["calc_dist","calc_dist_restore"]}; \ No newline at end of file diff --git a/help.html b/help.html index 9126c375..5d8bdcdf 100644 --- a/help.html +++ b/help.html @@ -1,4 +1,4 @@ -Rustdoc help
Rustdoc help
-

Rustdoc help

Back
\ No newline at end of file +

Rustdoc help

Back
\ No newline at end of file diff --git a/implementors/core/clone/trait.Clone.js b/implementors/core/clone/trait.Clone.js index 89fe2812..c0565e3a 100644 --- a/implementors/core/clone/trait.Clone.js +++ b/implementors/core/clone/trait.Clone.js @@ -20,7 +20,6 @@ "low_link":[["impl Clone for LowLink"]], "mincost_flow":[["impl Clone for MinCostFlow"],["impl Clone for Edge"]], "partially_persistent_union_find":[["impl Clone for PartiallyPersistentUnionFind"]], -"radix_heap":[["impl<T: Clone> Clone for RadixHeap<T>"]], "rational":[["impl<T: Clone + Signed> Clone for Rational<T>"]], "rbtree":[["impl<T: Clone, O: Op<Value = T>> Clone for RbTree<T, O>where\n O::Summary: Clone,"]], "segbeats":[["impl<T: Clone> Clone for Segbeats<T>"]], diff --git a/implementors/core/cmp/trait.Eq.js b/implementors/core/cmp/trait.Eq.js index e391aeb3..9b87a280 100644 --- a/implementors/core/cmp/trait.Eq.js +++ b/implementors/core/cmp/trait.Eq.js @@ -14,7 +14,6 @@ "lazy_segbeats":[["impl<T: Eq> Eq for Segbeats<T>"]], "low_link":[["impl Eq for LowLink"]], "mincost_flow":[["impl Eq for Edge"]], -"radix_heap":[["impl<T: Eq> Eq for RadixHeap<T>"]], "rational":[["impl<T: Signed> Eq for Rational<T>"]], "segbeats":[["impl<T: Eq> Eq for Segbeats<T>"]], "segbeats_task3":[["impl<T: Eq> Eq for Segbeats<T>"]], diff --git a/implementors/core/cmp/trait.PartialEq.js b/implementors/core/cmp/trait.PartialEq.js index cf577c6a..fc8d16dd 100644 --- a/implementors/core/cmp/trait.PartialEq.js +++ b/implementors/core/cmp/trait.PartialEq.js @@ -16,7 +16,6 @@ "lazy_segbeats":[["impl<T: PartialEq> PartialEq<Segbeats<T>> for Segbeats<T>"]], "low_link":[["impl PartialEq<LowLink> for LowLink"]], "mincost_flow":[["impl PartialEq<Edge> for Edge"],["impl PartialEq<MinCostFlow> for MinCostFlow"]], -"radix_heap":[["impl<T: PartialEq> PartialEq<RadixHeap<T>> for RadixHeap<T>"]], "rational":[["impl<T: Signed> PartialEq<Rational<T>> for Rational<T>"]], "rbtree":[["impl<T: PartialEq, O: Op<Value = T>> PartialEq<RbTree<T, O>> for RbTree<T, O>where\n O::Summary: PartialEq,"]], "segbeats":[["impl<T: PartialEq> PartialEq<Segbeats<T>> for Segbeats<T>"]], diff --git a/implementors/core/default/trait.Default.js b/implementors/core/default/trait.Default.js index 948d4933..e672953d 100644 --- a/implementors/core/default/trait.Default.js +++ b/implementors/core/default/trait.Default.js @@ -13,7 +13,6 @@ "interval_heap":[["impl<T: Ord> Default for IntervalHeap<T>"]], "low_link":[["impl Default for LowLink"]], "mincost_flow":[["impl Default for Edge"],["impl Default for MinCostFlow"]], -"radix_heap":[["impl<T: Debug> Default for RadixHeap<T>"]], "rational":[["impl<T: Default + Signed> Default for Rational<T>"]], "rb":[["impl<K: Ord, V> Default for Multimap<K, V>"],["impl<K: Ord> Default for Multiset<K>"],["impl<O: Op> Default for Seg<O>"],["impl<K: Ord, O: MultimapOp> Default for MultimapSeg<K, O>"]], "rbtree":[["impl<T, O: Op<Value = T>> Default for RbTree<T, O>"]], diff --git a/implementors/core/fmt/trait.Debug.js b/implementors/core/fmt/trait.Debug.js index 0481235c..db32d764 100644 --- a/implementors/core/fmt/trait.Debug.js +++ b/implementors/core/fmt/trait.Debug.js @@ -21,7 +21,6 @@ "low_link":[["impl Debug for LowLink"]], "mincost_flow":[["impl Debug for Edge"],["impl Debug for MinCostFlow"]], "partially_persistent_union_find":[["impl Debug for PartiallyPersistentUnionFind"]], -"radix_heap":[["impl<T: Debug> Debug for RadixHeap<T>"]], "randtools":[["impl Debug for SimpleGraph"],["impl Debug for SimpleGraphEdges"],["impl Debug for SimpleDigraph"],["impl Debug for Tree"],["impl Debug for SimpleDigraphEdges"],["impl Debug for LogUniform"],["impl Debug for DistinctTwo"],["impl Debug for SubRange"],["impl Debug for NonEmptySubRange"]], "rational":[["impl<T: Signed> Debug for Rational<T>"]], "rb":[["impl<K: Ord + Debug, V: Debug> Debug for Multimap<K, V>"],["impl<K: Ord + Debug> Debug for Multiset<K>"],["impl<O: Op> Debug for Seg<O>where\n O::Value: Debug,"]], diff --git a/implementors/core/marker/trait.Freeze.js b/implementors/core/marker/trait.Freeze.js index b63161ec..b308d910 100644 --- a/implementors/core/marker/trait.Freeze.js +++ b/implementors/core/marker/trait.Freeze.js @@ -23,7 +23,6 @@ "low_link":[["impl Freeze for LowLink",1,["low_link::LowLink"]]], "mincost_flow":[["impl Freeze for Edge",1,["mincost_flow::Edge"]],["impl Freeze for MinCostFlow",1,["mincost_flow::MinCostFlow"]]], "partially_persistent_union_find":[["impl Freeze for PartiallyPersistentUnionFind",1,["partially_persistent_union_find::PartiallyPersistentUnionFind"]]], -"radix_heap":[["impl<T> Freeze for RadixHeap<T>",1,["radix_heap::RadixHeap"]]], "randtools":[["impl Freeze for LogUniform",1,["randtools::LogUniform"]],["impl Freeze for DistinctTwo",1,["randtools::DistinctTwo"]],["impl Freeze for SubRange",1,["randtools::SubRange"]],["impl Freeze for NonEmptySubRange",1,["randtools::NonEmptySubRange"]],["impl Freeze for Tree",1,["randtools::Tree"]],["impl Freeze for SimpleGraph",1,["randtools::SimpleGraph"]],["impl Freeze for SimpleDigraph",1,["randtools::SimpleDigraph"]],["impl Freeze for SimpleGraphEdges",1,["randtools::SimpleGraphEdges"]],["impl Freeze for SimpleDigraphEdges",1,["randtools::SimpleDigraphEdges"]]], "rational":[["impl<T> Freeze for Rational<T>where\n T: Freeze,",1,["rational::Rational"]]], "rb":[["impl<K, O> Freeze for MultimapSeg<K, O>",1,["rb::map::MultimapSeg"]],["impl<K, V> Freeze for Multimap<K, V>",1,["rb::map::Multimap"]],["impl<K> Freeze for Multiset<K>",1,["rb::map::Multiset"]],["impl<O> Freeze for Seg<O>",1,["rb::seq::Seg"]]], diff --git a/implementors/core/marker/trait.Send.js b/implementors/core/marker/trait.Send.js index 4265ca18..1c5684dc 100644 --- a/implementors/core/marker/trait.Send.js +++ b/implementors/core/marker/trait.Send.js @@ -23,7 +23,6 @@ "low_link":[["impl Send for LowLink",1,["low_link::LowLink"]]], "mincost_flow":[["impl Send for Edge",1,["mincost_flow::Edge"]],["impl Send for MinCostFlow",1,["mincost_flow::MinCostFlow"]]], "partially_persistent_union_find":[["impl Send for PartiallyPersistentUnionFind",1,["partially_persistent_union_find::PartiallyPersistentUnionFind"]]], -"radix_heap":[["impl<T> Send for RadixHeap<T>where\n T: Send,",1,["radix_heap::RadixHeap"]]], "randtools":[["impl Send for LogUniform",1,["randtools::LogUniform"]],["impl Send for DistinctTwo",1,["randtools::DistinctTwo"]],["impl Send for SubRange",1,["randtools::SubRange"]],["impl Send for NonEmptySubRange",1,["randtools::NonEmptySubRange"]],["impl Send for Tree",1,["randtools::Tree"]],["impl Send for SimpleGraph",1,["randtools::SimpleGraph"]],["impl Send for SimpleDigraph",1,["randtools::SimpleDigraph"]],["impl Send for SimpleGraphEdges",1,["randtools::SimpleGraphEdges"]],["impl Send for SimpleDigraphEdges",1,["randtools::SimpleDigraphEdges"]]], "rational":[["impl<T> Send for Rational<T>where\n T: Send,",1,["rational::Rational"]]], "rb":[["impl<K, O> !Send for MultimapSeg<K, O>",1,["rb::map::MultimapSeg"]],["impl<K, V> !Send for Multimap<K, V>",1,["rb::map::Multimap"]],["impl<K> !Send for Multiset<K>",1,["rb::map::Multiset"]],["impl<O> !Send for Seg<O>",1,["rb::seq::Seg"]]], diff --git a/implementors/core/marker/trait.StructuralEq.js b/implementors/core/marker/trait.StructuralEq.js index cc2546b8..ee541785 100644 --- a/implementors/core/marker/trait.StructuralEq.js +++ b/implementors/core/marker/trait.StructuralEq.js @@ -13,7 +13,6 @@ "lazy_segbeats":[["impl<T> StructuralEq for Segbeats<T>"]], "low_link":[["impl StructuralEq for LowLink"]], "mincost_flow":[["impl StructuralEq for Edge"]], -"radix_heap":[["impl<T> StructuralEq for RadixHeap<T>"]], "segbeats":[["impl<T> StructuralEq for Segbeats<T>"]], "segbeats_task3":[["impl<T> StructuralEq for Segbeats<T>"]], "vec_lines":[["impl<T> StructuralEq for Line<T>"],["impl<T, C> StructuralEq for VecLines<T, C>"],["impl StructuralEq for DecreasingTilt"],["impl StructuralEq for IncreasingTilt"]], diff --git a/implementors/core/marker/trait.StructuralPartialEq.js b/implementors/core/marker/trait.StructuralPartialEq.js index d724b32d..408207ef 100644 --- a/implementors/core/marker/trait.StructuralPartialEq.js +++ b/implementors/core/marker/trait.StructuralPartialEq.js @@ -15,7 +15,6 @@ "lazy_segbeats":[["impl<T> StructuralPartialEq for Segbeats<T>"]], "low_link":[["impl StructuralPartialEq for LowLink"]], "mincost_flow":[["impl StructuralPartialEq for Edge"],["impl StructuralPartialEq for MinCostFlow"]], -"radix_heap":[["impl<T> StructuralPartialEq for RadixHeap<T>"]], "segbeats":[["impl<T> StructuralPartialEq for Segbeats<T>"]], "segbeats_task3":[["impl<T> StructuralPartialEq for Segbeats<T>"]], "skew_heap":[["impl<T> StructuralPartialEq for SkewHeap<T>"]], diff --git a/implementors/core/marker/trait.Sync.js b/implementors/core/marker/trait.Sync.js index 603d456f..a257fb63 100644 --- a/implementors/core/marker/trait.Sync.js +++ b/implementors/core/marker/trait.Sync.js @@ -23,7 +23,6 @@ "low_link":[["impl Sync for LowLink",1,["low_link::LowLink"]]], "mincost_flow":[["impl Sync for Edge",1,["mincost_flow::Edge"]],["impl Sync for MinCostFlow",1,["mincost_flow::MinCostFlow"]]], "partially_persistent_union_find":[["impl Sync for PartiallyPersistentUnionFind",1,["partially_persistent_union_find::PartiallyPersistentUnionFind"]]], -"radix_heap":[["impl<T> Sync for RadixHeap<T>where\n T: Sync,",1,["radix_heap::RadixHeap"]]], "randtools":[["impl Sync for LogUniform",1,["randtools::LogUniform"]],["impl Sync for DistinctTwo",1,["randtools::DistinctTwo"]],["impl Sync for SubRange",1,["randtools::SubRange"]],["impl Sync for NonEmptySubRange",1,["randtools::NonEmptySubRange"]],["impl Sync for Tree",1,["randtools::Tree"]],["impl Sync for SimpleGraph",1,["randtools::SimpleGraph"]],["impl Sync for SimpleDigraph",1,["randtools::SimpleDigraph"]],["impl Sync for SimpleGraphEdges",1,["randtools::SimpleGraphEdges"]],["impl Sync for SimpleDigraphEdges",1,["randtools::SimpleDigraphEdges"]]], "rational":[["impl<T> Sync for Rational<T>where\n T: Sync,",1,["rational::Rational"]]], "rb":[["impl<K, O> !Sync for MultimapSeg<K, O>",1,["rb::map::MultimapSeg"]],["impl<K, V> !Sync for Multimap<K, V>",1,["rb::map::Multimap"]],["impl<K> !Sync for Multiset<K>",1,["rb::map::Multiset"]],["impl<O> !Sync for Seg<O>",1,["rb::seq::Seg"]]], diff --git a/implementors/core/marker/trait.Unpin.js b/implementors/core/marker/trait.Unpin.js index 58628a7f..95335717 100644 --- a/implementors/core/marker/trait.Unpin.js +++ b/implementors/core/marker/trait.Unpin.js @@ -23,7 +23,6 @@ "low_link":[["impl Unpin for LowLink",1,["low_link::LowLink"]]], "mincost_flow":[["impl Unpin for Edge",1,["mincost_flow::Edge"]],["impl Unpin for MinCostFlow",1,["mincost_flow::MinCostFlow"]]], "partially_persistent_union_find":[["impl Unpin for PartiallyPersistentUnionFind",1,["partially_persistent_union_find::PartiallyPersistentUnionFind"]]], -"radix_heap":[["impl<T> Unpin for RadixHeap<T>where\n T: Unpin,",1,["radix_heap::RadixHeap"]]], "randtools":[["impl Unpin for LogUniform",1,["randtools::LogUniform"]],["impl Unpin for DistinctTwo",1,["randtools::DistinctTwo"]],["impl Unpin for SubRange",1,["randtools::SubRange"]],["impl Unpin for NonEmptySubRange",1,["randtools::NonEmptySubRange"]],["impl Unpin for Tree",1,["randtools::Tree"]],["impl Unpin for SimpleGraph",1,["randtools::SimpleGraph"]],["impl Unpin for SimpleDigraph",1,["randtools::SimpleDigraph"]],["impl Unpin for SimpleGraphEdges",1,["randtools::SimpleGraphEdges"]],["impl Unpin for SimpleDigraphEdges",1,["randtools::SimpleDigraphEdges"]]], "rational":[["impl<T> Unpin for Rational<T>where\n T: Unpin,",1,["rational::Rational"]]], "rb":[["impl<K, O> Unpin for MultimapSeg<K, O>",1,["rb::map::MultimapSeg"]],["impl<K, V> Unpin for Multimap<K, V>",1,["rb::map::Multimap"]],["impl<K> Unpin for Multiset<K>",1,["rb::map::Multiset"]],["impl<O> Unpin for Seg<O>",1,["rb::seq::Seg"]]], diff --git a/implementors/core/panic/unwind_safe/trait.RefUnwindSafe.js b/implementors/core/panic/unwind_safe/trait.RefUnwindSafe.js index a31a182b..0bc6451a 100644 --- a/implementors/core/panic/unwind_safe/trait.RefUnwindSafe.js +++ b/implementors/core/panic/unwind_safe/trait.RefUnwindSafe.js @@ -23,7 +23,6 @@ "low_link":[["impl RefUnwindSafe for LowLink",1,["low_link::LowLink"]]], "mincost_flow":[["impl RefUnwindSafe for Edge",1,["mincost_flow::Edge"]],["impl RefUnwindSafe for MinCostFlow",1,["mincost_flow::MinCostFlow"]]], "partially_persistent_union_find":[["impl RefUnwindSafe for PartiallyPersistentUnionFind",1,["partially_persistent_union_find::PartiallyPersistentUnionFind"]]], -"radix_heap":[["impl<T> RefUnwindSafe for RadixHeap<T>where\n T: RefUnwindSafe,",1,["radix_heap::RadixHeap"]]], "randtools":[["impl RefUnwindSafe for LogUniform",1,["randtools::LogUniform"]],["impl RefUnwindSafe for DistinctTwo",1,["randtools::DistinctTwo"]],["impl RefUnwindSafe for SubRange",1,["randtools::SubRange"]],["impl RefUnwindSafe for NonEmptySubRange",1,["randtools::NonEmptySubRange"]],["impl RefUnwindSafe for Tree",1,["randtools::Tree"]],["impl RefUnwindSafe for SimpleGraph",1,["randtools::SimpleGraph"]],["impl RefUnwindSafe for SimpleDigraph",1,["randtools::SimpleDigraph"]],["impl RefUnwindSafe for SimpleGraphEdges",1,["randtools::SimpleGraphEdges"]],["impl RefUnwindSafe for SimpleDigraphEdges",1,["randtools::SimpleDigraphEdges"]]], "rational":[["impl<T> RefUnwindSafe for Rational<T>where\n T: RefUnwindSafe,",1,["rational::Rational"]]], "rb":[["impl<K, O> RefUnwindSafe for MultimapSeg<K, O>where\n K: RefUnwindSafe,\n <O as MultimapOp>::Acc: RefUnwindSafe,\n <O as MultimapOp>::Value: RefUnwindSafe,",1,["rb::map::MultimapSeg"]],["impl<K, V> RefUnwindSafe for Multimap<K, V>where\n K: RefUnwindSafe,\n V: RefUnwindSafe,",1,["rb::map::Multimap"]],["impl<K> RefUnwindSafe for Multiset<K>where\n K: RefUnwindSafe,",1,["rb::map::Multiset"]],["impl<O> RefUnwindSafe for Seg<O>where\n <O as Op>::Value: RefUnwindSafe,",1,["rb::seq::Seg"]]], diff --git a/implementors/core/panic/unwind_safe/trait.UnwindSafe.js b/implementors/core/panic/unwind_safe/trait.UnwindSafe.js index a0226ab7..dd153797 100644 --- a/implementors/core/panic/unwind_safe/trait.UnwindSafe.js +++ b/implementors/core/panic/unwind_safe/trait.UnwindSafe.js @@ -23,7 +23,6 @@ "low_link":[["impl UnwindSafe for LowLink",1,["low_link::LowLink"]]], "mincost_flow":[["impl UnwindSafe for Edge",1,["mincost_flow::Edge"]],["impl UnwindSafe for MinCostFlow",1,["mincost_flow::MinCostFlow"]]], "partially_persistent_union_find":[["impl UnwindSafe for PartiallyPersistentUnionFind",1,["partially_persistent_union_find::PartiallyPersistentUnionFind"]]], -"radix_heap":[["impl<T> UnwindSafe for RadixHeap<T>where\n T: UnwindSafe,",1,["radix_heap::RadixHeap"]]], "randtools":[["impl UnwindSafe for LogUniform",1,["randtools::LogUniform"]],["impl UnwindSafe for DistinctTwo",1,["randtools::DistinctTwo"]],["impl UnwindSafe for SubRange",1,["randtools::SubRange"]],["impl UnwindSafe for NonEmptySubRange",1,["randtools::NonEmptySubRange"]],["impl UnwindSafe for Tree",1,["randtools::Tree"]],["impl UnwindSafe for SimpleGraph",1,["randtools::SimpleGraph"]],["impl UnwindSafe for SimpleDigraph",1,["randtools::SimpleDigraph"]],["impl UnwindSafe for SimpleGraphEdges",1,["randtools::SimpleGraphEdges"]],["impl UnwindSafe for SimpleDigraphEdges",1,["randtools::SimpleDigraphEdges"]]], "rational":[["impl<T> UnwindSafe for Rational<T>where\n T: UnwindSafe,",1,["rational::Rational"]]], "rb":[["impl<K, O> UnwindSafe for MultimapSeg<K, O>where\n K: RefUnwindSafe,\n <O as MultimapOp>::Acc: RefUnwindSafe,\n <O as MultimapOp>::Value: RefUnwindSafe,",1,["rb::map::MultimapSeg"]],["impl<K, V> UnwindSafe for Multimap<K, V>where\n K: RefUnwindSafe,\n V: RefUnwindSafe,",1,["rb::map::Multimap"]],["impl<K> UnwindSafe for Multiset<K>where\n K: RefUnwindSafe,",1,["rb::map::Multiset"]],["impl<O> UnwindSafe for Seg<O>where\n <O as Op>::Value: RefUnwindSafe,",1,["rb::seq::Seg"]]], diff --git a/radix_heap/all.html b/radix_heap/all.html deleted file mode 100644 index ea932c29..00000000 --- a/radix_heap/all.html +++ /dev/null @@ -1,35 +0,0 @@ -List of all items in this crate
- - - - - -

List of all items

Structs

\ No newline at end of file diff --git a/radix_heap/index.html b/radix_heap/index.html deleted file mode 100644 index c4d02572..00000000 --- a/radix_heap/index.html +++ /dev/null @@ -1,36 +0,0 @@ -radix_heap - Rust
- - - - - -

Crate radix_heap

source ·
Expand description

CAUTION: Failing in tests!

-

Structs

\ No newline at end of file diff --git a/radix_heap/sidebar-items.js b/radix_heap/sidebar-items.js deleted file mode 100644 index 84b2a8ee..00000000 --- a/radix_heap/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -window.SIDEBAR_ITEMS = {"struct":["RadixHeap"]}; \ No newline at end of file diff --git a/radix_heap/struct.RadixHeap.html b/radix_heap/struct.RadixHeap.html deleted file mode 100644 index ac763cb7..00000000 --- a/radix_heap/struct.RadixHeap.html +++ /dev/null @@ -1,53 +0,0 @@ -RadixHeap in radix_heap - Rust
- - - - - -

Struct radix_heap::RadixHeap

source · 
pub struct RadixHeap<T> { /* private fields */ }
👎Deprecated

Implementations§

source§

impl<T> RadixHeap<T>

source

pub fn new() -> Self

source

pub fn push(&mut self, key: u32, value: T)

source

pub fn pop(&mut self) -> Option<(u32, T)>

Trait Implementations§

source§

impl<T: Clone> Clone for RadixHeap<T>

source§

fn clone(&self) -> RadixHeap<T>

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
source§

impl<T: Debug> Debug for RadixHeap<T>

source§

fn fmt(&self, w: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<T: Debug> Default for RadixHeap<T>

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl<T: PartialEq> PartialEq<RadixHeap<T>> for RadixHeap<T>

source§

fn eq(&self, other: &RadixHeap<T>) -> bool

This method tests for self and other values to be equal, and is used -by ==.
1.0.0 · source§

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
source§

impl<T: Eq> Eq for RadixHeap<T>

source§

impl<T> StructuralEq for RadixHeap<T>

source§

impl<T> StructuralPartialEq for RadixHeap<T>

Auto Trait Implementations§

§

impl<T> RefUnwindSafe for RadixHeap<T>where - T: RefUnwindSafe,

§

impl<T> Send for RadixHeap<T>where - T: Send,

§

impl<T> Sync for RadixHeap<T>where - T: Sync,

§

impl<T> Unpin for RadixHeap<T>where - T: Unpin,

§

impl<T> UnwindSafe for RadixHeap<T>where - T: UnwindSafe,

Blanket Implementations§

source§

impl<T> Any for Twhere - T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere - T: ?Sized,

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere - T: ?Sized,

const: unstable · source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

const: unstable · source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

const: unstable · source§

fn into(self) -> U

Calls U::from(self).

-

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T> ToOwned for Twhere - T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
const: unstable · source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere - U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
const: unstable · source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/search-index.js b/search-index.js index b3ed4fb7..a9eb12bc 100644 --- a/search-index.js +++ b/search-index.js @@ -7,7 +7,6 @@ var searchIndex = JSON.parse('{\ "cht":{"doc":"CHT です。","t":"DEEIDDRLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLKLLLLLLLLLLLLLLLLLLLLLLLLLL","n":["BTreeCht","Concave","Convex","ConvexOrConcave","Quadratic","VecCht","X","add","add","add","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","default","default","default","eq","eq","eq","eval","eval","eval","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","hash","hash","hash","hash","hash","into","into","into","into","into","mul","multieval","multieval","neg","negate_if_concave","negate_if_concave","negate_if_concave","new","new","square","sub","to_owned","to_owned","to_owned","to_owned","to_owned","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id"],"q":[[0,"cht"]],"d":["ログがつく方","凹関数を管理する方であるというマーカー","凸関数を管理する方であるというマーカー","BTreeCht, VecCht …","二次式","ログがつかない方","変数","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the argument unchanged.","","","","","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","",""],"i":[0,0,0,0,0,0,0,2,4,3,6,7,2,4,3,6,7,2,4,3,6,7,2,4,3,6,7,2,4,3,2,4,3,2,4,3,2,4,3,6,7,2,4,3,6,7,2,4,3,3,6,7,2,4,3,6,7,2,4,3,3,2,4,3,1,6,7,2,4,3,3,6,7,2,4,3,6,7,2,4,3,6,7,2,4,3,6,7,2,4,3],"f":[0,0,0,0,0,0,0,[[[2,[1]],3]],[[[4,[1]],3]],[[3,[5,[3]]]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[6,6],[7,7],[[[2,[8]]],[[2,[8]]]],[[[4,[8]]],[[4,[8]]]],[3,3],[[]],[[]],[[]],[[]],[[]],[[],[[2,[9]]]],[[],[[4,[9]]]],[[],3],[[[2,[10]],[2,[10]]],11],[[[4,[10]],[4,[10]]],11],[[3,3],11],[[[2,[1]],12],12],[[[4,[1]],12],12],[[3,12],12],[[6,13],14],[[7,13],14],[[[2,[15]],13],14],[[[4,[15]],13],14],[[3,13],14],[[]],[[]],[[]],[[]],[12,3],[[]],[[6,16]],[[7,16]],[[[2,[17]],16]],[[[4,[17]],16]],[[3,16]],[[]],[[]],[[]],[[]],[[]],[[3,[5,[3]]]],[[[2,[1]],18],[[19,[12]]]],[[[4,[1]],18],[[19,[12]]]],[3],[12,12],[12,12],[12,12],[[],[[2,[1]]]],[[],[[4,[1]]]],[3,3],[[3,[5,[3]]]],[[]],[[]],[[]],[[]],[[]],[[],20],[[],20],[[],20],[[],20],[[],20],[[],20],[[],20],[[],20],[[],20],[[],20],[[],21],[[],21],[[],21],[[],21],[[],21]],"c":[],"p":[[8,"ConvexOrConcave"],[3,"VecCht"],[3,"Quadratic"],[3,"BTreeCht"],[8,"Into"],[4,"Convex"],[4,"Concave"],[8,"Clone"],[8,"Default"],[8,"PartialEq"],[15,"bool"],[15,"i64"],[3,"Formatter"],[6,"Result"],[8,"Debug"],[8,"Hasher"],[8,"Hash"],[8,"Iterator"],[3,"Vec"],[4,"Result"],[3,"TypeId"]]},\ "cipolla":{"doc":"","t":"SSISF","n":["ONE","TWO","Unsigned","ZERO","cipolla_sqrt"],"q":[[0,"cipolla"]],"d":["","","","",""],"i":[1,1,0,1,0],"f":[0,0,0,0,[[1,1],[[2,[1]]]]],"c":[],"p":[[8,"Unsigned"],[4,"Option"]]},\ "convex_hull":{"doc":"","t":"FFFFF","n":["caliper","ccw","convex_hull","is_convex","sqmag"],"q":[[0,"convex_hull"]],"d":["凸包を求めます。 …","det(p1 - p0, p2 - p0) を求めます。","凸包を求めます。 …","凸であれば true を返します。","|p0 - p1| ^ 2 を求めます。"],"i":[0,0,0,0,0],"f":[[[]],[[],1],[[],2],[[],3],[[],1]],"c":[],"p":[[15,"i64"],[3,"Vec"],[15,"bool"]]},\ -"dijkstra_radix_heap":{"doc":"CAUTION: RadixHeap fails in testst!","t":"FF","n":["calc_dist","calc_dist_restore"],"q":[[0,"dijkstra_radix_heap"]],"d":["一点からの距離配列を作ります。","一点からの距離配列を作ります。"],"i":[0,0],"f":[[1,[[3,[2]]]],[1]],"c":[0],"p":[[15,"usize"],[15,"u32"],[3,"Vec"]]},\ "dinic":{"doc":"Solves maximum flow problem.","t":"DDDILLLLLLLMLLLLLLLLLLLMLLLLLLLMLLLLKLLLLLMLLLLLLLLLLLLK","n":["Dinic","Edge","EdgeKey","Value","add_edge","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","cap","change_edge","clone","clone","clone","clone_into","clone_into","clone_into","eq","eq","eq","flow","flow","flow_with_limit","fmt","fmt","fmt","from","from","from","from","get_edge","get_edges","get_excess","get_network","infinity","into","into","into","min_cut","new","to","to_owned","to_owned","to_owned","try_from","try_from","try_from","try_into","try_into","try_into","type_id","type_id","type_id","zero"],"q":[[0,"dinic"]],"d":["A struct to execute Dinic’s algorithm.","A summary of the state of an edge, which is returned by …","A key object to query an edge.","An adapter trait of the capacity.","Inserts a new edge to the network.","","","","","","","The capacity of an edge.","Changes the capacity and the amount of the edge …","","","","","","","","","","Auguments the flow from s to t as much as possible. It …","The value of the flow of the network at this edge.","Auguments the flow from s to t as much as possible as long …","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","The vertex-index of the source of an edge.","Returns the current internal state of the edges.","Collects all the edges.","Returens the Vec of excess of all the vertices.","Collects all the edges and arrange it in adjacent-list …","Returns the max value of Self.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Returns a vector of length n, such that the i-th element …","Creates a new instance of Dinic","The vertex-index of the target of an edge.","","","","","","","","","","","","","Returns the zero."],"i":[0,0,0,0,2,2,6,4,2,6,4,6,2,2,6,4,2,6,4,2,6,4,2,6,2,2,6,4,2,6,4,6,2,2,2,2,1,2,6,4,2,2,6,2,6,4,2,6,4,2,6,4,2,6,4,1],"f":[0,0,0,0,[[[2,[1]],3,3,1],4],[[]],[[]],[[]],[[]],[[]],[[]],0,[[[2,[1]],4,1,1]],[[[2,[5]]],[[2,[5]]]],[[[6,[5]]],[[6,[5]]]],[4,4],[[]],[[]],[[]],[[[2,[7]],[2,[7]]],8],[[[6,[7]],[6,[7]]],8],[[4,4],8],[[[2,[1]],3,3],1],0,[[[2,[1]],3,3,1],1],[[[2,[1]],9],10],[[[6,[11]],9],10],[[4,9],10],[[]],[[]],[[]],0,[[[2,[1]],4],[[6,[1]]]],[[[2,[1]]],[[12,[[6,[1]]]]]],[[[2,[1]]],[[12,[1]]]],[[[2,[1]]],[[12,[[12,[[6,[1]]]]]]]],[[]],[[]],[[]],[[]],[[[2,[1]],3],[[12,[8]]]],[3,[[2,[1]]]],0,[[]],[[]],[[]],[[],13],[[],13],[[],13],[[],13],[[],13],[[],13],[[],14],[[],14],[[],14],[[]]],"c":[],"p":[[8,"Value"],[3,"Dinic"],[15,"usize"],[3,"EdgeKey"],[8,"Clone"],[3,"Edge"],[8,"PartialEq"],[15,"bool"],[3,"Formatter"],[6,"Result"],[8,"Debug"],[3,"Vec"],[4,"Result"],[3,"TypeId"]]},\ "dual_segtree":{"doc":"双対セグメント木（右作用）","t":"DIQLLLLLLLLLLLLLLLLKLLLLLKLLLLL","n":["DualSegtree","Ops","Value","apply","borrow","borrow_mut","clone","clone_into","collect_vec","default","eq","fmt","from","from","from_iter","get","get_cloned","get_copied","get_mut","identity","into","into_vec","is_empty","len","new","op","op_assign_from_right","to_owned","try_from","try_into","type_id"],"q":[[0,"dual_segtree"]],"d":["双対セグメント木（右作用）","演算（右作用）","値型","range に x を作用させます。（右作用）","","","","","Vec に変換します。","","","","","Returns the argument unchanged.","","i 番目の要素への参照を返します。","i 番目の要素をクローンして返します。","i 番目の要素をコピーして返します。","i 番目の要素への可変参照を返します。","op の単位元","Calls U::from(self).","Vec に変換します。","空なら true を返します。","管理している配列の長さを返します。","ExactSizeIterator から作ります。","作用する演算（右作用）","lhs を op(lhs, rhs) で置き換えます。","","","",""],"i":[0,0,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,1,1,2,2,2,2],"f":[0,0,0,[[[2,[1]],[4,[3]]]],[[]],[[]],[[[2,[[0,[5,1]]]]],[[2,[[0,[5,1]]]]]],[[]],[[[2,[1]]],6],[[],[[2,[[0,[7,1]]]]]],[[[2,[[0,[8,1]]]],[2,[[0,[8,1]]]]],9],[[[2,[1]],10],11],[6,[[2,[1]]]],[[]],[12,[[2,[1]]]],[[[2,[1]],3]],[[[2,[1]],3]],[[[2,[1]],3]],[[[2,[1]],3]],[[]],[[]],[[[2,[1]]],6],[[[2,[1]]],9],[[[2,[1]]],3],[12,[[2,[1]]]],[[]],[[]],[[]],[[],13],[[],13],[[],14]],"c":[],"p":[[8,"Ops"],[3,"DualSegtree"],[15,"usize"],[8,"RangeBounds"],[8,"Clone"],[3,"Vec"],[8,"Default"],[8,"PartialEq"],[15,"bool"],[3,"Formatter"],[6,"Result"],[8,"IntoIterator"],[4,"Result"],[3,"TypeId"]]},\ "elim":{"doc":"","t":"F","n":["column_reduce"],"q":[[0,"elim"]],"d":["…"],"i":[0],"f":[[[],1]],"c":[],"p":[[15,"usize"]]},\ @@ -40,7 +39,6 @@ var searchIndex = JSON.parse('{\ "next_permutation":{"doc":"A library to enumerate permutations, shuffles, and …","t":"FFFFFFFFFFFFFFF","n":["for_each_pairing","for_each_partition","for_each_partition_rev","for_each_permutation","for_each_shuffle","next_pairing","next_partition","next_permutation","next_shuffle","pairings","partitions","partitions_rev","permutations","prev_partition","shuffles"],"q":[[0,"next_permutation"]],"d":["Calls f for each pairing (ascending …","Calls f for each partition of n in lexicographic order.","Calls f for each partition of n in the reverse of the …","Calls f for each permutation of a in lexicographic order.","Calls f for each $(K, N - K)$-shuffle of a in …","Returns the next pairing (ascending …","Returns the next partition of a in lexicographic order.","Returns the next permutation of a in lexicographic order.","Returns the next $(K, N - K)$-shuffle of a in …","Returns all pairings (ascending $(2,2,\\\\dots,2)$-shuffles) …","Returns all partitions of n in lexicographic order.","Returns all partitions of n in the reverse of the …","Returns all permutations of a in lexicographic order.","Returns the previous partition of a in lexicographic order.","Returns all $(K, N - K)$-shuffles of a in lexicographic …"],"i":[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],"f":[[[1,2]],[[1,2]],[[1,2]],[2],[[1,2]],[[],3],[[[4,[1]]],3],[[],3],[1,3],[1,[[4,[[4,[1]]]]]],[1,[[4,[[4,[1]]]]]],[1,[[4,[[4,[1]]]]]],[[[4,[[0,[5,6]]]]],[[4,[[4,[[0,[5,6]]]]]]]],[[[4,[1]]],3],[[[4,[[0,[5,6]]]],1],[[4,[[4,[[0,[5,6]]]]]]]]],"c":[],"p":[[15,"usize"],[8,"FnMut"],[15,"bool"],[3,"Vec"],[8,"Ord"],[8,"Clone"]]},\ "numeric_search":{"doc":"Run classic binary or exponential search on integer or …","t":"ISSSSSSSIISSSFFFFFK","n":["Float","INFINITY","MAX","MIN","NEG_INFINITY","ONE","ONE","ONE","Signed","Unsigned","ZERO","ZERO","ZERO","binary_search_signed","binary_search_unsigned","exp_search_float","exp_search_signed","exp_search_unsigned","sqrt"],"q":[[0,"numeric_search"]],"d":["Floating pont number.","$\\\\infty$","","","$-\\\\infty$","$1$","$1$","","Signed integers.","Unsigned integers.","$0$","$0$","","Run a binary search search on signed numbers.","Run a binary search search on unsigned numbers.","Run an exponential search on floating point numbers.","Run an exponential search on unsigned numbers.","Run an exponential search on unsigned numbers.","$x \\\\mapsto \\\\sqrt x$"],"i":[0,4,1,1,4,4,3,1,0,0,4,3,1,0,0,0,0,0,4],"f":[0,0,0,0,0,0,0,0,0,0,0,0,0,[[1,1,2],1],[[3,3,2],3],[2,4],[2,[[5,[1]]]],[2,[[5,[3]]]],[[]]],"c":[],"p":[[8,"Signed"],[8,"FnMut"],[8,"Unsigned"],[8,"Float"],[4,"Option"]]},\ "partially_persistent_union_find":{"doc":"…","t":"DLLLLLLLLLLLLLLLLL","n":["PartiallyPersistentUnionFind","borrow","borrow_mut","clone","clone_into","find","fmt","from","into","new","same","size","time","to_owned","try_from","try_into","type_id","union"],"q":[[0,"partially_persistent_union_find"]],"d":["…","","","","","時刻 time の代表の頂点番号を返します。","","Returns the argument unchanged.","Calls U::from(self).","新しくデータ構造を構築します。","時刻 time に i と j …","時刻 time の i …","2 頂点が結合された時刻を返します。","","","","","…"],"i":[0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"f":[0,[[]],[[]],[1,1],[[]],[[1,2,2],2],[[1,3],4],[[]],[[]],[2,1],[[1,2,2,2],5],[[1,2,2],2],[[1,2,2],[[6,[2]]]],[[]],[[],7],[[],7],[[],8],[[1,2,2,2],5]],"c":[],"p":[[3,"PartiallyPersistentUnionFind"],[15,"usize"],[3,"Formatter"],[6,"Result"],[15,"bool"],[4,"Option"],[4,"Result"],[3,"TypeId"]]},\ -"radix_heap":{"doc":"CAUTION: Failing in tests!","t":"DLLLLLLLLLLLLLLLL","n":["RadixHeap","borrow","borrow_mut","clone","clone_into","default","eq","fmt","from","into","new","pop","push","to_owned","try_from","try_into","type_id"],"q":[[0,"radix_heap"]],"d":["","","","","","","","","Returns the argument unchanged.","Calls U::from(self).","","","","","","",""],"i":[0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2],"f":[0,[[]],[[]],[[[2,[1]]],[[2,[1]]]],[[]],[[],[[2,[3]]]],[[[2,[4]],[2,[4]]],5],[[[2,[3]],6],7],[[]],[[]],[[],2],[2,8],[[2,9]],[[]],[[],10],[[],10],[[],11]],"c":[0],"p":[[8,"Clone"],[3,"RadixHeap"],[8,"Debug"],[8,"PartialEq"],[15,"bool"],[3,"Formatter"],[6,"Result"],[4,"Option"],[15,"u32"],[4,"Result"],[3,"TypeId"]]},\ "randtools":{"doc":"","t":"DDDDDDDDDLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL","n":["DistinctTwo","LogUniform","NonEmptySubRange","SimpleDigraph","SimpleDigraphEdges","SimpleGraph","SimpleGraphEdges","SubRange","Tree","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from","into","into","into","into","into","into","into","into","into","sample","sample","sample","sample","sample","sample","sample","sample","sample","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","vzip","vzip","vzip","vzip","vzip","vzip","vzip","vzip","vzip"],"q":[[0,"randtools"]],"d":["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","",""],"i":[0,0,0,0,0,0,0,0,0,1,4,5,6,7,8,9,10,11,1,4,5,6,7,8,9,10,11,1,4,5,6,7,8,9,10,11,1,4,5,6,7,8,9,10,11,1,4,5,6,7,8,9,10,11,1,4,5,6,7,8,9,10,11,1,4,5,6,7,8,9,10,11,1,4,5,6,7,8,9,10,11,1,4,5,6,7,8,9,10,11,1,4,5,6,7,8,9,10,11],"f":[0,0,0,0,0,0,0,0,0,[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[1,2],3],[[4,2],3],[[5,2],3],[[6,2],3],[[7,2],3],[[8,2],3],[[9,2],3],[[10,2],3],[[11,2],3],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[1,[0,[12,13]]],14],[[4,[0,[12,13]]]],[[5,[0,[12,13]]],[[15,[14]]]],[[6,[0,[12,13]]],[[15,[14]]]],[[7,[0,[12,13]]],[[16,[[16,[14]]]]]],[[8,[0,[12,13]]],[[16,[[16,[14]]]]]],[[9,[0,[12,13]]],[[16,[[16,[14]]]]]],[[10,[0,[12,13]]],16],[[11,[0,[12,13]]],16],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],18],[[],18],[[],18],[[],18],[[],18],[[],18],[[],18],[[],18],[[],18],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]]],"c":[],"p":[[3,"LogUniform"],[3,"Formatter"],[6,"Result"],[3,"DistinctTwo"],[3,"SubRange"],[3,"NonEmptySubRange"],[3,"Tree"],[3,"SimpleGraph"],[3,"SimpleDigraph"],[3,"SimpleGraphEdges"],[3,"SimpleDigraphEdges"],[8,"Rng"],[8,"Sized"],[15,"usize"],[3,"Range"],[3,"Vec"],[4,"Result"],[3,"TypeId"]]},\ "rational":{"doc":"","t":"DILLLLLLLLLLLLLLLLLLLLLKKLLLLLLLLLKLLLLLLLLLLLLLLK","n":["Rational","Signed","add","add","add","add","add_assign","borrow","borrow_mut","clone","clone_into","cmp","decompose","default","div","div","div","div","div_assign","eq","fmt","from","from_str","generic_abs","generic_signum","into","into_f64","mul","mul","mul","mul","mul_assign","neg","new","one","partial_cmp","product","product","sub","sub","sub","sub","sub_assign","sum","sum","to_owned","try_from","try_into","type_id","zero"],"q":[[0,"rational"]],"d":["","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","","","","Calls U::from(self).","","","","","","","","","","","","","","","","","","","","","","","",""],"i":[0,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,1,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1],"f":[0,0,[[[2,[1]],[2,[1]]]],[[[2,[1]],[2,[1]]],[[2,[1]]]],[[[2,[1]],[2,[1]]]],[[[2,[1]],[2,[1]]]],[[[2,[1]],[2,[1]]]],[[]],[[]],[[[2,[[0,[3,1]]]]],[[2,[[0,[3,1]]]]]],[[]],[[[2,[1]],[2,[1]]],4],[[[2,[1]]]],[[],[[2,[[0,[5,1]]]]]],[[[2,[1]],[2,[1]]]],[[[2,[1]],[2,[1]]]],[[[2,[1]],[2,[1]]]],[[[2,[1]],[2,[1]]],[[2,[1]]]],[[[2,[1]],[2,[1]]]],[[[2,[1]],[2,[1]]],6],[[[2,[1]],7],8],[[]],[9,[[10,[[2,[1]]]]]],[[]],[[]],[[]],[[[2,[1]]],11],[[[2,[1]],[2,[1]]]],[[[2,[1]],[2,[1]]]],[[[2,[1]],[2,[1]]]],[[[2,[1]],[2,[1]]],[[2,[1]]]],[[[2,[1]],[2,[1]]]],[[[2,[1]]]],[[1,1],[[2,[1]]]],[[]],[[[2,[1]],[2,[1]]],[[12,[4]]]],[13,[[2,[1]]]],[13,[[2,[1]]]],[[[2,[1]],[2,[1]]],[[2,[1]]]],[[[2,[1]],[2,[1]]]],[[[2,[1]],[2,[1]]]],[[[2,[1]],[2,[1]]]],[[[2,[1]],[2,[1]]]],[13,[[2,[1]]]],[13,[[2,[1]]]],[[]],[[],10],[[],10],[[],14],[[]]],"c":[],"p":[[8,"Signed"],[3,"Rational"],[8,"Clone"],[4,"Ordering"],[8,"Default"],[15,"bool"],[3,"Formatter"],[6,"Result"],[15,"str"],[4,"Result"],[15,"f64"],[4,"Option"],[8,"Iterator"],[3,"TypeId"]]},\ "rb":{"doc":"Containers for storing data in a red-black tree.","t":"QDIDDIDQQLLLLLLLLLLLLLLLLLLLLLLLLLLLKLLLLLLLLLLLLLLLLLLLLKLLLLLLLKLLLLLLLLLLLLLLLLLLLLLLKLLLLLLLLLLLLLLL","n":["Acc","Multimap","MultimapOp","MultimapSeg","Multiset","Op","Seg","Value","Value","append","binary_search","binary_search","binary_search","binary_search_ptr","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","default","default","default","default","display","fmt","fmt","fmt","fold","from","from","from","from","from_iter","identity","insert","insert","insert","insert","into","into","into","into","into_iter","into_iter","into_iter","into_iter","is_empty","is_empty","is_empty","is_empty","iter","iter","iter","iter","join","len","len","len","len","lower_bound","lower_bound","lower_bound","mul","new","new","new","new","nth","nth","nth","nth","nth_mut","nth_mut","partition_point","partition_point","partition_point","remove","remove","remove","remove","remove_nth","remove_nth","remove_nth","split_off","table","to_acc","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","upper_bound","upper_bound","upper_bound"],"q":[[0,"rb"]],"d":["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","","","","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","",""],"i":[6,0,0,0,0,0,0,6,1,2,7,10,11,7,7,10,11,2,7,10,11,2,7,10,11,2,2,10,11,2,2,7,10,11,2,2,1,7,10,11,2,7,10,11,2,7,10,11,2,7,10,11,2,7,10,11,2,6,7,10,11,2,7,10,11,1,7,10,11,2,7,10,11,2,7,2,7,10,11,7,10,11,2,7,10,11,2,2,6,7,10,11,2,7,10,11,2,7,10,11,2,7,10,11],"f":[0,0,0,0,0,0,0,0,0,[[[2,[1]],[2,[1]]]],[[[7,[[0,[3,[5,[[0,[3,4]]]]]],3,6]],[0,[3,4]]],[[9,[8]]]],[[[10,[[0,[3,[5,[[0,[3,4]]]]]],3]],[0,[3,4]]],[[9,[8]]]],[[[11,[[0,[3,[5,[[0,[3,4]]]]]],3]],[0,[3,4]]],[[9,[8,8]]]],[[[7,[[0,[3,[5,[[0,[3,4]]]]]],3,6]],[0,[3,4]]],[[9,[8]]]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[],[[7,[3,6]]]],[[],[[10,[3]]]],[[],[[11,[3]]]],[[],[[2,[1]]]],[[[2,[1]]],[[0,[1]]]],[[[10,[[0,[3,12]],12]],13],14],[[[11,[[0,[3,12]]]],13],14],[[[2,[1]],13],14],[[[2,[1]],[15,[8]]]],[[]],[[]],[[]],[[]],[16,[[2,[1]]]],[[]],[[[7,[3,6]],3]],[[[10,[3]],3]],[[[11,[3]],3]],[[[2,[1]],8]],[[]],[[]],[[]],[[]],[[[7,[3,6]]]],[[[10,[3]]]],[[[11,[3]]]],[[[2,[1]]]],[[[7,[3,6]]],17],[[[10,[3]]],17],[[[11,[3]]],17],[[[2,[1]]],17],[[[7,[3,6]]],[[0,[3,6]]]],[[[10,[3]]],[[0,[3]]]],[[[11,[3]]],[[0,[3]]]],[[[2,[1]]],[[0,[1]]]],[[18,18]],[[[7,[3,6]]],8],[[[10,[3]]],8],[[[11,[3]]],8],[[[2,[1]]],8],[[[7,[3,6]],3],8],[[[10,[3]],3],8],[[[11,[3]],3],8],[[]],[[],[[7,[3,6]]]],[[],[[10,[3]]]],[[],[[11,[3]]]],[[],[[2,[1]]]],[[[7,[3,6]],8]],[[[10,[3]],8]],[[[11,[3]],8],3],[[[2,[1]],8]],[[[7,[3,6]],8]],[[[2,[1]],8],[[0,[1]]]],[[[7,[3,6]],19],8],[[[10,[3]],19],8],[[[11,[3]],19],8],[[[7,[[0,[3,[5,[[0,[3,4]]]]]],3,6]],[0,[3,4]]],18],[[[10,[[0,[3,[5,[[0,[3,4]]]]]],3]],[0,[3,4]]],18],[[[11,[[0,[3,[5,[[0,[3,4]]]]]],3]],[0,[3,4]]],[[18,[[0,[3,[5,[[0,[3,4]]]]]],3]]]],[[[2,[1]],8]],[[[7,[3,6]],8]],[[[10,[3]],8]],[[[11,[3]],8],3],[[[2,[1]],8],[[2,[1]]]],[[[2,[1]]],[[0,[1]]]],[[]],[[],9],[[],9],[[],9],[[],9],[[],9],[[],9],[[],9],[[],9],[[],20],[[],20],[[],20],[[],20],[[[7,[3,6]],3],8],[[[10,[3]],3],8],[[[11,[3]],3],8]],"c":[],"p":[[8,"Op"],[3,"Seg"],[8,"Ord"],[8,"Sized"],[8,"Borrow"],[8,"MultimapOp"],[3,"MultimapSeg"],[15,"usize"],[4,"Result"],[3,"Multimap"],[3,"Multiset"],[8,"Debug"],[3,"Formatter"],[6,"Result"],[8,"RangeBounds"],[8,"IntoIterator"],[15,"bool"],[4,"Option"],[8,"FnMut"],[3,"TypeId"]]},\ diff --git a/settings.html b/settings.html index ac554fe7..23653185 100644 --- a/settings.html +++ b/settings.html @@ -1,4 +1,4 @@ -Rustdoc settings
Rustdoc settings
-

Rustdoc settings

Back
\ No newline at end of file +

Rustdoc settings

Back
\ No newline at end of file diff --git a/source-files.js b/source-files.js index b46f27c2..cbf1973b 100644 --- a/source-files.js +++ b/source-files.js @@ -7,7 +7,6 @@ var sourcesIndex = JSON.parse('{\ "cht":["",[],["lib.rs"]],\ "cipolla":["",[],["lib.rs"]],\ "convex_hull":["",[],["lib.rs"]],\ -"dijkstra_radix_heap":["",[],["lib.rs"]],\ "dinic":["",[],["lib.rs"]],\ "dual_segtree":["",[],["lib.rs"]],\ "elim":["",[],["lib.rs"]],\ @@ -40,7 +39,6 @@ var sourcesIndex = JSON.parse('{\ "next_permutation":["",[],["lib.rs"]],\ "numeric_search":["",[],["lib.rs"]],\ "partially_persistent_union_find":["",[],["lib.rs"]],\ -"radix_heap":["",[],["lib.rs"]],\ "randtools":["",[],["algo.rs","lib.rs"]],\ "rational":["",[],["lib.rs"]],\ "rb":["",[],["balance.rs","lib.rs","map.rs","seq.rs"]],\ diff --git a/src/dijkstra_radix_heap/lib.rs.html b/src/dijkstra_radix_heap/lib.rs.html deleted file mode 100644 index b2ef65f9..00000000 --- a/src/dijkstra_radix_heap/lib.rs.html +++ /dev/null @@ -1,263 +0,0 @@ -lib.rs - source
- - - - - -
1
-2
-3
-4
-5
-6
-7
-8
-9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
-30
-31
-32
-33
-34
-35
-36
-37
-38
-39
-40
-41
-42
-43
-44
-45
-46
-47
-48
-49
-50
-51
-52
-53
-54
-55
-56
-57
-58
-59
-60
-61
-62
-63
-64
-65
-66
-67
-68
-69
-70
-71
-72
-73
-74
-75
-76
-77
-78
-79
-80
-81
-82
-83
-84
-85
-86
-87
-88
-89
-90
-91
-92
-93
-94
-95
-96
-97
-98
-99
-100
-101
-102
-103
-104
-105
-106
-107
-108
-109
-110
-111
-112
-113
-114
-
//! CAUTION: `RadixHeap` fails in testst!
-#![allow(deprecated)]
-
-#[deprecated]
-/// 一点からの距離配列を作ります。
-pub fn calc_dist(s: usize, g: &[Vec<(usize, u32)>]) -> Vec<u32> {
-    let mut dist = vec![std::u32::MAX; g.len()];
-    dist[s] = 0;
-    let mut heap = radix_heap::RadixHeap::new();
-    heap.push(0, s);
-    while let Some((dx, x)) = heap.pop() {
-        if dx <= dist[x] {
-            for &(y, w) in &g[x] {
-                let dy = dx + w;
-                if dy < dist[y] {
-                    dist[y] = dy;
-                    heap.push(dy, y);
-                }
-            }
-        }
-    }
-    dist
-}
-
-/// 一点からの距離配列を作ります。
-pub fn calc_dist_restore(s: usize, g: &[Vec<(usize, u32)>]) -> (Vec<u32>, Vec<usize>) {
-    let mut dist = vec![std::u32::MAX; g.len()];
-    let mut prv = vec![std::usize::MAX; g.len()];
-    prv[s] = s;
-    dist[s] = 0;
-    let mut heap = radix_heap::RadixHeap::new();
-    heap.push(0, s);
-    while let Some((dx, x)) = heap.pop() {
-        if dx <= dist[x] {
-            for &(y, w) in &g[x] {
-                let dy = dx + w;
-                if dy < dist[y] {
-                    prv[y] = x;
-                    dist[y] = dy;
-                    heap.push(dy, y);
-                }
-            }
-        }
-    }
-    (dist, prv)
-}
-
-#[cfg(test)]
-mod tests {
-    use rand::prelude::*;
-    use randtools::LogUniform;
-    use randtools::SimpleDigraph;
-    use std::collections::HashMap;
-
-    #[test]
-    fn test_graph() {
-        let mut rng = StdRng::seed_from_u64(42);
-        for test_id in 0..100 {
-            let n = rng.sample(LogUniform(2..1000));
-            let m = rng.sample(LogUniform(n - 1..(n * (n - 1) / 2 + 1).min(1000)));
-            println!("Test {}, n = {}, m = {}", test_id, n, m);
-            // 重みなしの木を生成して……
-            let g = rng.sample(SimpleDigraph(n, m));
-            // 重みをつけます。
-            let g = g
-                .iter()
-                .map(|v| {
-                    v.iter()
-                        .map(|&j| (j, rng.gen_range(0..30)))
-                        .collect::<Vec<_>>()
-                })
-                .collect::<Vec<_>>();
-            let s = rng.gen_range(0..n);
-
-            // calc_dist
-            let dist = super::calc_dist(s, &g);
-            validate_dist(&g, &dist, s);
-
-            // calc_dist_restore
-            let (dist_, prv) = super::calc_dist_restore(s, &g);
-            assert_eq!(dist, dist_);
-            let edges = g
-                .iter()
-                .enumerate()
-                .flat_map(|(i, v)| v.iter().map(move |&(j, w)| ((i, j), w)))
-                .collect::<HashMap<_, _>>();
-            validate_dist_prv(&prv, &dist, &edges);
-        }
-    }
-
-    fn validate_dist(g: &[Vec<(usize, u32)>], dist: &[u32], s: usize) {
-        assert_eq!(dist[s], 0);
-        for (u, v, w) in g
-            .iter()
-            .enumerate()
-            .flat_map(|(i, v)| v.iter().map(move |&(j, w)| (i, j, w)))
-        {
-            assert!(dist[u].saturating_add(w) >= dist[v]);
-        }
-    }
-
-    fn validate_dist_prv(prv: &[usize], dist: &[u32], edges: &HashMap<(usize, usize), u32>) {
-        prv.iter().copied().enumerate().for_each(|(x, p)| {
-            let expected = if x == p {
-                0
-            } else if p == std::usize::MAX {
-                std::u32::MAX
-            } else {
-                dist[p] + edges.get(&(p, x)).unwrap()
-            };
-            assert_eq!(expected, dist[x]);
-        });
-    }
-}
-
\ No newline at end of file diff --git a/src/radix_heap/lib.rs.html b/src/radix_heap/lib.rs.html deleted file mode 100644 index 5380af03..00000000 --- a/src/radix_heap/lib.rs.html +++ /dev/null @@ -1,245 +0,0 @@ -lib.rs - source
- - - - - -
1
-2
-3
-4
-5
-6
-7
-8
-9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
-30
-31
-32
-33
-34
-35
-36
-37
-38
-39
-40
-41
-42
-43
-44
-45
-46
-47
-48
-49
-50
-51
-52
-53
-54
-55
-56
-57
-58
-59
-60
-61
-62
-63
-64
-65
-66
-67
-68
-69
-70
-71
-72
-73
-74
-75
-76
-77
-78
-79
-80
-81
-82
-83
-84
-85
-86
-87
-88
-89
-90
-91
-92
-93
-94
-95
-96
-97
-98
-99
-100
-101
-102
-103
-104
-105
-
//! CAUTION: Failing in tests!
-
-#![allow(deprecated, unused_imports)]
-use std::fmt::Debug;
-use std::fmt::{self};
-
-const RADIX_HEAP_LEN: usize = 32;
-
-#[deprecated]
-#[derive(Clone, PartialEq, Eq)]
-pub struct RadixHeap<T> {
-    stacks: [Vec<(u32, T)>; RADIX_HEAP_LEN],
-    last: u32,
-    len: u32,
-}
-impl<T> RadixHeap<T> {
-    pub fn new() -> Self {
-        Self {
-            stacks: <[Vec<(u32, T)>; RADIX_HEAP_LEN]>::default(),
-            last: 0,
-            len: 0,
-        }
-    }
-
-    pub fn push(&mut self, key: u32, value: T) {
-        assert!(self.last <= key);
-        self.len += 1;
-        self.stacks[Self::index(key ^ self.last)].push((key, value));
-    }
-
-    pub fn pop(&mut self) -> Option<(u32, T)> {
-        if self.len == 0 {
-            None
-        } else {
-            if self.stacks[0].is_empty() {
-                let stack = std::mem::take(
-                    self.stacks
-                        .iter_mut()
-                        .find(|stack| !stack.is_empty())
-                        .unwrap(),
-                );
-                let new_last = stack.iter().map(|&(key, _)| key).min().unwrap();
-                for (key, value) in stack {
-                    self.stacks[Self::index(key ^ new_last)].push((key, value));
-                }
-            }
-            self.len -= 1;
-            Some(self.stacks[0].pop().unwrap())
-        }
-    }
-
-    fn index(x: u32) -> usize {
-        RADIX_HEAP_LEN - x.leading_zeros() as usize
-    }
-}
-
-impl<T: Debug> Default for RadixHeap<T> {
-    fn default() -> Self {
-        Self::new()
-    }
-}
-
-impl<T: Debug> Debug for RadixHeap<T> {
-    fn fmt(&self, w: &mut fmt::Formatter) -> fmt::Result {
-        w.debug_list()
-            .entries(self.stacks.iter().flatten())
-            .finish()
-    }
-}
-
-#[cfg(test)]
-mod tests {
-    use rand::prelude::*;
-    use std::cmp::Reverse;
-    use std::collections::BinaryHeap;
-
-    // #[test]
-    // fn test_heap() {
-    //     let mut rng = StdRng::seed_from_u64(42);
-    //     let mut binary = BinaryHeap::new();
-    //     let mut radix = super::RadixHeap::new();
-    //     for _ in 0..30 {
-    //         match rng.gen_range(0..2) {
-    //             0 => {
-    //                 let key =
-    //                     binary.peek().map_or(0, |&(Reverse(key), _)| key) + rng.gen_range(0..128);
-    //                 let value = rng.gen_range(0..30);
-    //                 binary.push((Reverse(key), value));
-    //                 radix.push(key, value);
-    //             }
-    //             1 => {
-    //                 let expected = binary.pop();
-    //                 let result = radix.pop();
-    //                 if let Some((Reverse(expected), _)) = expected {
-    //                     let (result, _) = result.unwrap();
-    //                     assert_eq!(result, expected);
-    //                 } else {
-    //                     assert!(result.is_none());
-    //                 }
-    //             }
-    //             _ => unreachable!(),
-    //         }
-    //     }
-    // }
-}
-
\ No newline at end of file