Gecko [ corporacionhdm.com.pe ]

Name	Size	Permission	Date
GL	[ DIR ]	drwxr-xr-x	2024-03-03 23:04
X11	[ DIR ]	drwxr-xr-x	2024-09-26 10:31
apache2	[ DIR ]	drwxr-xr-x	2025-06-12 10:30
arpa	[ DIR ]	drwxr-xr-x	2025-06-11 16:35
asm	[ DIR ]	drwxr-xr-x	2025-06-12 10:30
asm-generic	[ DIR ]	drwxr-xr-x	2025-06-12 10:30
bind9	[ DIR ]	drwxr-xr-x	2025-02-21 08:35
bits	[ DIR ]	drwxr-xr-x	2025-06-11 16:35
bsock	[ DIR ]	drwxr-xr-x	2024-03-03 22:15
c++	[ DIR ]	drwxr-xr-x	2025-03-31 10:36
criu	[ DIR ]	drwxr-xr-x	2024-03-06 00:08
curl	[ DIR ]	drwxr-xr-x	2025-01-30 11:39
drm	[ DIR ]	drwxr-xr-x	2025-06-12 10:30
e2p	[ DIR ]	drwxr-xr-x	2025-06-04 10:40
et	[ DIR ]	drwxr-xr-x	2025-06-04 10:40
event2	[ DIR ]	drwxr-xr-x	2024-11-08 03:08
ext2fs	[ DIR ]	drwxr-xr-x	2025-06-04 10:40
finclude	[ DIR ]	drwxr-xr-x	2025-06-11 16:35
fontconfig	[ DIR ]	drwxr-xr-x	2024-03-03 23:04
freetype2	[ DIR ]	drwxr-xr-x	2025-04-01 16:35
fstrm	[ DIR ]	drwxr-xr-x	2024-03-03 23:04
gdb	[ DIR ]	drwxr-xr-x	2025-02-11 10:12
gdbm	[ DIR ]	drwxr-xr-x	2024-03-03 23:04
gnu	[ DIR ]	drwxr-xr-x	2025-06-11 16:35
google	[ DIR ]	drwxr-xr-x	2024-03-03 23:04
gssapi	[ DIR ]	drwxr-xr-x	2025-06-03 22:36
gssrpc	[ DIR ]	drwxr-xr-x	2025-06-03 22:36
json-c	[ DIR ]	drwxr-xr-x	2024-03-03 23:04
kadm5	[ DIR ]	drwxr-xr-x	2025-06-03 22:36
krb5	[ DIR ]	drwxr-xr-x	2025-06-03 22:36
libdb	[ DIR ]	drwxr-xr-x	2024-03-03 20:40
libexslt	[ DIR ]	drwxr-xr-x	2025-06-11 16:35
libltdl	[ DIR ]	drwxr-xr-x	2024-03-03 23:04
libpng16	[ DIR ]	drwxr-xr-x	2024-03-03 23:04
libxml2	[ DIR ]	drwxr-xr-x	2025-06-12 01:41
libxslt	[ DIR ]	drwxr-xr-x	2025-06-11 16:35
linux	[ DIR ]	drwxr-xr-x	2025-06-12 10:30
lua-5.1	[ DIR ]	drwxr-xr-x	2024-07-23 10:39
lzma	[ DIR ]	drwxr-xr-x	2024-03-03 22:40
misc	[ DIR ]	drwxr-xr-x	2025-06-12 10:30
mtd	[ DIR ]	drwxr-xr-x	2025-06-12 10:30
mysql	[ DIR ]	drwxr-xr-x	2025-02-25 11:37
ncurses	[ DIR ]	drwxr-xr-x	2024-03-03 23:04
ncursesw	[ DIR ]	drwxr-xr-x	2024-03-03 23:04
net	[ DIR ]	drwxr-xr-x	2025-06-11 16:35
netash	[ DIR ]	drwxr-xr-x	2025-06-11 16:35
netatalk	[ DIR ]	drwxr-xr-x	2025-06-11 16:35
netax25	[ DIR ]	drwxr-xr-x	2025-06-11 16:35
neteconet	[ DIR ]	drwxr-xr-x	2025-06-11 16:35
netinet	[ DIR ]	drwxr-xr-x	2025-06-11 16:35
netipx	[ DIR ]	drwxr-xr-x	2025-06-11 16:35
netiucv	[ DIR ]	drwxr-xr-x	2025-06-11 16:35
netpacket	[ DIR ]	drwxr-xr-x	2025-06-11 16:35
netrom	[ DIR ]	drwxr-xr-x	2025-06-11 16:35
netrose	[ DIR ]	drwxr-xr-x	2025-06-11 16:35
nfs	[ DIR ]	drwxr-xr-x	2025-06-11 16:35
openssl	[ DIR ]	drwxr-xr-x	2024-10-12 10:30
perf	[ DIR ]	drwxr-xr-x	2025-06-12 10:30
protobuf-c	[ DIR ]	drwxr-xr-x	2024-03-03 23:04
protocols	[ DIR ]	drwxr-xr-x	2025-06-11 16:35
python2.7	[ DIR ]	drwxr-xr-x	2024-06-13 10:37
python3.6m	[ DIR ]	drwxr-xr-x	2024-12-05 20:35
python3.8	[ DIR ]	drwxr-xr-x	2024-03-05 23:45
rdma	[ DIR ]	drwxr-xr-x	2025-06-12 10:30
rpc	[ DIR ]	drwxr-xr-x	2025-06-11 16:35
sasl	[ DIR ]	drwxr-xr-x	2024-03-03 20:40
scsi	[ DIR ]	drwxr-xr-x	2025-06-12 10:30
security	[ DIR ]	drwxr-xr-x	2024-12-02 11:30
selinux	[ DIR ]	drwxr-xr-x	2025-03-13 10:42
sepol	[ DIR ]	drwxr-xr-x	2024-03-03 20:40
sound	[ DIR ]	drwxr-xr-x	2025-06-12 10:30
sys	[ DIR ]	drwxr-xr-x	2025-06-11 16:35
uuid	[ DIR ]	drwxr-xr-x	2024-06-13 10:37
video	[ DIR ]	drwxr-xr-x	2025-06-12 10:30
webp	[ DIR ]	drwxr-xr-x	2025-06-04 10:40
xcb	[ DIR ]	drwxr-xr-x	2024-03-03 23:04
xen	[ DIR ]	drwxr-xr-x	2025-06-12 10:30
FlexLexer.h	6.73 KB	-rw-r--r--	2019-10-12 12:33
a.out.h	4.25 KB	-rw-r--r--	2025-06-09 20:25
aio.h	7.28 KB	-rw-r--r--	2025-06-09 20:25
aliases.h	1.98 KB	-rw-r--r--	2025-06-09 20:25
alloca.h	1.17 KB	-rw-r--r--	2025-06-09 20:25
ar.h	1.69 KB	-rw-r--r--	2025-06-09 20:25
argp.h	24.82 KB	-rw-r--r--	2025-06-09 20:25
argz.h	5.91 KB	-rw-r--r--	2025-06-09 20:25
assert.h	4.45 KB	-rw-r--r--	2025-06-09 20:25
autosprintf.h	2.33 KB	-rw-r--r--	2019-11-18 17:16
byteswap.h	1.37 KB	-rw-r--r--	2025-06-09 20:25
bzlib.h	6.1 KB	-rw-r--r--	2010-09-10 23:08
com_err.h	2.07 KB	-rw-r--r--	2020-03-21 04:24
complex.h	7 KB	-rw-r--r--	2025-06-09 20:25
cpio.h	2.21 KB	-rw-r--r--	2025-06-09 20:25
cpuidle.h	844 B	-rw-r--r--	2025-05-21 15:49
crypt.h	8.9 KB	-rw-r--r--	2021-10-09 04:04
ctype.h	10.71 KB	-rw-r--r--	2025-06-09 20:25
curses.h	97.29 KB	-rw-r--r--	2023-10-14 18:54
cursesapp.h	6.62 KB	-rw-r--r--	2023-10-14 18:54
cursesf.h	27.2 KB	-rw-r--r--	2023-10-14 18:54
cursesm.h	19.22 KB	-rw-r--r--	2023-10-14 18:54
cursesp.h	8.4 KB	-rw-r--r--	2023-10-14 18:54
cursesw.h	48.55 KB	-rw-r--r--	2023-10-14 18:54
cursslk.h	7.13 KB	-rw-r--r--	2023-10-14 18:54
db.h	120.22 KB	-r--r--r--	2021-09-21 16:29
db_185.h	5.84 KB	-r--r--r--	2021-09-21 16:29
dbm.h	1.38 KB	-rw-r--r--	2022-10-08 13:22
dirent.h	12.19 KB	-rw-r--r--	2025-06-09 20:25
dlfcn.h	7.07 KB	-rw-r--r--	2025-06-09 20:25
elf.h	170.73 KB	-rw-r--r--	2025-06-09 20:25
endian.h	3.11 KB	-rw-r--r--	2025-06-09 20:25
entities.h	4.81 KB	-rw-r--r--	2017-08-30 11:05
envz.h	2.8 KB	-rw-r--r--	2025-06-09 20:25
err.h	2.16 KB	-rw-r--r--	2025-06-09 20:25
errno.h	1.64 KB	-rw-r--r--	2025-06-09 20:25
error.h	1.99 KB	-rw-r--r--	2025-06-09 20:25
eti.h	2.82 KB	-rw-r--r--	2023-10-14 18:54
etip.h	9.47 KB	-rw-r--r--	2023-10-14 18:54
evdns.h	1.97 KB	-rw-r--r--	2019-10-12 00:29
event.h	2.68 KB	-rw-r--r--	2019-10-12 00:29
evhttp.h	1.99 KB	-rw-r--r--	2019-10-12 00:29
evrpc.h	1.97 KB	-rw-r--r--	2019-10-12 00:29
evutil.h	1.74 KB	-rw-r--r--	2019-10-12 00:29
execinfo.h	1.49 KB	-rw-r--r--	2025-06-09 20:25
expat.h	42.66 KB	-rw-r--r--	2025-04-15 19:58
expat_config.h	3.43 KB	-rw-r--r--	2025-04-15 19:58
expat_external.h	5.4 KB	-rw-r--r--	2025-04-15 19:58
fcntl.h	10.7 KB	-rw-r--r--	2025-06-09 20:25
features.h	15.69 KB	-rw-r--r--	2025-06-09 20:25
fenv.h	5.72 KB	-rw-r--r--	2025-06-09 20:25
fmtmsg.h	3.16 KB	-rw-r--r--	2025-06-09 20:25
fnmatch.h	2.24 KB	-rw-r--r--	2025-06-09 20:25
form.h	18.17 KB	-rw-r--r--	2023-10-14 18:54
fpu_control.h	3.5 KB	-rw-r--r--	2025-06-09 20:25
fstab.h	3.04 KB	-rw-r--r--	2025-06-09 20:25
fstrm.h	12.71 KB	-rw-r--r--	2019-03-11 20:58
fts.h	8.18 KB	-rw-r--r--	2025-06-09 20:25
ftw.h	5.13 KB	-rw-r--r--	2025-06-09 20:25
gconv.h	4.31 KB	-rw-r--r--	2025-06-09 20:25
gcrypt.h	68.71 KB	-rw-r--r--	2022-06-28 11:54
gd.h	56.42 KB	-rw-r--r--	2017-08-30 11:05
gd_color_map.h	478 B	-rw-r--r--	2017-08-30 11:05
gd_errors.h	1.47 KB	-rw-r--r--	2017-08-30 11:05
gd_io.h	3.05 KB	-rw-r--r--	2017-08-30 11:05
gdbm.h	10.1 KB	-rw-r--r--	2022-10-08 13:22
gdcache.h	2.83 KB	-rw-r--r--	2017-08-30 11:05
gdfontg.h	553 B	-rw-r--r--	2017-08-30 11:05
gdfontl.h	551 B	-rw-r--r--	2017-08-30 11:05
gdfontmb.h	519 B	-rw-r--r--	2017-08-30 11:05
gdfonts.h	515 B	-rw-r--r--	2017-08-30 11:05
gdfontt.h	546 B	-rw-r--r--	2017-08-30 11:05
gdfx.h	497 B	-rw-r--r--	2017-08-30 11:05
gdpp.h	50.94 KB	-rw-r--r--	2017-08-30 11:05
gelf.h	11.14 KB	-rw-r--r--	2023-11-03 17:22
getopt.h	1.43 KB	-rw-r--r--	2025-06-09 20:25
gettext-po.h	15.17 KB	-rw-r--r--	2019-11-18 17:17
glob.h	6.46 KB	-rw-r--r--	2025-06-09 20:25
gnu-versions.h	2.29 KB	-rw-r--r--	2025-06-09 20:25
gnumake.h	2.84 KB	-rw-r--r--	2022-04-18 16:38
gpg-error.h	66.29 KB	-rw-r--r--	2019-10-12 12:20
gpgrt.h	66.29 KB	-rw-r--r--	2019-10-12 12:20
grp.h	6.53 KB	-rw-r--r--	2025-06-09 20:25
gshadow.h	4.42 KB	-rw-r--r--	2025-06-09 20:25
gssapi.h	181 B	-rw-r--r--	2025-06-03 02:06
iconv.h	1.81 KB	-rw-r--r--	2025-06-09 20:25
idn-free.h	2.41 KB	-rw-r--r--	2019-10-13 16:55
idn-int.h	20 B	-rw-r--r--	2019-10-13 16:55
idna.h	3.48 KB	-rw-r--r--	2019-10-13 16:55
ieee754.h	4.79 KB	-rw-r--r--	2025-06-09 20:25
ifaddrs.h	2.77 KB	-rw-r--r--	2025-06-09 20:25
inttypes.h	11.61 KB	-rw-r--r--	2025-06-09 20:25
jconfig-64.h	2.17 KB	-rw-r--r--	2025-05-14 12:43
jconfig.h	246 B	-rw-r--r--	2025-05-14 12:43
jerror.h	14.73 KB	-rw-r--r--	2025-05-14 12:43
jmorecfg.h	14.7 KB	-rw-r--r--	2025-05-14 12:43
jpegint.h	15.22 KB	-rw-r--r--	2025-05-14 12:43
jpeglib.h	48.71 KB	-rw-r--r--	2025-05-14 12:43
kdb.h	67.66 KB	-rw-r--r--	2025-06-03 02:06
keyutils.h	7.52 KB	-rw-r--r--	2021-10-08 13:50
krad.h	8.72 KB	-rw-r--r--	2025-06-03 02:06
krb5.h	402 B	-rw-r--r--	2025-06-03 02:06
langinfo.h	17.43 KB	-rw-r--r--	2025-06-09 20:25
lastlog.h	126 B	-rw-r--r--	2025-06-09 20:25
lber.h	14.95 KB	-rw-r--r--	2025-03-11 09:44
lber_types.h	1.43 KB	-rw-r--r--	2025-03-11 09:44
ldap.h	63.57 KB	-rw-r--r--	2025-03-11 09:44
ldap_cdefs.h	9.24 KB	-rw-r--r--	2025-03-11 09:44
ldap_features.h	1.77 KB	-rw-r--r--	2025-03-11 09:44
ldap_schema.h	9.23 KB	-rw-r--r--	2025-03-11 09:44
ldap_utf8.h	3.39 KB	-rw-r--r--	2025-03-11 09:44
ldif.h	4.58 KB	-rw-r--r--	2025-03-11 09:44
libaio.h	8.73 KB	-rw-r--r--	2019-11-13 13:59
libelf.h	19.84 KB	-rw-r--r--	2023-11-03 17:22
libgen.h	1.35 KB	-rw-r--r--	2025-06-09 20:25
libintl.h	4.47 KB	-rw-r--r--	2025-06-09 20:25
limits.h	5.29 KB	-rw-r--r--	2025-06-09 20:25
link.h	7.05 KB	-rw-r--r--	2025-06-09 20:25
locale.h	7.49 KB	-rw-r--r--	2025-06-09 20:25
ltdl.h	5.58 KB	-rw-r--r--	2019-10-11 14:55
lzma.h	9.59 KB	-rw-r--r--	2018-04-29 15:10
magic.h	5.46 KB	-rw-r--r--	2024-04-06 14:44
malloc.h	5.96 KB	-rw-r--r--	2025-06-09 20:25
math.h	52.07 KB	-rw-r--r--	2025-06-09 20:25
mcheck.h	2.38 KB	-rw-r--r--	2025-06-09 20:25
memory.h	955 B	-rw-r--r--	2025-06-09 20:25
menu.h	11.91 KB	-rw-r--r--	2023-10-14 18:54
mntent.h	3.28 KB	-rw-r--r--	2025-06-09 20:25
monetary.h	1.76 KB	-rw-r--r--	2025-06-09 20:25
mqueue.h	3.67 KB	-rw-r--r--	2025-06-09 20:25
nc_tparm.h	4.1 KB	-rw-r--r--	2023-10-14 18:54
ncurses.h	97.29 KB	-rw-r--r--	2023-10-14 18:54
ncurses_dll.h	4.18 KB	-rw-r--r--	2023-10-14 18:54
ndbm.h	2.4 KB	-rw-r--r--	2022-10-08 13:22
netdb.h	27.44 KB	-rw-r--r--	2025-06-09 20:25
nl_types.h	1.71 KB	-rw-r--r--	2025-06-09 20:25
nlist.h	1.56 KB	-rw-r--r--	2023-11-03 17:22
nss.h	1.83 KB	-rw-r--r--	2025-06-09 20:25
obstack.h	20.81 KB	-rw-r--r--	2025-06-09 20:25
panel.h	4.03 KB	-rw-r--r--	2023-10-14 18:54
paths.h	2.91 KB	-rw-r--r--	2025-06-09 20:25
pcre.h	30.97 KB	-rw-r--r--	2021-10-08 19:17
pcre2.h	43.75 KB	-rw-r--r--	2022-08-02 16:07
pcre2posix.h	5.67 KB	-rw-r--r--	2022-08-02 16:07
pcre_scanner.h	6.45 KB	-rw-r--r--	2021-10-08 19:17
pcre_stringpiece.h	6.16 KB	-rw-r--r--	2021-10-08 19:17
pcrecpp.h	25.91 KB	-rw-r--r--	2021-10-08 19:17
pcrecpparg.h	6.62 KB	-rw-r--r--	2021-10-08 19:17
pcreposix.h	5.32 KB	-rw-r--r--	2021-10-08 19:17
png.h	140.77 KB	-rw-r--r--	2019-10-12 00:44
pngconf.h	22.31 KB	-rw-r--r--	2019-10-12 00:44
pnglibconf.h	7.39 KB	-rw-r--r--	2019-10-12 00:44
poll.h	22 B	-rw-r--r--	2025-06-09 20:25
pr29.h	2.07 KB	-rw-r--r--	2019-10-13 16:55
printf.h	6.64 KB	-rw-r--r--	2025-06-09 20:25
proc_service.h	3.39 KB	-rw-r--r--	2025-06-09 20:25
profile.h	11.87 KB	-rw-r--r--	2025-06-03 02:06
pthread.h	40.3 KB	-rw-r--r--	2025-06-09 20:25
pty.h	1.53 KB	-rw-r--r--	2025-06-09 20:25
punycode.h	9.16 KB	-rw-r--r--	2019-10-13 16:55
pwd.h	6.01 KB	-rw-r--r--	2025-06-09 20:25
re_comp.h	962 B	-rw-r--r--	2025-06-09 20:25
regex.h	24.14 KB	-rw-r--r--	2025-06-09 20:25
regexp.h	1.41 KB	-rw-r--r--	2025-06-09 20:25
resolv.h	11.79 KB	-rw-r--r--	2025-06-09 20:25
sched.h	4.62 KB	-rw-r--r--	2025-06-09 20:25
search.h	5.1 KB	-rw-r--r--	2025-06-09 20:25
semaphore.h	2.34 KB	-rw-r--r--	2025-06-09 20:25
setjmp.h	3.58 KB	-rw-r--r--	2025-06-09 20:25
sgtty.h	1.31 KB	-rw-r--r--	2025-06-09 20:25
shadow.h	5.34 KB	-rw-r--r--	2025-06-09 20:25
signal.h	11.96 KB	-rw-r--r--	2025-06-09 20:25
slapi-plugin.h	37.45 KB	-rw-r--r--	2025-03-11 09:44
spawn.h	6.53 KB	-rw-r--r--	2025-06-09 20:25
stab.h	264 B	-rw-r--r--	2025-06-09 20:25
stdc-predef.h	2.24 KB	-rw-r--r--	2025-06-09 20:25
stdint.h	8.27 KB	-rw-r--r--	2025-06-09 20:25
stdio.h	29.46 KB	-rw-r--r--	2025-06-09 20:25
stdio_ext.h	2.73 KB	-rw-r--r--	2025-06-09 20:25
stdlib.h	34.82 KB	-rw-r--r--	2025-06-09 20:25
string.h	17.17 KB	-rw-r--r--	2025-06-09 20:25
stringprep.h	8.03 KB	-rw-r--r--	2019-10-13 16:55
strings.h	4.64 KB	-rw-r--r--	2025-06-09 20:25
syscall.h	25 B	-rw-r--r--	2025-06-09 20:25
sysexits.h	5.11 KB	-rw-r--r--	2025-06-09 20:25
syslog.h	24 B	-rw-r--r--	2025-06-09 20:25
tar.h	3.7 KB	-rw-r--r--	2025-06-09 20:25
term.h	40.22 KB	-rw-r--r--	2023-10-14 18:54
term_entry.h	8.55 KB	-rw-r--r--	2023-10-14 18:54
termcap.h	3.39 KB	-rw-r--r--	2023-10-14 18:54
termio.h	214 B	-rw-r--r--	2025-06-09 20:25
termios.h	3.51 KB	-rw-r--r--	2025-06-09 20:25
tgmath.h	30.75 KB	-rw-r--r--	2025-06-09 20:25
thread_db.h	15.65 KB	-rw-r--r--	2025-06-09 20:25
threads.h	6.5 KB	-rw-r--r--	2025-06-09 20:25
tic.h	13.32 KB	-rw-r--r--	2023-10-14 18:54
tiff.h	35.14 KB	-rw-r--r--	2025-05-07 13:34
tiffconf-64.h	3.35 KB	-rw-r--r--	2025-05-07 13:34
tiffconf.h	250 B	-rw-r--r--	2025-05-07 13:34
tiffio.h	22.68 KB	-rw-r--r--	2025-05-07 13:34
tiffio.hxx	1.66 KB	-rw-r--r--	2025-05-07 13:34
tiffvers.h	410 B	-rw-r--r--	2025-05-07 13:34
time.h	10.12 KB	-rw-r--r--	2025-06-09 20:25
tld.h	4.54 KB	-rw-r--r--	2019-10-13 16:55
ttyent.h	2.44 KB	-rw-r--r--	2025-06-09 20:25
uchar.h	1.95 KB	-rw-r--r--	2025-06-09 20:25
ucontext.h	1.99 KB	-rw-r--r--	2025-06-09 20:25
ulimit.h	1.55 KB	-rw-r--r--	2025-06-09 20:25
unctrl.h	3.03 KB	-rw-r--r--	2023-10-14 18:54
unistd.h	41.74 KB	-rw-r--r--	2025-06-09 20:25
utime.h	1.47 KB	-rw-r--r--	2025-06-09 20:25
utmp.h	3.15 KB	-rw-r--r--	2025-06-09 20:25
utmpx.h	4 KB	-rw-r--r--	2025-06-09 20:25
values.h	1.91 KB	-rw-r--r--	2025-06-09 20:25
verto-module.h	6.48 KB	-rw-r--r--	2022-10-08 07:49
verto.h	18.98 KB	-rw-r--r--	2022-10-08 07:49
wait.h	22 B	-rw-r--r--	2025-06-09 20:25
wchar.h	30.38 KB	-rw-r--r--	2025-06-09 20:25
wctype.h	5.42 KB	-rw-r--r--	2025-06-09 20:25
wordexp.h	2.44 KB	-rw-r--r--	2025-06-09 20:25
zbuff.h	11.23 KB	-rw-r--r--	2019-11-04 17:54
zconf.h	15.88 KB	-rw-r--r--	2023-10-11 22:02
zdict.h	16.8 KB	-rw-r--r--	2019-11-04 17:54
zlib.h	94 KB	-rw-r--r--	2023-10-11 22:02
zstd.h	117.16 KB	-rw-r--r--	2019-11-04 17:54
zstd_errors.h	3.66 KB	-rw-r--r--	2019-11-04 17:54

