Package libkgraph: Specfile
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 | %define _unpackaged_files_terminate_build 1 %define origname KGraph %define pkgname kgraph %define pypiname %pkgname Name: lib%{pkgname} Version: 0.1 Release: alt0.git2143fd6.2 Summary: A library for k-nearest neighbor search License: BSD-2-Clause Group: Sciences/Mathematics Url: https://github.com/aaalgo/kgraph Vcs: https://github.com/aaalgo/kgraph.git ExclusiveArch: aarch64 %ix86 x86_64 Source: %name-%version.tar Patch: %name-%version-%release.patch BuildRequires(pre): rpm-macros-cmake BuildRequires: cmake BuildRequires: gcc-c++ BuildRequires: libgomp-devel BuildRequires: boost-devel BuildRequires: boost-program_options-devel #BuildRequires: xsimd-devel BuildRequires(pre): rpm-build-pyproject BuildRequires: python3(wheel) BuildRequires: python3(numpy) BuildRequires: libnumpy-py3-devel BuildRequires: libopenblas-devel %description KGraph: A Library for Approximate Nearest Neighbor Search. KGraph is a library for k-nearest neighbor (k-NN) graph construction and online k-NN search using a k-NN Graph as index. KGraph implements heuristic algorithms that are extremely generic and fast: * KGraph works on abstract objects. The only assumption it makes is that a similarity score can be computed on any pair of objects, with a user-provided function. * KGraph is among the fastest of libraries for k-NN search according to recent benchmark. For best generality, the C++ API should be used. A python wrapper is provided under the module name kgraph, which supports Euclidean and Angular distances on rows of NumPy matrices. %package devel Group: Development/C++ Summary: A library for k-nearest neighbor search development files. %description devel A library for k-nearest neighbor search development files. KGraph: A Library for Approximate Nearest Neighbor Search. KGraph is a library for k-nearest neighbor (k-NN) graph construction and online k-NN search using a k-NN Graph as index. KGraph implements heuristic algorithms that are extremely generic and fast: * KGraph works on abstract objects. The only assumption it makes is that a similarity score can be computed on any pair of objects, with a user-provided function. * KGraph is among the fastest of libraries for k-NN search according to recent benchmark. For best generality, the C++ API should be used. A python wrapper is provided under the module name kgraph, which supports Euclidean and Angular distances on rows of NumPy matrices. %package devel-static Group: Development/C++ Summary: A library for k-nearest neighbor search static files. %description devel-static A library for k-nearest neighbor search static files. KGraph: A Library for Approximate Nearest Neighbor Search. KGraph is a library for k-nearest neighbor (k-NN) graph construction and online k-NN search using a k-NN Graph as index. KGraph implements heuristic algorithms that are extremely generic and fast: * KGraph works on abstract objects. The only assumption it makes is that a similarity score can be computed on any pair of objects, with a user-provided function. * KGraph is among the fastest of libraries for k-NN search according to recent benchmark. For best generality, the C++ API should be used. A python wrapper is provided under the module name kgraph, which supports Euclidean and Angular distances on rows of NumPy matrices. %package -n python3-module-%pypiname Summary: Python interface to kgraph Group: Development/Python3 %description -n python3-module-%pypiname Python interface to kgraph. KGraph: A Library for Approximate Nearest Neighbor Search. KGraph is a library for k-nearest neighbor (k-NN) graph construction and online k-NN search using a k-NN Graph as index. KGraph implements heuristic algorithms that are extremely generic and fast: * KGraph works on abstract objects. The only assumption it makes is that a similarity score can be computed on any pair of objects, with a user-provided function. * KGraph is among the fastest of libraries for k-NN search according to recent benchmark. For best generality, the C++ API should be used. A python wrapper is provided under the module name kgraph, which supports Euclidean and Angular distances on rows of NumPy matrices. %prep %setup %autopatch -p1 %build %cmake_insource %cmake_build %pyproject_build %install %cmakeinstall_std %pyproject_install %files %doc README* %_libdir/%{name}*.so.* %files devel %doc README* %_libdir/%{name}*.so %_includedir/%{pkgname}* %_datadir/cmake/Modules/Find%{origname}.cmake %files devel-static %doc README* %_libdir/%{name}*.a %files -n python3-module-%pypiname %doc README* %python3_sitelibdir/%{pypiname}*.so %python3_sitelibdir/%{pypiname}*/METADATA %changelog * Mon Mar 04 2024 Pavel Skrylev <majioa@altlinux.org> 0.1-alt0.git2143fd6.2 - ! fixed placement and containment of find module for the package * Thu Feb 01 2024 Alexey Sheplyakov <asheplyakov@altlinux.org> 0.1-alt0.git2143fd6.1 - NMU: + Fixed FTBFS on aarch64 (don't force SSE2 here) + Build only on aarch64 and x86 as the thing requires either x86 SSE2+ or ARM NEON * Wed Jan 31 2024 Pavel Skrylev <majioa@altlinux.org> 0.1-alt0.git2143fd6 - initial build the git ref 2143fd6 for Sisyphus |