{"id":16729684,"url":"https://github.com/nlw0/chipsort.jl","last_synced_at":"2026-01-02T21:45:49.452Z","repository":{"id":46617946,"uuid":"170022251","full_name":"nlw0/ChipSort.jl","owner":"nlw0","description":"Sorting deeds done down the chip","archived":false,"fork":false,"pushed_at":"2023-08-15T16:19:05.000Z","size":693,"stargazers_count":23,"open_issues_count":3,"forks_count":2,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-10T22:43:56.513Z","etag":null,"topics":["cache-aware","meta-programming","simd","sorting"],"latest_commit_sha":null,"homepage":"","language":"Julia","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/nlw0.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":"2019-02-10T20:17:57.000Z","updated_at":"2024-02-27T15:35:27.000Z","dependencies_parsed_at":"2022-09-22T22:00:41.899Z","dependency_job_id":null,"html_url":"https://github.com/nlw0/ChipSort.jl","commit_stats":null,"previous_names":[],"tags_count":2,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nlw0%2FChipSort.jl","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nlw0%2FChipSort.jl/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nlw0%2FChipSort.jl/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nlw0%2FChipSort.jl/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/nlw0","download_url":"https://codeload.github.com/nlw0/ChipSort.jl/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243762947,"owners_count":20344129,"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":["cache-aware","meta-programming","simd","sorting"],"created_at":"2024-10-12T23:29:27.535Z","updated_at":"2026-01-02T21:45:49.387Z","avatar_url":"https://github.com/nlw0.png","language":"Julia","readme":"# ChipSort.jl\n\n\u003cp align=\"center\"\u003e\n  \u003cimg src=\"docs/src/assets/logo.png\" width=\"50%\" title=\"ChipSort logo\"\u003e\n\u003c/p\u003e\n\nChipSort is a sorting module containing SIMD and cache-aware techniques. It's based on a couple of academic papers from 2008. More details can be found in [our documentation](https://nlw0.github.io/ChipSort.jl).\n\n[![docs](https://img.shields.io/badge/docs-dev-blue.svg)](https://nlw0.github.io/ChipSort.jl/dev)\n[![Build Status](https://app.travis-ci.com/nlw0/ChipSort.jl.svg?branch=master)](https://app.travis-ci.com/nlw0/ChipSort.jl)\n[![codecov](https://codecov.io/gh/nlw0/ChipSort.jl/branch/master/graph/badge.svg)](https://codecov.io/gh/nlw0/ChipSort.jl)\n[![DOI](https://zenodo.org/badge/170022251.svg)](https://zenodo.org/badge/latestdoi/170022251)\n\n## Installation and usage\n\nLike any experimental Julia package on GitHub you can install ChipSort from the Julia REPL by first typing `]` to enter the package management prompt, and then\n\n```\npkg\u003e add https://github.com/nlw0/ChipSort.jl\n```\n\nYou can now try out the basic functions offered by the package such as `sort_net` to use a sorting network, or try the full array sort function prototype `chipsort`.\n\n```\njulia\u003e using ChipSort\n\njulia\u003e using SIMD\n\njulia\u003e data = [Vec(tuple(rand(Int8, 4)...)) for _ in 1:4]\n4-element Array{Vec{4,Int8},1}:\n \u003c4 x Int8\u003e[-15, 98, 5, -28]\n \u003c4 x Int8\u003e[47, -112, 98, -14]\n \u003c4 x Int8\u003e[-18, -3, -111, 85]\n \u003c4 x Int8\u003e[79, -12, -44, -85]\n\njulia\u003e x = sort_net(data...)\n(\u003c4 x Int8\u003e[-18, -112, -111, -85], \u003c4 x Int8\u003e[-15, -12, -44, -28], \u003c4 x Int8\u003e[47, -3, 5, -14], \u003c4 x Int8\u003e[79, 98, 98, 85])\n\njulia\u003e y = transpose_vecs(x...)\n(\u003c4 x Int8\u003e[-18, -15, 47, 79], \u003c4 x Int8\u003e[-112, -12, -3, 98], \u003c4 x Int8\u003e[-111, -44, 5, 98], \u003c4 x Int8\u003e[-85, -28, -14, 85])\n\njulia\u003e z = merge_vecs(y...)\n\u003c16 x Int8\u003e[-112, -111, -85, -44, -28, -18, -15, -14, -12, -3, 5, 47, 79, 85, 98, 98]\n\njulia\u003e bigdata = rand(Int32, 2^20);\n\njulia\u003e chipsort_large(bigdata, Val(8), Val(32)) == sort(bigdata)\ntrue\n```\n\nMake sure you check [our documentation](https://nlw0.github.io/ChipSort.jl) for more information.\n\nLatest [benchmark](https://gist.github.com/nlw0/a4180e7d131bf127cd738f5ad2da284c) results are: 81% speedup on a 1M Int32 array, 2x speedup on 8k Int32 and 4x on 64 values.\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnlw0%2Fchipsort.jl","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fnlw0%2Fchipsort.jl","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnlw0%2Fchipsort.jl/lists"}