Libft

Implementation of standard functions

The first 42 project.

Data structures

Primary

• __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

  Secondary

• __ft_stack__ : A dequeue wrapper
• __ft_string__ : A vector of char
• __ft_heap__ : A priority queue implementation

Functions

• __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