Skip to content

Latest commit

 

History

History
51 lines (50 loc) · 3.38 KB

index.md

File metadata and controls

51 lines (50 loc) · 3.38 KB
Raw

Index

  • Array Provides extended utility functions on Arrays.
  • AssocList Map implemented as a linked-list of key-value pairs ("Associations").
  • Blob Module for working with Blobs: immutable sequence of bytes.
  • Bool Boolean type and operations.
  • Buffer Class Buffer<X> provides a mutable list of elements of type X.
  • CertifiedData Certified data.
  • Char Characters
  • Debug Utility functions for debugging.
  • Deque Double-ended queue (deque) of a generic element type T.
  • Error Error values and inspection.
  • ExperimentalCycles Managing cycles within actors on the Internet Computer (IC).
  • ExperimentalInternetComputer Low-level interface to the Internet Computer.
  • ExperimentalStableMemory Byte-level access to (virtual) stable memory.
  • Float Double precision (64-bit) floating-point numbers in IEEE 754 representation.
  • Func Functions on functions, creating functions from simpler inputs.
  • Hash Hash values
  • HashMap Class HashMap<K, V> provides a hashmap from keys of type K to values of type V.
  • Heap Class Heap<X> provides a priority queue of elements of type X.
  • Int Signed integer numbers with infinite precision (also called big integers).
  • Int16 Provides utility functions on 16-bit signed integers.
  • Int32 Provides utility functions on 32-bit signed integers.
  • Int64 Provides utility functions on 64-bit signed integers.
  • Int8 Provides utility functions on 8-bit signed integers.
  • Iter Iterators
  • IterType The Iterator type
  • List Purely-functional, singly-linked lists.
  • Nat Natural numbers with infinite precision.
  • Nat16 Provides utility functions on 16-bit unsigned integers.
  • Nat32 Provides utility functions on 32-bit unsigned integers.
  • Nat64 Provides utility functions on 64-bit unsigned integers.
  • Nat8 Provides utility functions on 8-bit unsigned integers.
  • None The absent value
  • Option Typesafe nulls
  • Order Order
  • OrderedMap Stable key-value map implemented as a red-black tree with nodes storing key-value pairs.
  • OrderedSet Stable ordered set implemented as a red-black tree.
  • Prelude General utilities
  • Principal Module for interacting with Principals (users and canisters).
  • RBTree Key-value map implemented as a red-black tree (RBTree) with nodes storing key-value pairs.
  • Random A module for obtaining randomness on the Internet Computer (IC).
  • Region Byte-level access to isolated, (virtual) stable memory regions.
  • Result Error handling with the Result type.
  • Stack Class Stack<X> provides a Minimal LIFO stack of elements of type X.
  • Text Utility functions for Text values.
  • Time System time
  • Timer Timers for one-off or periodic tasks.
  • Trie Functional key-value hash maps.
  • TrieMap Class TrieMap<K, V> provides a map from keys of type K to values of type V.
  • TrieSet Functional set