linked_table
Module0x0000…0002
- Move path
- 0x0000…0002::linked_table
- Functions
- 1919 public, 0 entry
- Structs
- 2
- Friend modules
- None
linked_table
- accumulator18
- accumulator_metadata2
- accumulator_settlement8
- address10
- address_alias5
- allowance40
- authenticator_state13
- bag10
- balance18
- bcs30
- bls1238143
- borrow4
- clock3
- coin54
- coin_registry43
- config11
- deny_list21
- derived_object3
- display14
- display_registry18
- dynamic_field19
- dynamic_object_field15
- ecdsa_k13
- ecdsa_r12
- ecvrf1
- ed255191
- event3
- forwarding_address1
- funds_accumulator12
- groth1610
- group_ops23
- hash2
- hex3
- hmac1
- kiosk41
- kiosk_extension14
- linked_table19
- math7
- nitro_attestation11
- object32
- object_bag11
- object_table10
- package26
- party5
- pay8
- poseidon2
- priority_queue8
- protocol_config1
- prover0
- random20
- rangeproofs3
- ristretto25518
- scratch18
- sui2
- table10
- table_vec12
- token45
- transfer16
- transfer_policy18
- tx_context19
- types1
- url4
- vdf4
- vec_map20
- vec_set11
- versioned7
- zklogin_verified_id9
- zklogin_verified_issuer6
Declarations
Rebuilt from the module interface. No verified source is published, and function bodies are only available as bytecode.
module linked_table;
struct LinkedTable<T0: copy + drop + store, phantom T1: store> has store, key {
id: UID,
size: u64,
head: Option<T0>,
tail: Option<T0>,
}
struct Node<T0: copy + drop + store, T1: store> has store {
prev: Option<T0>,
next: Option<T0>,
value: T1,
}
public fun back<T0: copy + drop + store, T1: store>(&LinkedTable<T0, T1>): &Option<T0>
public fun borrow<T0: copy + drop + store, T1: store>(&LinkedTable<T0, T1>,T0): &T1
public fun borrow_mut<T0: copy + drop + store, T1: store>(&mut LinkedTable<T0, T1>,T0): &mut T1
public fun contains<T0: copy + drop + store, T1: store>(&LinkedTable<T0, T1>,T0): bool
public fun destroy_empty<T0: copy + drop + store, T1: store>(LinkedTable<T0, T1>)
public fun drop<T0: copy + drop + store, T1: drop + store>(LinkedTable<T0, T1>)
public fun front<T0: copy + drop + store, T1: store>(&LinkedTable<T0, T1>): &Option<T0>
public fun insert_after<T0: copy + drop + store, T1: store>(&mut LinkedTable<T0, T1>,T0,T0,T1)
public fun insert_before<T0: copy + drop + store, T1: store>(&mut LinkedTable<T0, T1>,T0,T0,T1)
public fun is_empty<T0: copy + drop + store, T1: store>(&LinkedTable<T0, T1>): bool
public fun length<T0: copy + drop + store, T1: store>(&LinkedTable<T0, T1>): u64
public fun new<T0: copy + drop + store, T1: store>(): LinkedTable<T0, T1>
public fun next<T0: copy + drop + store, T1: store>(&LinkedTable<T0, T1>,T0): &Option<T0>
public fun pop_back<T0: copy + drop + store, T1: store>(&mut LinkedTable<T0, T1>): (T0, T1)
public fun pop_front<T0: copy + drop + store, T1: store>(&mut LinkedTable<T0, T1>): (T0, T1)
public fun prev<T0: copy + drop + store, T1: store>(&LinkedTable<T0, T1>,T0): &Option<T0>
public fun push_back<T0: copy + drop + store, T1: store>(&mut LinkedTable<T0, T1>,T0,T1)
public fun push_front<T0: copy + drop + store, T1: store>(&mut LinkedTable<T0, T1>,T0,T1)
public fun remove<T0: copy + drop + store, T1: store>(&mut LinkedTable<T0, T1>,T0): T1