linked_table

Module0x253b…bb4a

Move path: 0x253b…bb4a::linked_table
Functions: 2121 public, 0 entry
Structs: 2
Friend modules: None

linked_table

Functions21

borrowBytecode
public fun borrow<T0: copy + drop + store, T1: store>(&LinkedTable<T0, T1>,T0): &T1
borrow_mutBytecode
public fun borrow_mut<T0: copy + drop + store, T1: store>(&mut LinkedTable<T0, T1>,T0): &mut T1
borrow_mut_nodeBytecode
public fun borrow_mut_node<T0: copy + drop + store, T1: store>(&mut LinkedTable<T0, T1>,T0): &mut Node<T0, T1>
borrow_mut_valueBytecode
public fun borrow_mut_value<T0: copy + drop + store, T1: store>(&mut Node<T0, T1>): &mut T1
borrow_nodeBytecode
public fun borrow_node<T0: copy + drop + store, T1: store>(&LinkedTable<T0, T1>,T0): &Node<T0, T1>
borrow_valueBytecode
public fun borrow_value<T0: copy + drop + store, T1: store>(&Node<T0, T1>): &T1
containsBytecode
public fun contains<T0: copy + drop + store, T1: store>(&LinkedTable<T0, T1>,T0): bool
destroy_emptyBytecode
public fun destroy_empty<T0: copy + drop + store, T1: drop + store>(LinkedTable<T0, T1>)
dropBytecode
public fun drop<T0: copy + drop + store, T1: store>(LinkedTable<T0, T1>)
headBytecode
public fun head<T0: copy + drop + store, T1: store>(&LinkedTable<T0, T1>): Option<T0>
insert_afterBytecode
public fun insert_after<T0: copy + drop + store, T1: store>(&mut LinkedTable<T0, T1>,T0,T0,T1)
insert_beforeBytecode
public fun insert_before<T0: copy + drop + store, T1: store>(&mut LinkedTable<T0, T1>,T0,T0,T1)
is_emptyBytecode
public fun is_empty<T0: copy + drop + store, T1: store>(&LinkedTable<T0, T1>): bool
lengthBytecode
public fun length<T0: copy + drop + store, T1: store>(&LinkedTable<T0, T1>): u64
newBytecode
public fun new<T0: copy + drop + store, T1: store>(): LinkedTable<T0, T1>
nextBytecode
public fun next<T0: copy + drop + store, T1: store>(&Node<T0, T1>): Option<T0>
prevBytecode
public fun prev<T0: copy + drop + store, T1: store>(&Node<T0, T1>): Option<T0>
push_backBytecode
public fun push_back<T0: copy + drop + store, T1: store>(&mut LinkedTable<T0, T1>,T0,T1)
push_frontBytecode
public fun push_front<T0: copy + drop + store, T1: store>(&mut LinkedTable<T0, T1>,T0,T1)
removeBytecode
public fun remove<T0: copy + drop + store, T1: store>(&mut LinkedTable<T0, T1>,T0): T1
tailBytecode
public fun tail<T0: copy + drop + store, T1: store>(&LinkedTable<T0, T1>): Option<T0>

Structs2

key is an object with an id. store can be kept inside other objects. copy can be duplicated. drop can be thrown away.

LinkedTable<T0: copy + drop + store, phantom T1: store>storekey
id UID
head Option<T0>
tail Option<T0>
size u64
Node<T0: copy + drop + store, T1: store>store
prev Option<T0>
next Option<T0>
value T1

id	UID
head	Option<T0>
tail	Option<T0>
size	u64

prev	Option<T0>
next	Option<T0>
value	T1

Constants0

No constants are used by this module's code