Key | Value |
---|---|
FileName | ./usr/share/doc/libbtf1/changelog.Debian.gz |
FileSize | 1304 |
MD5 | 79291477C16E251E69A89C715D9D640E |
SHA-1 | 5A19716F572EE063B4D016733166AF531C38679D |
SHA-256 | A418E1498C727A204D5F0F33FCA0922960AA0AD472B8B316FE44D685CF8393E8 |
SHA-512 | 11677DBD7B10D1C99A91E09EBD6604A8CB19B15510EF94CB47E8956B32EBAD0A62E7DA8FA408D6BE623D706B39C3640E9FDF6A645EDC20744715978AC0D92E60 |
SSDEEP | 24:X5zkUNiidyTekuUNY6QM3ZCGlVSxNJUAp8iJ7qaytGTzDWaS4MdyOs3//:Xy9idsekFRQ0CyV4P7qay0z6asAD3X |
TLSH | T19C21C8CD70CF949E7E7E88ED89B26109672F8005477C616DF52F6A56DC50C82E34E2C8 |
insert-timestamp | 1728237157.0298028 |
mimetype | application/gzip |
source | snap:LJzR5xevdtU54wLeciVWXdhlKy1L4TrX_3 |
hashlookup:parent-total | 2 |
hashlookup:trust | 60 |
The searched file hash is included in 2 parent files which include package known and seen by metalookup. A sample is included below:
Key | Value |
---|---|
SHA-1 | 0844DA217E72796226B9BB33AFA548B945A5701B |
snap-authority | canonical |
snap-filename | LJzR5xevdtU54wLeciVWXdhlKy1L4TrX_3.snap |
snap-id | LJzR5xevdtU54wLeciVWXdhlKy1L4TrX_3 |
snap-name | turtlebot3c-nav |
snap-publisher-id | canonical-robotics |
snap-signkey | BWDEoaqyr25nF5SNCvEv2v7QnM9QsfCc0PBMYD_i2NGSQ32EF2d4D0hqUel3m8ul |
snap-timestamp | 2024-02-29T15:21:40.977803Z |
source-url | https://api.snapcraft.io/api/v1/snaps/download/LJzR5xevdtU54wLeciVWXdhlKy1L4TrX_3.snap |
Key | Value |
---|---|
FileSize | 11288 |
MD5 | 7CFC763CC46550381EAAE33B86F56CC8 |
PackageDescription | permutation to block triangular form library for sparse matrices Suitesparse is a collection of libraries for computations involving sparse matrices. . The BTF library is a software package for permuting a matrix into Block upper Triangular Form. It includes a maximum transversal algorithm, which finds a permutation of a square or rectangular matrix so that it has a zero-free diagonal (if one exists); otherwise, it finds a maximal matching which maximizes the number of nonzeros on the diagonal. The package also includes a method for finding the strongly connected components of a graph. These two methods together give the permutation to block upper triangular form. |
PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | libbtf1 |
PackageSection | libs |
PackageVersion | 1:5.7.1+dfsg-2 |
SHA-1 | 1E66A1E75E89DDC38E4F07C58E8DDA49EF5BB73E |
SHA-256 | E8A6B4730AAF09BE3221B69FB494E6EDBC5F5B8221104D0D8775B1E57F726153 |