linked_table

Module0x0000…0002

Move path: 0x0000…0002::linked_table
Functions: 1919 public, 0 entry
Structs: 2
Friend modules: None

linked_table

Functions19

backBytecode
public fun back<T0: copy + drop + store, T1: store>(&LinkedTable<T0, T1>): &Option<T0>
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
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: store>(LinkedTable<T0, T1>)
dropBytecode
public fun drop<T0: copy + drop + store, T1: drop + store>(LinkedTable<T0, T1>)
frontBytecode
public fun front<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>(&LinkedTable<T0, T1>,T0): &Option<T0>
pop_backBytecode
public fun pop_back<T0: copy + drop + store, T1: store>(&mut LinkedTable<T0, T1>): (T0, T1)
pop_frontBytecode
public fun pop_front<T0: copy + drop + store, T1: store>(&mut LinkedTable<T0, T1>): (T0, T1)
prevBytecode
public fun prev<T0: copy + drop + store, T1: store>(&LinkedTable<T0, T1>,T0): &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

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
size u64
head Option<T0>
tail Option<T0>
Node<T0: copy + drop + store, T1: store>store
prev Option<T0>
next Option<T0>
value T1

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

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

Constants2

Constants are shown the way the code loads them. Bytecode does not keep their names.

Index	Value	Type	Use	Used in
0	0	u64	Abort code	destroy_empty
1	1	u64	Abort code	pop_front pop_back