Key | Value |
---|---|
FileName | ./usr/share/gocode/src/github.com/bits-and-blooms/bitset/go.mod |
FileSize | 50 |
MD5 | 31BD43E8B31B4D16831A8F6CC304B313 |
SHA-1 | B8B5AEAD4FDDFDBFC991928DD742ACED6336275C |
SHA-256 | 631121BE8A5077425277B170E82D52D4EB0CCE8AC0754FBBFACCA5F5CBE90438 |
SSDEEP | 3:3BAd3QPiB6EKYchLRvn:xAaaB/ULRv |
TLSH | T1D09002424204354B2E45054CDEAA16134BF511859101E5CC926A45D0411941A068F015 |
hashlookup:parent-total | 1 |
hashlookup:trust | 55 |
The searched file hash is included in 1 parent files which include package known and seen by metalookup. A sample is included below:
Key | Value |
---|---|
FileSize | 17020 |
MD5 | 75EC69E9D2DA298FB73EF98C1660348D |
PackageDescription | implementation of bitsets This package implements bitsets, a mapping between non-negative integers and boolean values. It should be more efficient than map[uint] bool. . It provides methods for setting, clearing, flipping, and testing individual integers. . But it also provides set intersection, union, difference, complement, and symmetric operations, as well as tests to check whether any, all, or no bits are set, and querying a bitset's current length and number of positive bits. . BitSets are expanded to the size of the largest set bit; the memory allocation is approximately Max bits, where Max is the largest set bit. BitSets are never shrunk. On creation, a hint can be given for the number of bits that will be used. . Many of the methods, including Set, Clear, and Flip, return a BitSet pointer, which allows for chaining. |
PackageMaintainer | Debian Go Packaging Team <team+pkg-go@tracker.debian.org> |
PackageName | golang-github-bits-and-blooms-bitset-dev |
PackageSection | golang |
PackageVersion | 1.2.0-2 |
SHA-1 | 50A0BC6E57C6764FC05AE16719E96868F0ABD5B2 |
SHA-256 | 7A45286116024EF0C85113C2FF61E57E733FC3B635D276C778CE84C0D1233E56 |