{"@context":"https://w3id.org/codemeta/3.0","@type":"SoftwareSourceCode","identifier":"pkg:golang/github.com/yourbasic/bit","name":"github.com/yourbasic/bit","description":"Package bit provides a bit array implementation.\n\nA bit set, or bit array, is an efficient set data structure\nthat consists of an array of 64-bit words. Because it uses\nbit-level parallelism, limits memory access, and efficiently uses\nthe data cache, a bit set often outperforms other data structures.\n\nThe Basics example shows how to create, combine, compare and\nprint bit sets.\n\nPrimes contains a short and simple, but still efficient,\nimplementation of a prime number sieve.\n\nUnion is a more advanced example demonstrating how to build\nan efficient variadic Union function using the SetOr method.\n\nCreate, combine, compare and print bit sets.\n\n\nCreate the set of all primes less than n in O(n log log n) time.\nTry the code with n equal to a few hundred millions and be pleasantly surprised.\n\n\nImplement an efficient variadic Union function using SetOr.","version":"v0.0.0-20180313074424-45a4409f4082","softwareVersion":"v0.0.0-20180313074424-45a4409f4082","license":"https://spdx.org/licenses/BSD-2-Clause","codeRepository":"https://github.com/yourbasic/bit","issueTracker":"https://github.com/yourbasic/bit/issues","url":"https://github.com/yourbasic/bit","programmingLanguage":{"@type":"ComputerLanguage","name":"Go"},"dateCreated":"2018-03-13","dateModified":"2018-03-13","datePublished":"2018-03-13","copyrightYear":2018,"downloadUrl":"https://proxy.golang.org/github.com/yourbasic/bit/@v/v0.0.0-20180313074424-45a4409f4082.zip","softwareHelp":{"@type":"WebSite","url":"https://pkg.go.dev/github.com/yourbasic/bit#section-documentation"},"applicationCategory":"go","runtimePlatform":"go","developmentStatus":"active","sameAs":["https://pkg.go.dev/github.com/yourbasic/bit"],"https://www.w3.org/ns/activitystreams#likes":141,"https://forgefed.org/ns#forks":25}