{"id":16893920,"url":"https://github.com/dimitrisjim/bit","last_synced_at":"2025-03-20T09:48:57.261Z","repository":{"id":52478700,"uuid":"334620759","full_name":"DimitrisJim/BIT","owner":"DimitrisJim","description":"Binary Indexed (Fenwick) Trees ","archived":false,"fork":false,"pushed_at":"2021-04-28T20:54:03.000Z","size":143,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-01-25T10:28:23.380Z","etag":null,"topics":["binary-indexed-tree","fenwick-trees"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"unlicense","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/DimitrisJim.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":"2021-01-31T09:44:53.000Z","updated_at":"2021-04-28T20:54:05.000Z","dependencies_parsed_at":"2022-09-12T02:01:41.115Z","dependency_job_id":null,"html_url":"https://github.com/DimitrisJim/BIT","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/DimitrisJim%2FBIT","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DimitrisJim%2FBIT/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DimitrisJim%2FBIT/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DimitrisJim%2FBIT/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/DimitrisJim","download_url":"https://codeload.github.com/DimitrisJim/BIT/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244591502,"owners_count":20477708,"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":["binary-indexed-tree","fenwick-trees"],"created_at":"2024-10-13T17:16:57.156Z","updated_at":"2025-03-20T09:48:57.242Z","avatar_url":"https://github.com/DimitrisJim.png","language":"Python","readme":"# BIT\n\nBinary Index Tree. WIP.\n\n## Operations:\n\nLink plots create from running `python stats`, describe why we see `O(N)` and `O(logN)` ops. TODO: Add these in docs somewhere.\n\n### Initialization:\n\n(or, `BIT.create`) O(N) Operation.\n\n##### Getting the original layout:\n\n##### Appending an item:\n\n##### Updating an items original value:\n\n##### Replacing an items original value:\n\n##### Getting an item (prefix sum):\n\n##### Popping an item:\n\n##### Range Sum\n\n### Plots:\n\nLinear complexity (create, layout)\n\n\u003cp align=\"middle\"\u003e\n  \u003cimg src=\"stats/plots/create.png\" width=\"400\" /\u003e\n  \u003cimg src=\"stats/plots/layout.png\" width=\"400\" /\u003e \n\u003c/p\u003e\n\nLogarithmic complexity (append, update, setitem, getitem)\n\n\u003cp align=\"middle\"\u003e\n  \u003cimg src=\"stats/plots/append.png\" width=\"300\" /\u003e\n  \u003cimg src=\"stats/plots/update.png\" width=\"300\" /\u003e\n  \u003cimg src=\"stats/plots/setitem.png\" width=\"300\" /\u003e\n  \u003cimg src=\"stats/plots/getitem.png\" width=\"300\" /\u003e \n\u003c/p\u003e\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdimitrisjim%2Fbit","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdimitrisjim%2Fbit","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdimitrisjim%2Fbit/lists"}