# 
# A double-Array Trie library.
# 
# libdatrie is an implementation of double-array structure for
# representing trie, as proposed by Junichi Aoe.  Trie is a
# kind of digital search tree, an efficient indexing method with
# O(1) time complexity for searching. Comparably as efficient as
# hashing, trie also provides flexibility on incremental matching
# and key spelling manipulation.  This makes it ideal for
# lexical analyzers, as well as spelling dictionaries.
# 
# See the details of the implementation at:
# https://linux.thai.net/~thep/datrie/datrie.html
# 
# Historically, this was first implemented as C++ classes in a
# library called midatrie, but later simplified and rewritten
# from scratch in C.
# 

QICFLAGS="-O2 -march=x86-64 -fstack-clash-protection -fcf-protection=full -fstack-protector-strong --param=ssp-buffer-size=4 -pipe"
QICXXFLAGS="-O2 -march=x86-64 -fstack-clash-protection -fcf-protection=full -fstack-protector-strong --param=ssp-buffer-size=4 -pipe"
QILDFLAGS="-s"
QICPPFLAGS="-D_FORTIFY_SOURCE=2"
pkgname=libdatrie
pkgversion=0.2.13
arch=amd64
release=2
pkgcategory="libs"
full_pkgname=libdatrie_0.2.13_amd64-2@libs
blurb="A double-Array Trie library."
homepage="https://linux.thai.net/projects/datrie"
license="LGPLv2.1"
fetch="https://github.com/tlwg/libdatrie/releases/download/v0.2.13/libdatrie-0.2.13.tar.xz"
replace=""