{"id":25732380,"url":"https://github.com/howprogrammingworks/linkedlist","last_synced_at":"2025-05-07T18:52:07.917Z","repository":{"id":46625144,"uuid":"70534310","full_name":"HowProgrammingWorks/LinkedList","owner":"HowProgrammingWorks","description":"Linked list data structure","archived":false,"fork":false,"pushed_at":"2025-04-09T03:59:21.000Z","size":22,"stargazers_count":12,"open_issues_count":16,"forks_count":37,"subscribers_count":20,"default_branch":"master","last_synced_at":"2025-04-09T04:28:44.646Z","etag":null,"topics":["haskell","javascript","js","node","nodejs"],"latest_commit_sha":null,"homepage":"https://www.youtube.com/TimurShemsedinov","language":"Haskell","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/HowProgrammingWorks.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}},"created_at":"2016-10-10T22:32:32.000Z","updated_at":"2025-04-09T03:59:25.000Z","dependencies_parsed_at":"2023-02-15T12:00:54.507Z","dependency_job_id":null,"html_url":"https://github.com/HowProgrammingWorks/LinkedList","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HowProgrammingWorks%2FLinkedList","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HowProgrammingWorks%2FLinkedList/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HowProgrammingWorks%2FLinkedList/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HowProgrammingWorks%2FLinkedList/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/HowProgrammingWorks","download_url":"https://codeload.github.com/HowProgrammingWorks/LinkedList/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":252939352,"owners_count":21828749,"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","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":["haskell","javascript","js","node","nodejs"],"created_at":"2025-02-26T03:40:46.854Z","updated_at":"2025-05-07T18:52:07.881Z","avatar_url":"https://github.com/HowProgrammingWorks.png","language":"Haskell","readme":"# Linked list data structure\n\n[![Структуры данных: списки, стек, очередь, дэк](https://img.youtube.com/vi/9KvA4hDDSjk/0.jpg)](https://www.youtube.com/watch?v=9KvA4hDDSjk)\n\nЗадания (на выбор):\n- Реализовать двусвязный список на классах\n- Реализовать двусвязный список на замыканиях\n- Реализовать двусвязный список на фабриках\n- Добавить к двусвязному списку протокол iterable\n  - см. про `next()` и [`Symbol.iterator`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols)\n- Сделать методы для обхода списка\n  - `.insert(index, data)`\n  - `.delete(index, [count])`\n  - `.append(data)`\n  - `.prepend(data)`\n  - `.clone():list`\n  - `.compare(list):Boolean`\n- Сделать методы, аналогичные методам массива\n  - `.find(item =\u003e expression:Boolean):data`\n  - `.filter(item =\u003e expression:Boolean):list`\n  - `.indexOf(data):Number`\n  - `.includes(data):Boolean`\n  - `.map(item =\u003e f(item)):list`\n  - другие методы\n- Декларативные аналоги\n  - аналог find: `.search(field, value):data`\n  - аналог filter: `.select({ field1: value1, field2: value2 }):list`\n  - алалог sort: `.order('field2'):list`\n- Асинхронные аналоги\n  - `.find(item =\u003e expression:Boolean, data =\u003e {})`\n  - `.filter(item =\u003e expression:Boolean, data:list =\u003e {})`\n  - другие методы с колбеками, аналоги на Promise\n- Реализовать циклический список\n  - Выполнить перечисленное выше для циклического списка\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhowprogrammingworks%2Flinkedlist","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhowprogrammingworks%2Flinkedlist","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhowprogrammingworks%2Flinkedlist/lists"}