mirror of
https://github.com/vlang/v.git
synced 2025-09-13 14:32:26 +03:00
| .. | ||
| fsm | ||
| bloom_filter.v | ||
| bloom_filter_test.v | ||
| bstree.v | ||
| bstree_test.v | ||
| doubly_linked_list.v | ||
| doubly_linked_list_test.v | ||
| heap.v | ||
| heap_test.v | ||
| linked_list.v | ||
| linked_list_test.v | ||
| quadtree.v | ||
| quadtree_test.v | ||
| queue.v | ||
| queue_test.v | ||
| README.md | ||
| ringbuffer.v | ||
| ringbuffer_test.v | ||
| set.v | ||
| set_test.v | ||
| stack.v | ||
| stack_test.v | ||
datatypes
This module provides implementations of less frequently used, but still common data types.
V's builtin module is imported implicitly, and has implementations for arrays,
maps and strings. These are good for many applications, but there are a plethora
of other useful data structures/containers, like linked lists, priority queues,
trees, etc, that allow for algorithms with different time complexities, which may
be more suitable for your specific application.
It is implemented using generics, that you have to specialise for the type of your actual elements. For example:
import datatypes
mut stack := datatypes.Stack[int]{}
stack.push(1)
println(stack)
Currently Implemented Datatypes:
- Linked list
- Doubly linked list
- Stack (LIFO)
- Queue (FIFO)
- Min heap (priority queue)
- Set
- Quadtree
- Bloom filter
- ...