| /wasmtime-44.0.1/crates/environ/examples/ |
| H A D | btrees.rs | 7 type Key = [u128; 2]; typedef
11 fn insert(&mut self, key: Key, value: Value) -> Result<()>; in insert() argument
14 impl Map for BTreeMap<Key, Value> {
15 fn insert(&mut self, key: Key, value: Value) -> Result<()> { in insert() argument
21 impl Map for collections::TryBTreeMap<Key, Value> {
22 fn insert(&mut self, key: Key, value: Value) -> Result<()> { in insert() argument
|
| /wasmtime-44.0.1/crates/fuzzing/tests/oom/ |
| H A D | secondary_map.rs | 1 use super::Key;
9 let _map = SecondaryMap::<Key, u32>::try_with_capacity(32)?; in secondary_map_try_with_capacity()
17 let mut map = SecondaryMap::<Key, u32>::new(); in secondary_map_try_resize()
26 let mut map = SecondaryMap::<Key, u32>::new(); in secondary_map_try_insert()
27 map.try_insert(Key::from_u32(42), 100)?; in secondary_map_try_insert()
|
| H A D | entity_set.rs | 1 use super::Key;
9 let mut set = TryEntitySet::<Key>::new(); in try_entity_set_ensure_capacity()
18 let mut set = TryEntitySet::<Key>::new(); in try_entity_set_insert()
19 set.insert(Key::from_u32(256))?; in try_entity_set_insert()
|
| H A D | primary_map.rs | 1 use super::Key;
9 let _map = PrimaryMap::<Key, u32>::try_with_capacity(32)?; in primary_map_try_with_capacity()
17 let mut map = PrimaryMap::<Key, u32>::new(); in primary_map_try_reserve()
26 let mut map = PrimaryMap::<Key, u32>::new(); in primary_map_try_reserve_exact()
|
| H A D | bforest_set.rs | 1 use super::Key;
12 set.try_insert(Key(i), &mut forest, &())?; in bforest_set()
15 assert!(set.contains(Key(i), &forest, &())); in bforest_set()
|
| H A D | bforest_map.rs | 1 use super::Key;
12 map.try_insert(Key(i), i, &mut forest, &())?; in bforest_map()
15 assert_eq!(map.get(Key(i), &forest, &()), Some(i)); in bforest_map()
|
| H A D | main.rs | 43 struct Key(u32); struct
44 wasmtime_environ::entity_impl!(Key);
|
| /wasmtime-44.0.1/cranelift/codegen/src/ |
| H A D | ctxhash.rs | 187 struct Key { struct
193 impl CtxEq<Key, Key> for Ctx {
194 fn ctx_eq(&self, a: &Key, b: &Key) -> bool { in ctx_eq() argument
198 impl CtxHash<Key> for Ctx {
199 fn ctx_hash<H: Hasher>(&self, state: &mut H, value: &Key) { in ctx_hash() argument
210 let k0 = Key { index: 0 }; in test_basic()
211 let k1 = Key { index: 1 }; in test_basic()
212 let k2 = Key { index: 2 }; in test_basic()
218 let mut map: CtxHashMap<Key, u64> = CtxHashMap::with_capacity(4); in test_basic()
|
| /wasmtime-44.0.1/cranelift/bforest/src/ |
| H A D | node.rs | 26 keys: [F::Key; INNER_SIZE - 1],
76 pub fn inner(left: Node, key: F::Key, right: Node) -> Self { in inner() argument
89 pub fn leaf(key: F::Key, value: F::Value) -> Self { in leaf() argument
98 pub fn unwrap_inner(&self) -> (&[F::Key], &[Node]) { in unwrap_inner() argument
115 pub fn unwrap_leaf(&self) -> (&[F::Key], &[F::Value]) { in unwrap_leaf() argument
154 pub fn leaf_crit_key(&self) -> F::Key { in leaf_crit_key() argument
363 pub fn balance(&mut self, crit_key: F::Key, rhs: &mut Self) -> Option<F::Key> { in balance() argument
495 pub crit_key: F::Key,
556 F::Key: fmt::Display,
594 type Key = char; typedef
[all …]
|
| H A D | path.rs | 50 key: F::Key, in find() argument
53 comp: &dyn Comparator<F::Key>, in find() argument
92 pub fn first(&mut self, root: Node, pool: &NodePool<F>) -> (F::Key, F::Value) { in first() argument
108 pub fn next(&mut self, pool: &NodePool<F>) -> Option<(F::Key, F::Value)> { in next() argument
133 pub fn prev(&mut self, root: Node, pool: &NodePool<F>) -> Option<(F::Key, F::Value)> { in prev() argument
266 key: F::Key, in insert() argument
293 mut key: F::Key, in split_and_insert() argument
399 fn current_crit_key(&self, level: usize, pool: &NodePool<F>) -> Option<F::Key> { in current_crit_key() argument
516 let new_ck: Option<F::Key>; in underflowed_node()
730 type Key = i32; typedef
[all …]
|
| H A D | lib.rs | 88 type Key: Copy; typedef
94 type LeafKeys: Copy + BorrowMut<[Self::Key]>;
100 fn splat_key(key: Self::Key) -> Self::LeafKeys; in splat_key()
|
| H A D | pool.rs | 82 pub fn verify_tree<C: Comparator<F::Key>>(&self, node: Node, comp: &C) in verify_tree()
85 F::Key: fmt::Display, in verify_tree()
|
| H A D | set.rs | 19 type Key = K; typedef
24 fn splat_key(key: Self::Key) -> Self::LeafKeys { in splat_key()
|
| H A D | map.rs | 24 type Key = K; typedef
29 fn splat_key(key: Self::Key) -> Self::LeafKeys { in splat_key()
|
| /wasmtime-44.0.1/crates/environ/src/component/ |
| H A D | names.rs | 66 I: NameMapIntern<Key = K>, in insert() argument
107 I: NameMapIntern<Key = K>, in get() argument
159 type Key; typedef
162 fn intern(&mut self, s: &str) -> Self::Key; in intern() argument
166 fn lookup(&self, s: &str) -> Option<Self::Key>; in lookup() argument
174 type Key = String; typedef
|
| /wasmtime-44.0.1/crates/wasmtime/src/runtime/component/ |
| H A D | linker.rs | 839 type Key = usize; typedef
|
| /wasmtime-44.0.1/crates/wasi/witx/p1/ |
| H A D | wasi_snapshot_preview1.witx | 32 ;;; Key/value pairs are expected to be joined with `=`s, and terminated with `\0`s.
|
| /wasmtime-44.0.1/crates/wasi/witx/p0/ |
| H A D | wasi_unstable.witx | 35 ;;; Key/value pairs are expected to be joined with `=`s, and terminated with `\0`s.
|
| /wasmtime-44.0.1/crates/wasi-common/witx/preview1/ |
| H A D | wasi_snapshot_preview1.witx | 32 ;;; Key/value pairs are expected to be joined with `=`s, and terminated with `\0`s.
|
| /wasmtime-44.0.1/crates/wasi-common/witx/preview0/ |
| H A D | wasi_unstable.witx | 35 ;;; Key/value pairs are expected to be joined with `=`s, and terminated with `\0`s.
|
| /wasmtime-44.0.1/docs/js/ |
| H A D | mermaid.min.11.6.0.js | 801 ….Constant=14,t.String=15,t.Number=16,t.Boolean=17,t.Array=18,t.Object=19,t.Key=20,t.Null=21,t.Enum…
|