Home
last modified time | relevance | path

Searched refs:FixedBitSet (Results 1 – 16 of 16) sorted by relevance

/external/rust/android-crates-io/crates/fixedbitset/tests/
Dtests.rs16 let mut fb = FixedBitSet::with_capacity(N); in it_works()
43 let fb = FixedBitSet::with_capacity_and_blocks(50, vec![8, 0]); in with_blocks()
59 let mut fb = FixedBitSet::with_capacity_and_blocks(500, vec![8, 0]); in with_blocks_too_small()
67 let fb = FixedBitSet::with_capacity_and_blocks(1, vec![8]); in with_blocks_too_big()
76 let fb = FixedBitSet::with_capacity_and_blocks(1, vec![0xff]); in with_blocks_too_big_range_check()
88 let mut fb = FixedBitSet::with_capacity(48); in grow()
105 let mut fb = FixedBitSet::default(); in grow_and_insert()
118 let mut fb = FixedBitSet::with_capacity(16); in test_toggle()
131 let mut fb = FixedBitSet::with_capacity(48); in copy_bit()
149 let mut fb = FixedBitSet::with_capacity(100); in count_ones()
[all …]
/external/rust/android-crates-io/crates/fixedbitset/src/
Dlib.rs73 pub struct FixedBitSet { struct
81 unsafe impl Send for FixedBitSet {} argument
84 unsafe impl Sync for FixedBitSet {} implementation
86 impl FixedBitSet { impl
89 FixedBitSet { in new()
107 FixedBitSet { in from_blocks_and_len()
141 fn do_grow(slf: &mut FixedBitSet, bits: usize) { in grow() argument
834 pub fn intersection<'a>(&'a self, other: &'a FixedBitSet) -> Intersection<'a> { in intersection()
842 pub fn union<'a>(&'a self, other: &'a FixedBitSet) -> Union<'a> { in union()
850 pub fn difference<'a>(&'a self, other: &'a FixedBitSet) -> Difference<'a> { in difference()
[all …]
Dserde_impl.rs4 use crate::{Block, FixedBitSet, BYTES};
10 struct BitSetByteSerializer<'a>(&'a FixedBitSet);
12 impl Serialize for FixedBitSet { implementation
39 impl<'de> Deserialize<'de> for FixedBitSet { implementation
98 type Value = FixedBitSet; in deserialize()
104 fn visit_seq<V>(self, mut seq: V) -> Result<FixedBitSet, V::Error> in deserialize() argument
115 Ok(FixedBitSet::with_capacity_and_blocks(length, data)) in deserialize()
118 fn visit_map<V>(self, mut map: V) -> Result<FixedBitSet, V::Error> in deserialize() argument
143 Ok(FixedBitSet::with_capacity_and_blocks(length, data)) in deserialize()
/external/rust/android-crates-io/crates/petgraph/src/
Dtraits_graph.rs1 use fixedbitset::FixedBitSet;
21 type AdjMatrix = FixedBitSet;
23 fn adjacency_matrix(&self) -> FixedBitSet { in adjacency_matrix() argument
25 let mut matrix = FixedBitSet::with_capacity(n * n); in adjacency_matrix()
37 fn is_adjacent(&self, matrix: &FixedBitSet, a: NodeIndex<Ix>, b: NodeIndex<Ix>) -> bool { in is_adjacent() argument
52 type AdjMatrix = FixedBitSet;
54 fn adjacency_matrix(&self) -> FixedBitSet { in adjacency_matrix() argument
56 let mut matrix = FixedBitSet::with_capacity(n * n); in adjacency_matrix()
68 fn is_adjacent(&self, matrix: &FixedBitSet, a: NodeIndex<Ix>, b: NodeIndex<Ix>) -> bool { in is_adjacent() argument
Dadj.rs7 use fixedbitset::FixedBitSet;
424 type Map = FixedBitSet;
425 fn visit_map(&self) -> FixedBitSet { in visit_map() argument
426 FixedBitSet::with_capacity(self.node_count()) in visit_map()
636 type AdjMatrix = FixedBitSet;
638 fn adjacency_matrix(&self) -> FixedBitSet { in adjacency_matrix() argument
640 let mut matrix = FixedBitSet::with_capacity(n * n); in adjacency_matrix()
651 fn is_adjacent(&self, matrix: &FixedBitSet, a: NodeIndex<Ix>, b: NodeIndex<Ix>) -> bool { in is_adjacent() argument
Dcsr.rs572 use fixedbitset::FixedBitSet;
579 type Map = FixedBitSet;
580 fn visit_map(&self) -> FixedBitSet { in visit_map() argument
581 FixedBitSet::with_capacity(self.node_count()) in visit_map()
798 type AdjMatrix = FixedBitSet;
800 fn adjacency_matrix(&self) -> FixedBitSet { in adjacency_matrix() argument
802 let mut matrix = FixedBitSet::with_capacity(n * n); in adjacency_matrix()
813 fn is_adjacent(&self, matrix: &FixedBitSet, a: NodeIndex<Ix>, b: NodeIndex<Ix>) -> bool { in is_adjacent() argument
Dmatrix_graph.rs11 use fixedbitset::FixedBitSet;
1128 type Map = FixedBitSet;
1130 fn visit_map(&self) -> FixedBitSet { in visit_map() argument
1131 FixedBitSet::with_capacity(self.node_bound()) in visit_map()
/external/rust/android-crates-io/crates/petgraph/src/algo/
Dtred.rs17 use fixedbitset::FixedBitSet;
114 let mut mark = FixedBitSet::with_capacity(g.node_count()); in dag_transitive_reduction_closure()
/external/rust/android-crates-io/crates/fixedbitset/
DREADME.md43 …- [#88](https://github.com/petgraph/fixedbitset/pull/88): Added `FixedBitSet::remove` by @james713…
44 …- [#89](https://github.com/petgraph/fixedbitset/pull/89): Added `FixedBitSet::zeros` and the `Zer…
45 …- [#92](https://github.com/petgraph/fixedbitset/pull/92): Added `FixedBitSet::grow_and_insert` fun…
61 `const` `FixedBitSet::new` consructor
DMETADATA2 description: "FixedBitSet is a simple bitset collection"
DCargo.toml18 description = "FixedBitSet is a simple bitset collection"
/external/rust/android-crates-io/crates/petgraph/src/visit/
Dfilter.rs3 use fixedbitset::FixedBitSet;
31 impl<N> FilterNode<N> for FixedBitSet implementation
33 FixedBitSet: VisitMap<N>,
52 impl<N> FilterNode<N> for &FixedBitSet implementation
54 FixedBitSet: VisitMap<N>,
Dmod.rs76 use fixedbitset::FixedBitSet;
403 impl<Ix> VisitMap<Ix> for FixedBitSet implementation
/external/rust/android-crates-io/crates/petgraph/src/graph_impl/stable_graph/
Dmod.rs15 use fixedbitset::FixedBitSet;
1791 type Map = FixedBitSet;
1792 fn visit_map(&self) -> FixedBitSet { in visit_map() argument
1793 FixedBitSet::with_capacity(self.node_bound()) in visit_map()
/external/rust/android-crates-io/crates/petgraph/src/graph_impl/
Dmod.rs10 use fixedbitset::FixedBitSet;
2142 type Map = FixedBitSet;
2143 fn visit_map(&self) -> FixedBitSet { in visit_map() argument
2144 FixedBitSet::with_capacity(self.node_count()) in visit_map()
/external/rust/android-crates-io/crates/petgraph/
DRELEASES.rst177 - Add ``FilterNode`` implementation for ``FixedBitSet`` and ``HashSet``.