Rename

/*
 * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
 * All rights reserved.
 *
 * This source code is licensed under both the BSD-style license (found in the
 * LICENSE file in the root directory of this source tree) and the GPLv2 (found
 * in the COPYING file in the root directory of this source tree).
 * You may select, at your option, one of the above-listed licenses.
 */

#ifndef DICTBUILDER_H_001
#define DICTBUILDER_H_001

#if defined (__cplusplus)
extern "C" {
#endif

/*======  Dependencies  ======*/
#include <stddef.h>  /* size_t */

/* =====   ZDICTLIB_API : control library symbols visibility   ===== */
#ifndef ZDICTLIB_VISIBILITY
#  if defined(__GNUC__) && (__GNUC__ >= 4)
#    define ZDICTLIB_VISIBILITY __attribute__ ((visibility ("default")))
#  else
#    define ZDICTLIB_VISIBILITY
#  endif
#endif
#if defined(ZSTD_DLL_EXPORT) && (ZSTD_DLL_EXPORT==1)
#  define ZDICTLIB_API __declspec(dllexport) ZDICTLIB_VISIBILITY
#elif defined(ZSTD_DLL_IMPORT) && (ZSTD_DLL_IMPORT==1)
#  define ZDICTLIB_API __declspec(dllimport) ZDICTLIB_VISIBILITY /* It isn't required but allows to generate better code, saving a function pointer load from the IAT and an indirect jump.*/
#else
#  define ZDICTLIB_API ZDICTLIB_VISIBILITY
#endif

/*! ZDICT_trainFromBuffer():
 *  Train a dictionary from an array of samples.
 *  Redirect towards ZDICT_optimizeTrainFromBuffer_fastCover() single-threaded, with d=8, steps=4,
 *  f=20, and accel=1.
 *  Samples must be stored concatenated in a single flat buffer `samplesBuffer`,
 *  supplied with an array of sizes `samplesSizes`, providing the size of each sample, in order.
 *  The resulting dictionary will be saved into `dictBuffer`.
 * @return: size of dictionary stored into `dictBuffer` (<= `dictBufferCapacity`)
 *          or an error code, which can be tested with ZDICT_isError().
 *  Note:  Dictionary training will fail if there are not enough samples to construct a
 *         dictionary, or if most of the samples are too small (< 8 bytes being the lower limit).
 *         If dictionary training fails, you should use zstd without a dictionary, as the dictionary
 *         would've been ineffective anyways. If you believe your samples would benefit from a dictionary
 *         please open an issue with details, and we can look into it.
 *  Note: ZDICT_trainFromBuffer()'s memory usage is about 6 MB.
 *  Tips: In general, a reasonable dictionary has a size of ~ 100 KB.
 *        It's possible to select smaller or larger size, just by specifying `dictBufferCapacity`.
 *        In general, it's recommended to provide a few thousands samples, though this can vary a lot.
 *        It's recommended that total size of all samples be about ~x100 times the target size of dictionary.
 */
ZDICTLIB_API size_t ZDICT_trainFromBuffer(void* dictBuffer, size_t dictBufferCapacity,
                                    const void* samplesBuffer,
                                    const size_t* samplesSizes, unsigned nbSamples);

/*======   Helper functions   ======*/
ZDICTLIB_API unsigned ZDICT_getDictID(const void* dictBuffer, size_t dictSize);  /**< extracts dictID; @return zero if error (not a valid dictionary) */
ZDICTLIB_API unsigned ZDICT_isError(size_t errorCode);
ZDICTLIB_API const char* ZDICT_getErrorName(size_t errorCode);

#ifdef ZDICT_STATIC_LINKING_ONLY

/* ====================================================================================
 * The definitions in this section are considered experimental.
 * They should never be used with a dynamic library, as they may change in the future.
 * They are provided for advanced usages.
 * Use them only in association with static linking.
 * ==================================================================================== */

typedef struct {
    int      compressionLevel;   /* optimize for a specific zstd compression level; 0 means default */
    unsigned notificationLevel;  /* Write log to stderr; 0 = none (default); 1 = errors; 2 = progression; 3 = details; 4 = debug; */
    unsigned dictID;             /* force dictID value; 0 means auto mode (32-bits random value) */
} ZDICT_params_t;

/*! ZDICT_cover_params_t:
 *  k and d are the only required parameters.
 *  For others, value 0 means default.
 */
typedef struct {
    unsigned k;                  /* Segment size : constraint: 0 < k : Reasonable range [16, 2048+] */
    unsigned d;                  /* dmer size : constraint: 0 < d <= k : Reasonable range [6, 16] */
    unsigned steps;              /* Number of steps : Only used for optimization : 0 means default (40) : Higher means more parameters checked */
    unsigned nbThreads;          /* Number of threads : constraint: 0 < nbThreads : 1 means single-threaded : Only used for optimization : Ignored if ZSTD_MULTITHREAD is not defined */
    double splitPoint;           /* Percentage of samples used for training: Only used for optimization : the first nbSamples * splitPoint samples will be used to training, the last nbSamples * (1 - splitPoint) samples will be used for testing, 0 means default (1.0), 1.0 when all samples are used for both training and testing */
    unsigned shrinkDict;         /* Train dictionaries to shrink in size starting from the minimum size and selects the smallest dictionary that is shrinkDictMaxRegression% worse than the largest dictionary. 0 means no shrinking and 1 means shrinking  */
    unsigned shrinkDictMaxRegression; /* Sets shrinkDictMaxRegression so that a smaller dictionary can be at worse shrinkDictMaxRegression% worse than the max dict size dictionary. */
    ZDICT_params_t zParams;
} ZDICT_cover_params_t;

typedef struct {
    unsigned k;                  /* Segment size : constraint: 0 < k : Reasonable range [16, 2048+] */
    unsigned d;                  /* dmer size : constraint: 0 < d <= k : Reasonable range [6, 16] */
    unsigned f;                  /* log of size of frequency array : constraint: 0 < f <= 31 : 1 means default(20)*/
    unsigned steps;              /* Number of steps : Only used for optimization : 0 means default (40) : Higher means more parameters checked */
    unsigned nbThreads;          /* Number of threads : constraint: 0 < nbThreads : 1 means single-threaded : Only used for optimization : Ignored if ZSTD_MULTITHREAD is not defined */
    double splitPoint;           /* Percentage of samples used for training: Only used for optimization : the first nbSamples * splitPoint samples will be used to training, the last nbSamples * (1 - splitPoint) samples will be used for testing, 0 means default (0.75), 1.0 when all samples are used for both training and testing */
    unsigned accel;              /* Acceleration level: constraint: 0 < accel <= 10, higher means faster and less accurate, 0 means default(1) */
    unsigned shrinkDict;         /* Train dictionaries to shrink in size starting from the minimum size and selects the smallest dictionary that is shrinkDictMaxRegression% worse than the largest dictionary. 0 means no shrinking and 1 means shrinking  */
    unsigned shrinkDictMaxRegression; /* Sets shrinkDictMaxRegression so that a smaller dictionary can be at worse shrinkDictMaxRegression% worse than the max dict size dictionary. */

ZDICT_params_t zParams;
} ZDICT_fastCover_params_t;

/*! ZDICT_trainFromBuffer_cover():
 *  Train a dictionary from an array of samples using the COVER algorithm.
 *  Samples must be stored concatenated in a single flat buffer `samplesBuffer`,
 *  supplied with an array of sizes `samplesSizes`, providing the size of each sample, in order.
 *  The resulting dictionary will be saved into `dictBuffer`.
 * @return: size of dictionary stored into `dictBuffer` (<= `dictBufferCapacity`)
 *          or an error code, which can be tested with ZDICT_isError().
 *          See ZDICT_trainFromBuffer() for details on failure modes.
 *  Note: ZDICT_trainFromBuffer_cover() requires about 9 bytes of memory for each input byte.
 *  Tips: In general, a reasonable dictionary has a size of ~ 100 KB.
 *        It's possible to select smaller or larger size, just by specifying `dictBufferCapacity`.
 *        In general, it's recommended to provide a few thousands samples, though this can vary a lot.
 *        It's recommended that total size of all samples be about ~x100 times the target size of dictionary.
 */
ZDICTLIB_API size_t ZDICT_trainFromBuffer_cover(
          void *dictBuffer, size_t dictBufferCapacity,
    const void *samplesBuffer, const size_t *samplesSizes, unsigned nbSamples,
          ZDICT_cover_params_t parameters);

/*! ZDICT_optimizeTrainFromBuffer_cover():
 * The same requirements as above hold for all the parameters except `parameters`.
 * This function tries many parameter combinations and picks the best parameters.
 * `*parameters` is filled with the best parameters found,
 * dictionary constructed with those parameters is stored in `dictBuffer`.
 *
 * All of the parameters d, k, steps are optional.
 * If d is non-zero then we don't check multiple values of d, otherwise we check d = {6, 8}.
 * if steps is zero it defaults to its default value.
 * If k is non-zero then we don't check multiple values of k, otherwise we check steps values in [50, 2000].
 *
 * @return: size of dictionary stored into `dictBuffer` (<= `dictBufferCapacity`)
 *          or an error code, which can be tested with ZDICT_isError().
 *          On success `*parameters` contains the parameters selected.
 *          See ZDICT_trainFromBuffer() for details on failure modes.
 * Note: ZDICT_optimizeTrainFromBuffer_cover() requires about 8 bytes of memory for each input byte and additionally another 5 bytes of memory for each byte of memory for each thread.
 */
ZDICTLIB_API size_t ZDICT_optimizeTrainFromBuffer_cover(
          void* dictBuffer, size_t dictBufferCapacity,
    const void* samplesBuffer, const size_t* samplesSizes, unsigned nbSamples,
          ZDICT_cover_params_t* parameters);

/*! ZDICT_trainFromBuffer_fastCover():
 *  Train a dictionary from an array of samples using a modified version of COVER algorithm.
 *  Samples must be stored concatenated in a single flat buffer `samplesBuffer`,
 *  supplied with an array of sizes `samplesSizes`, providing the size of each sample, in order.
 *  d and k are required.
 *  All other parameters are optional, will use default values if not provided
 *  The resulting dictionary will be saved into `dictBuffer`.
 * @return: size of dictionary stored into `dictBuffer` (<= `dictBufferCapacity`)
 *          or an error code, which can be tested with ZDICT_isError().
 *          See ZDICT_trainFromBuffer() for details on failure modes.
 *  Note: ZDICT_trainFromBuffer_fastCover() requires 6 * 2^f bytes of memory.
 *  Tips: In general, a reasonable dictionary has a size of ~ 100 KB.
 *        It's possible to select smaller or larger size, just by specifying `dictBufferCapacity`.
 *        In general, it's recommended to provide a few thousands samples, though this can vary a lot.
 *        It's recommended that total size of all samples be about ~x100 times the target size of dictionary.
 */
ZDICTLIB_API size_t ZDICT_trainFromBuffer_fastCover(void *dictBuffer,
                    size_t dictBufferCapacity, const void *samplesBuffer,
                    const size_t *samplesSizes, unsigned nbSamples,
                    ZDICT_fastCover_params_t parameters);

/*! ZDICT_optimizeTrainFromBuffer_fastCover():
 * The same requirements as above hold for all the parameters except `parameters`.
 * This function tries many parameter combinations (specifically, k and d combinations)
 * and picks the best parameters. `*parameters` is filled with the best parameters found,
 * dictionary constructed with those parameters is stored in `dictBuffer`.
 * All of the parameters d, k, steps, f, and accel are optional.
 * If d is non-zero then we don't check multiple values of d, otherwise we check d = {6, 8}.
 * if steps is zero it defaults to its default value.
 * If k is non-zero then we don't check multiple values of k, otherwise we check steps values in [50, 2000].
 * If f is zero, default value of 20 is used.
 * If accel is zero, default value of 1 is used.
 *
 * @return: size of dictionary stored into `dictBuffer` (<= `dictBufferCapacity`)
 *          or an error code, which can be tested with ZDICT_isError().
 *          On success `*parameters` contains the parameters selected.
 *          See ZDICT_trainFromBuffer() for details on failure modes.
 * Note: ZDICT_optimizeTrainFromBuffer_fastCover() requires about 6 * 2^f bytes of memory for each thread.
 */
ZDICTLIB_API size_t ZDICT_optimizeTrainFromBuffer_fastCover(void* dictBuffer,
                    size_t dictBufferCapacity, const void* samplesBuffer,
                    const size_t* samplesSizes, unsigned nbSamples,
                    ZDICT_fastCover_params_t* parameters);

/*! ZDICT_finalizeDictionary():
 * Given a custom content as a basis for dictionary, and a set of samples,
 * finalize dictionary by adding headers and statistics.
 *
 * Samples must be stored concatenated in a flat buffer `samplesBuffer`,
 * supplied with an array of sizes `samplesSizes`, providing the size of each sample in order.
 *
 * dictContentSize must be >= ZDICT_CONTENTSIZE_MIN bytes.
 * maxDictSize must be >= dictContentSize, and must be >= ZDICT_DICTSIZE_MIN bytes.
 *
 * @return: size of dictionary stored into `dictBuffer` (<= `dictBufferCapacity`),
 *          or an error code, which can be tested by ZDICT_isError().
 * Note: ZDICT_finalizeDictionary() will push notifications into stderr if instructed to, using notificationLevel>0.
 * Note 2: dictBuffer and dictContent can overlap
 */
#define ZDICT_CONTENTSIZE_MIN 128
#define ZDICT_DICTSIZE_MIN    256
ZDICTLIB_API size_t ZDICT_finalizeDictionary(void* dictBuffer, size_t dictBufferCapacity,
                                const void* dictContent, size_t dictContentSize,
                                const void* samplesBuffer, const size_t* samplesSizes, unsigned nbSamples,
                                ZDICT_params_t parameters);

typedef struct {
    unsigned selectivityLevel;   /* 0 means default; larger => select more => larger dictionary */
    ZDICT_params_t zParams;
} ZDICT_legacy_params_t;

/*! ZDICT_trainFromBuffer_legacy():
 *  Train a dictionary from an array of samples.
 *  Samples must be stored concatenated in a single flat buffer `samplesBuffer`,
 *  supplied with an array of sizes `samplesSizes`, providing the size of each sample, in order.
 *  The resulting dictionary will be saved into `dictBuffer`.
 * `parameters` is optional and can be provided with values set to 0 to mean "default".
 * @return: size of dictionary stored into `dictBuffer` (<= `dictBufferCapacity`)
 *          or an error code, which can be tested with ZDICT_isError().
 *          See ZDICT_trainFromBuffer() for details on failure modes.
 *  Tips: In general, a reasonable dictionary has a size of ~ 100 KB.
 *        It's possible to select smaller or larger size, just by specifying `dictBufferCapacity`.
 *        In general, it's recommended to provide a few thousands samples, though this can vary a lot.
 *        It's recommended that total size of all samples be about ~x100 times the target size of dictionary.
 *  Note: ZDICT_trainFromBuffer_legacy() will send notifications into stderr if instructed to, using notificationLevel>0.
 */
ZDICTLIB_API size_t ZDICT_trainFromBuffer_legacy(
    void *dictBuffer, size_t dictBufferCapacity,
    const void *samplesBuffer, const size_t *samplesSizes, unsigned nbSamples,
    ZDICT_legacy_params_t parameters);

/* Deprecation warnings */
/* It is generally possible to disable deprecation warnings from compiler,
   for example with -Wno-deprecated-declarations for gcc
   or _CRT_SECURE_NO_WARNINGS in Visual.
   Otherwise, it's also possible to manually define ZDICT_DISABLE_DEPRECATE_WARNINGS */
#ifdef ZDICT_DISABLE_DEPRECATE_WARNINGS
#  define ZDICT_DEPRECATED(message) ZDICTLIB_API   /* disable deprecation warnings */
#else
#  define ZDICT_GCC_VERSION (__GNUC__ * 100 + __GNUC_MINOR__)
#  if defined (__cplusplus) && (__cplusplus >= 201402) /* C++14 or greater */
#    define ZDICT_DEPRECATED(message) [[deprecated(message)]] ZDICTLIB_API
#  elif (ZDICT_GCC_VERSION >= 405) || defined(__clang__)
#    define ZDICT_DEPRECATED(message) ZDICTLIB_API __attribute__((deprecated(message)))
#  elif (ZDICT_GCC_VERSION >= 301)
#    define ZDICT_DEPRECATED(message) ZDICTLIB_API __attribute__((deprecated))
#  elif defined(_MSC_VER)
#    define ZDICT_DEPRECATED(message) ZDICTLIB_API __declspec(deprecated(message))
#  else
#    pragma message("WARNING: You need to implement ZDICT_DEPRECATED for this compiler")
#    define ZDICT_DEPRECATED(message) ZDICTLIB_API
#  endif
#endif /* ZDICT_DISABLE_DEPRECATE_WARNINGS */

ZDICT_DEPRECATED("use ZDICT_finalizeDictionary() instead")
size_t ZDICT_addEntropyTablesFromBuffer(void* dictBuffer, size_t dictContentSize, size_t dictBufferCapacity,
                                  const void* samplesBuffer, const size_t* samplesSizes, unsigned nbSamples);

#endif   /* ZDICT_STATIC_LINKING_ONLY */

#if defined (__cplusplus)
}
#endif

#endif   /* DICTBUILDER_H_001 */