You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 
 

89 lines
3.3 KiB

##
## libjudy.spec -- OpenPKG RPM Package Specification
## Copyright (c) 2000-2022 OpenPKG Project <http://openpkg.org/>
##
## Permission to use, copy, modify, and distribute this software for
## any purpose with or without fee is hereby granted, provided that
## the above copyright notice and this permission notice appear in all
## copies.
##
## THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
## WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
## MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
## IN NO EVENT SHALL THE AUTHORS AND COPYRIGHT HOLDERS AND THEIR
## CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
## SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
## LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
## USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
## ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
## OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
## OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
## SUCH DAMAGE.
##
# package information
Name: libjudy
Summary: Sparse Associate Array Library
URL: http://judy.sourceforge.net/
Vendor: Doug Baskinks
Packager: OpenPKG Project
Distribution: OpenPKG Community
Class: EVAL
Group: Libraries
License: LGPL
Version: 1.0.5
Release: 20110227
# list of sources
Source0: http://download.sourceforge.net/judy/Judy-%{version}.tar.gz
# build information
BuildPreReq: OpenPKG, openpkg >= 20160101, make, gcc
PreReq: OpenPKG, openpkg >= 20160101
%description
Judy is a C library that implements a dynamic array. Empty Judy
arrays are declared with null pointers. A Judy array consumes
memory only when populated yet can grow to take advantage of all
available memory. Judy's key benefits are: scalability, performance,
memory efficiency, and ease of use. Judy arrays are designed to
grow without tuning into the peta-element range, scaling near
O(log-base-256) -- 1 more RAM access at 256 X population. Judy
arrays are accessed with insert, retrieve, and delete calls for
number or string indexes. Configuration and tuning are not required
-- in fact not possible. Judy offers sorting, counting, and
neighbor/empty searching. Indexes can be sequential, clustered,
periodic, or random -- it doesn't matter to the algorithm. Judy
arrays can be arranged hierarchically to handle any bit patterns --
large indexes, sets of keys, etc. Judy is often an improvement over
common data structures such as: arrays, sparse arrays, hash tables,
B-trees, binary trees, linear lists, skiplists, other sort and
search algorithms, and counting functions.
%track
prog libjudy = {
version = %{version}
url = http://sourceforge.net/projects/libjudy/files/
regex = libjudy-(__VER__)\.tar\.gz
}
%prep
%setup -q -n judy-%{version}
%build
CC="%{l_cc}" \
CFLAGS="%{l_cflags -O}" \
./configure \
--prefix=%{l_prefix} \
--mandir=%{l_prefix}/man \
--disable-shared
%{l_make} %{l_mflags}
%install
%{l_make} %{l_mflags} install DESTDIR=$RPM_BUILD_ROOT
%{l_rpmtool} files -v -ofiles -r$RPM_BUILD_ROOT %{l_files_std}
%files -f files
%clean