Key | Value |
---|---|
FileName | ./usr/bin/qhalf |
FileSize | 22476 |
MD5 | 6F14156D4C3CFBA0FCB97C181BA0094B |
SHA-1 | 2E0C575172AED92EAA35D05740820773CA57999B |
SHA-256 | 6BA3817E7A38165C79368D349EE2ECE8EE3C0FDF18CCBC4F93CC568CC50EAFBF |
SSDEEP | 384:fkF0Ems35kqdDSHcUldktpLHJzeaahNRPnc8R:8B3PhSHcUopNzedvk |
TLSH | T151A2C4EB7281D9BAC1931334525713599230E123F6887E5374EC466C2F83798A27B7AD |
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 |
---|---|
MD5 | B13BFFDA6298BCEC39F1E4A9B1D099BF |
PackageArch | i586 |
PackageDescription | Qhull computes convex hulls, Delaunay triangulations, halfspace intersections about a point, Voronoi diagrams, furthest-site Delaunay triangulations, and furthest-site Voronoi diagrams. It runs in 2-d, 3-d, 4-d, and higher dimensions. It implements the Quickhull algorithm for computing the convex hull. Qhull handles roundoff errors from floating point arithmetic. It can approximate a convex hull. |
PackageMaintainer | ghibo <ghibo> |
PackageName | qhull |
PackageRelease | 6.mga9 |
PackageVersion | 2020.2 |
SHA-1 | 460EE3EF2B8F98308703830C58BAC01A55132315 |
SHA-256 | D4CAF69F73BAA0AAD71BA39FABC58E9CCF21C1B61977C67745F1262E2FA94D6B |