Search by name, SuiNS, address, digest, object ID, coin type or checkpoint.

API

linked_table

Module0x268b…288c
Move path
0x268b…288c::linked_table
Functions
2121 public, 0 entry
Structs
2
Friend modules
None
linked_table

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,
head: Option<T0>,
tail: Option<T0>,
size: u64,
}
struct Node<T0: copy + drop + store, T1: store> has store {
prev: Option<T0>,
next: Option<T0>,
value: T1,
}
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 borrow_mut_node<T0: copy + drop + store, T1: store>(&mut LinkedTable<T0, T1>,T0): &mut Node<T0, T1>
public fun borrow_mut_value<T0: copy + drop + store, T1: store>(&mut Node<T0, T1>): &mut T1
public fun borrow_node<T0: copy + drop + store, T1: store>(&LinkedTable<T0, T1>,T0): &Node<T0, T1>
public fun borrow_value<T0: copy + drop + store, T1: store>(&Node<T0, T1>): &T1
public fun contains<T0: copy + drop + store, T1: store>(&LinkedTable<T0, T1>,T0): bool
public fun destroy_empty<T0: copy + drop + store, T1: drop + store>(LinkedTable<T0, T1>)
public fun drop<T0: copy + drop + store, T1: store>(LinkedTable<T0, T1>)
public fun head<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>(&Node<T0, T1>): Option<T0>
public fun prev<T0: copy + drop + store, T1: store>(&Node<T0, T1>): 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
public fun tail<T0: copy + drop + store, T1: store>(&LinkedTable<T0, T1>): Option<T0>