Crate wtools 

wTools — single entry-point for collection utilities. Re-exports collection_tools.

Module :: wtools

Single entry-point for collection utilities. Re-exports collection_tools: variadic constructors (hmap!, vec!, hset!, …) and unified HashMap/HashSet/Vec support with optional no_std/hashbrown backend.

To add to your project

cargo add wtools

Try out from the repository

git clone https://github.com/Wandalen/wTools
cd wTools
cargo run --example wtools_trivial

Modules

collection

Module containing all collection macros

dependency

Namespace with dependencies.

exposed

Exposed namespace of the module.

orphan

Parented namespace of the module.

own

Own namespace of the module.

prelude

Prelude to use essentials: use my_module::prelude::*.

Macros

bmap

Creates a BTreeMap from a list of key-value pairs.

bset

Creates a BTreeSet from a list of elements.

deque

Creates a VecDeque from a list of elements.

dlist

Creates a Vec from a list of elements.

heap

Creates a BinaryHeap from a list of elements.

hmap

Creates a HashMap from a list of key-value pairs.

hset

Creates a HashSet from a list of elements.

into_bmap

Creates a BTreeMap from a list of key-value pairs.

into_bset

Creates a BTreeSet from a list of elements.

into_dlist

Creates a Vec from a list of elements.

into_heap

Creates a BinaryHeap from a list of elements.

into_hmap

Creates a HashMap from a list of key-value pairs.

into_hset

Creates a HashSet from a list of elements.

into_llist

Creates a LinkedList from a linked list of elements.

into_vec

Creates a Vec from a list of elements.

into_vecd

Creates a VecDeque from a list of elements.

llist

Creates a LinkedList from a linked list of elements.

vec

Creates a Vec from a list of elements.

Structs

BTreeMap

An ordered map based on a B-Tree.

BTreeSet

An ordered set based on a B-Tree.

BinaryHeap

A priority queue implemented with a binary heap.

Bmap

An ordered map based on a B-Tree.

Bset

An ordered set based on a B-Tree.

Deque

A double-ended queue implemented with a growable ring buffer.

Dlist

A contiguous growable array type, written as Vec<T>, short for ‘vector’.

HashMap

A hash map implemented with quadratic probing and SIMD lookup.

HashSet

A hash set implemented as a HashMap where the value is ().

Hmap

A hash map implemented with quadratic probing and SIMD lookup.

Hset

A hash set implemented as a HashMap where the value is ().

LinkedList

A doubly-linked list with owned nodes.

Llist

A doubly-linked list with owned nodes.

Map

A hash map implemented with quadratic probing and SIMD lookup.

Set

A hash set implemented as a HashMap where the value is ().

Vec

A contiguous growable array type, written as Vec<T>, short for ‘vector’.

VecDeque

A double-ended queue implemented with a growable ring buffer.