{"id":24125750,"url":"https://github.com/agagniere/libft","last_synced_at":"2025-08-01T20:04:41.551Z","repository":{"id":41850855,"uuid":"47677706","full_name":"agagniere/Libft","owner":"agagniere","description":"Implementation of standard functions","archived":false,"fork":false,"pushed_at":"2024-10-02T20:31:22.000Z","size":430,"stargazers_count":4,"open_issues_count":4,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-04-01T21:48:17.655Z","etag":null,"topics":["42","42born2code","42school","data-structures","reimplementation"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/agagniere.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2015-12-09T08:11:59.000Z","updated_at":"2024-10-02T20:31:27.000Z","dependencies_parsed_at":"2025-01-11T15:37:30.119Z","dependency_job_id":"fc6da826-56be-4bf1-a4e5-ae167fcbb64c","html_url":"https://github.com/agagniere/Libft","commit_stats":null,"previous_names":[],"tags_count":13,"template":false,"template_full_name":null,"purl":"pkg:github/agagniere/Libft","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/agagniere%2FLibft","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/agagniere%2FLibft/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/agagniere%2FLibft/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/agagniere%2FLibft/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/agagniere","download_url":"https://codeload.github.com/agagniere/Libft/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/agagniere%2FLibft/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":268290603,"owners_count":24226643,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-08-01T02:00:08.611Z","response_time":67,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["42","42born2code","42school","data-structures","reimplementation"],"created_at":"2025-01-11T15:37:19.349Z","updated_at":"2025-08-01T20:04:41.472Z","avatar_url":"https://github.com/agagniere.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Libft\nImplementation of standard functions\n\n![C/C++ CI](https://github.com/Xxdzs/Libft/workflows/C/C++%20CI/badge.svg?branch=master)\n----- -----\n\nThe first 42 project.\n\n# Data structures\n## Primary\n* __ft_array__ : C implementation of `std::vector`\n* __ft_bitset__ : Simplistic `std::bitset` implementation\n* __ft_deque__ : Double ended queue on a statically allocated space, made for realtime buffering\n* __ft_list__ : Doubly linked circular list, has similarities with the kernel list\n* __ft_tree__ : An implementation of a binary tree whose nodes are homogeneous in size\n* __ft_dict__ : `std::unordered_map\u003cstd::string, std::string\u003e` implementation\n## Secondary\n* __ft_stack__ : A dequeue wrapper\n* __ft_string__ : A vector of char\n* __ft_heap__ : A priority queue implementation\n\n# Functions\n* __ft_printf__ : printf implementation\n* __get_next_line__ : read a given file, line by line\n* __ft_print_memory__ : Print a dump of a memory section, in hex and ascii\n* __itoa_base__ : returns the representation in a given base of a integer\nAnd many others reimplementations of standard functions like `atoi`, `modf`, etc\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fagagniere%2Flibft","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fagagniere%2Flibft","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fagagniere%2Flibft/lists"}