Implementation of standard functions
The first 42 project.
- ft_array : C implementation of
std::vector
- ft_bitset : Simplistic
std::bitset
implementation - ft_deque : Double ended queue on a statically allocated space, made for realtime buffering
- ft_list : Doubly linked circular list, has similarities with the kernel list
- ft_tree : An implementation of a binary tree whose nodes are homogeneous in size
- ft_dict :
std::unordered_map<std::string, std::string>
implementation
- ft_stack : A dequeue wrapper
- ft_string : A vector of char
- ft_heap : A priority queue implementation
- ft_printf : printf implementation
- get_next_line : read a given file, line by line
- ft_print_memory : Print a dump of a memory section, in hex and ascii
- itoa_base : returns the representation in a given base of a integer
And many others reimplementations of standard functions like
atoi
,modf
, etc