- Move path
- 0x2d8a…f211::linked_table
- Functions
- 2121 public, 0 entry
- Structs
- 2
- Friend modules
- None
linked_table
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>
