#
CC = gcc
-CFLAGS = -DMSDOS -DTeX -DINITEX -DINI -Ilibmd5 -Ilibavl/libavl
+CFLAGS = -DMSDOS -DTeX -DINITEX -DINI -Ilibmd5
LDFLAGS = -lkpathsea -lhpdf -lpng -lz
objects = yandytex.o itex.o openinou.o subroute.o local.o \
tex0.o tex1.o tex2.o tex3.o tex4.o \
tex5.o tex6.o tex7.o tex8.o tex9.o \
yandy_pool.o md5.o md5file.o \
- yandy_pdf_backend.o avl.o
+ yandy_pdf_backend.o
headers = yandytex.h texd.h coerce.h texmf.h texmfmem.h
yandy_pdf_backend.o: yandy_pdf_backend.c $(headers)
$(CC) -c $(CFLAGS) yandy_pdf_backend.c
-avl.o: libavl/libavl/avl.c $(headers)
- $(CC) -c $(CFLAGS) libavl/libavl/avl.c
-
.PHONY: clean
clean:
+++ /dev/null
-build/
-doc/
-.*.swp
-*~
-*.gcda
-*.gcno
-*.gcov
-*.o
-*.x
-*.profile
+++ /dev/null
-# DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
-# Version 2, December 2004
-#
-# Copyright (C) 2013 Adrien Oliva <adrien.oliva@yapbreak.fr>
-#
-# Everyone is permitted to copy and distribute verbatim or modified
-# copies of this license document, and changing it is allowed as long
-# as the name is changed.
-#
-# DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
-# TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
-#
-# 0. You just DO WHAT THE FUCK YOU WANT TO.
-# Doxyfile 1.8.2
-
-# This file describes the settings to be used by the documentation system
-# doxygen (www.doxygen.org) for a project
-#
-# All text after a hash (#) is considered a comment and will be ignored
-# The format is:
-# TAG = value [value, ...]
-# For lists items can also be appended using:
-# TAG += value [value, ...]
-# Values that contain spaces should be placed between quotes (" ")
-
-#---------------------------------------------------------------------------
-# Project related configuration options
-#---------------------------------------------------------------------------
-
-# This tag specifies the encoding used for all characters in the config file
-# that follow. The default is UTF-8 which is also the encoding used for all
-# text before the first occurrence of this tag. Doxygen uses libiconv (or the
-# iconv built into libc) for the transcoding. See
-# http://www.gnu.org/software/libiconv for the list of possible encodings.
-
-DOXYFILE_ENCODING = UTF-8
-
-# The PROJECT_NAME tag is a single word (or sequence of words) that should
-# identify the project. Note that if you do not use Doxywizard you need
-# to put quotes around the project name if it contains spaces.
-
-PROJECT_NAME = LibAVL
-
-# The PROJECT_NUMBER tag can be used to enter a project or revision number.
-# This could be handy for archiving the generated documentation or
-# if some version control system is used.
-
-PROJECT_NUMBER = 1.0.0
-
-# Using the PROJECT_BRIEF tag one can provide an optional one line description
-# for a project that appears at the top of each page and should give viewer
-# a quick idea about the purpose of the project. Keep the description short.
-
-PROJECT_BRIEF = "Library that provide AVL implementation of a tree"
-
-# With the PROJECT_LOGO tag one can specify an logo or icon that is
-# included in the documentation. The maximum height of the logo should not
-# exceed 55 pixels and the maximum width should not exceed 200 pixels.
-# Doxygen will copy the logo to the output directory.
-
-PROJECT_LOGO =
-
-# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute)
-# base path where the generated documentation will be put.
-# If a relative path is entered, it will be relative to the location
-# where doxygen was started. If left blank the current directory will be used.
-
-OUTPUT_DIRECTORY = doc
-
-# If the CREATE_SUBDIRS tag is set to YES, then doxygen will create
-# 4096 sub-directories (in 2 levels) under the output directory of each output
-# format and will distribute the generated files over these directories.
-# Enabling this option can be useful when feeding doxygen a huge amount of
-# source files, where putting all generated files in the same directory would
-# otherwise cause performance problems for the file system.
-
-CREATE_SUBDIRS = NO
-
-# The OUTPUT_LANGUAGE tag is used to specify the language in which all
-# documentation generated by doxygen is written. Doxygen will use this
-# information to generate all constant output in the proper language.
-# The default language is English, other supported languages are:
-# Afrikaans, Arabic, Brazilian, Catalan, Chinese, Chinese-Traditional,
-# Croatian, Czech, Danish, Dutch, Esperanto, Farsi, Finnish, French, German,
-# Greek, Hungarian, Italian, Japanese, Japanese-en (Japanese with English
-# messages), Korean, Korean-en, Lithuanian, Norwegian, Macedonian, Persian,
-# Polish, Portuguese, Romanian, Russian, Serbian, Serbian-Cyrillic, Slovak,
-# Slovene, Spanish, Swedish, Ukrainian, and Vietnamese.
-
-OUTPUT_LANGUAGE = English
-
-# If the BRIEF_MEMBER_DESC tag is set to YES (the default) Doxygen will
-# include brief member descriptions after the members that are listed in
-# the file and class documentation (similar to JavaDoc).
-# Set to NO to disable this.
-
-BRIEF_MEMBER_DESC = YES
-
-# If the REPEAT_BRIEF tag is set to YES (the default) Doxygen will prepend
-# the brief description of a member or function before the detailed description.
-# Note: if both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
-# brief descriptions will be completely suppressed.
-
-REPEAT_BRIEF = YES
-
-# This tag implements a quasi-intelligent brief description abbreviator
-# that is used to form the text in various listings. Each string
-# in this list, if found as the leading text of the brief description, will be
-# stripped from the text and the result after processing the whole list, is
-# used as the annotated text. Otherwise, the brief description is used as-is.
-# If left blank, the following values are used ("$name" is automatically
-# replaced with the name of the entity): "The $name class" "The $name widget"
-# "The $name file" "is" "provides" "specifies" "contains"
-# "represents" "a" "an" "the"
-
-ABBREVIATE_BRIEF = "The $name class" \
- "The $name widget" \
- "The $name file" \
- is \
- provides \
- specifies \
- contains \
- represents \
- a \
- an \
- the
-
-# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
-# Doxygen will generate a detailed section even if there is only a brief
-# description.
-
-ALWAYS_DETAILED_SEC = NO
-
-# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
-# inherited members of a class in the documentation of that class as if those
-# members were ordinary class members. Constructors, destructors and assignment
-# operators of the base classes will not be shown.
-
-INLINE_INHERITED_MEMB = NO
-
-# If the FULL_PATH_NAMES tag is set to YES then Doxygen will prepend the full
-# path before files name in the file list and in the header files. If set
-# to NO the shortest path that makes the file name unique will be used.
-
-FULL_PATH_NAMES = YES
-
-# If the FULL_PATH_NAMES tag is set to YES then the STRIP_FROM_PATH tag
-# can be used to strip a user-defined part of the path. Stripping is
-# only done if one of the specified strings matches the left-hand part of
-# the path. The tag can be used to show relative paths in the file list.
-# If left blank the directory from which doxygen is run is used as the
-# path to strip. Note that you specify absolute paths here, but also
-# relative paths, which will be relative from the directory where doxygen is
-# started.
-
-STRIP_FROM_PATH =
-
-# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of
-# the path mentioned in the documentation of a class, which tells
-# the reader which header file to include in order to use a class.
-# If left blank only the name of the header file containing the class
-# definition is used. Otherwise one should specify the include paths that
-# are normally passed to the compiler using the -I flag.
-
-STRIP_FROM_INC_PATH =
-
-# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter
-# (but less readable) file names. This can be useful if your file system
-# doesn't support long names like on DOS, Mac, or CD-ROM.
-
-SHORT_NAMES = NO
-
-# If the JAVADOC_AUTOBRIEF tag is set to YES then Doxygen
-# will interpret the first line (until the first dot) of a JavaDoc-style
-# comment as the brief description. If set to NO, the JavaDoc
-# comments will behave just like regular Qt-style comments
-# (thus requiring an explicit @brief command for a brief description.)
-
-JAVADOC_AUTOBRIEF = NO
-
-# If the QT_AUTOBRIEF tag is set to YES then Doxygen will
-# interpret the first line (until the first dot) of a Qt-style
-# comment as the brief description. If set to NO, the comments
-# will behave just like regular Qt-style comments (thus requiring
-# an explicit \brief command for a brief description.)
-
-QT_AUTOBRIEF = NO
-
-# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make Doxygen
-# treat a multi-line C++ special comment block (i.e. a block of //! or ///
-# comments) as a brief description. This used to be the default behaviour.
-# The new default is to treat a multi-line C++ comment block as a detailed
-# description. Set this tag to YES if you prefer the old behaviour instead.
-
-MULTILINE_CPP_IS_BRIEF = NO
-
-# If the INHERIT_DOCS tag is set to YES (the default) then an undocumented
-# member inherits the documentation from any documented member that it
-# re-implements.
-
-INHERIT_DOCS = YES
-
-# If the SEPARATE_MEMBER_PAGES tag is set to YES, then doxygen will produce
-# a new page for each member. If set to NO, the documentation of a member will
-# be part of the file/class/namespace that contains it.
-
-SEPARATE_MEMBER_PAGES = NO
-
-# The TAB_SIZE tag can be used to set the number of spaces in a tab.
-# Doxygen uses this value to replace tabs by spaces in code fragments.
-
-TAB_SIZE = 4
-
-# This tag can be used to specify a number of aliases that acts
-# as commands in the documentation. An alias has the form "name=value".
-# For example adding "sideeffect=\par Side Effects:\n" will allow you to
-# put the command \sideeffect (or @sideeffect) in the documentation, which
-# will result in a user-defined paragraph with heading "Side Effects:".
-# You can put \n's in the value part of an alias to insert newlines.
-
-ALIASES =
-
-# This tag can be used to specify a number of word-keyword mappings (TCL only).
-# A mapping has the form "name=value". For example adding
-# "class=itcl::class" will allow you to use the command class in the
-# itcl::class meaning.
-
-TCL_SUBST =
-
-# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C
-# sources only. Doxygen will then generate output that is more tailored for C.
-# For instance, some of the names that are used will be different. The list
-# of all members will be omitted, etc.
-
-OPTIMIZE_OUTPUT_FOR_C = YES
-
-# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java
-# sources only. Doxygen will then generate output that is more tailored for
-# Java. For instance, namespaces will be presented as packages, qualified
-# scopes will look different, etc.
-
-OPTIMIZE_OUTPUT_JAVA = NO
-
-# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
-# sources only. Doxygen will then generate output that is more tailored for
-# Fortran.
-
-OPTIMIZE_FOR_FORTRAN = NO
-
-# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
-# sources. Doxygen will then generate output that is tailored for
-# VHDL.
-
-OPTIMIZE_OUTPUT_VHDL = NO
-
-# Doxygen selects the parser to use depending on the extension of the files it
-# parses. With this tag you can assign which parser to use for a given
-# extension. Doxygen has a built-in mapping, but you can override or extend it
-# using this tag. The format is ext=language, where ext is a file extension,
-# and language is one of the parsers supported by doxygen: IDL, Java,
-# Javascript, CSharp, C, C++, D, PHP, Objective-C, Python, Fortran, VHDL, C,
-# C++. For instance to make doxygen treat .inc files as Fortran files (default
-# is PHP), and .f files as C (default is Fortran), use: inc=Fortran f=C. Note
-# that for custom extensions you also need to set FILE_PATTERNS otherwise the
-# files are not read by doxygen.
-
-EXTENSION_MAPPING =
-
-# If MARKDOWN_SUPPORT is enabled (the default) then doxygen pre-processes all
-# comments according to the Markdown format, which allows for more readable
-# documentation. See http://daringfireball.net/projects/markdown/ for details.
-# The output of markdown processing is further processed by doxygen, so you
-# can mix doxygen, HTML, and XML commands with Markdown formatting.
-# Disable only in case of backward compatibilities issues.
-
-MARKDOWN_SUPPORT = YES
-
-# When enabled doxygen tries to link words that correspond to documented classes,
-# or namespaces to their corresponding documentation. Such a link can be
-# prevented in individual cases by by putting a % sign in front of the word or
-# globally by setting AUTOLINK_SUPPORT to NO.
-
-AUTOLINK_SUPPORT = YES
-
-# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
-# to include (a tag file for) the STL sources as input, then you should
-# set this tag to YES in order to let doxygen match functions declarations and
-# definitions whose arguments contain STL classes (e.g. func(std::string); v.s.
-# func(std::string) {}). This also makes the inheritance and collaboration
-# diagrams that involve STL classes more complete and accurate.
-
-BUILTIN_STL_SUPPORT = NO
-
-# If you use Microsoft's C++/CLI language, you should set this option to YES to
-# enable parsing support.
-
-CPP_CLI_SUPPORT = NO
-
-# Set the SIP_SUPPORT tag to YES if your project consists of sip sources only.
-# Doxygen will parse them like normal C++ but will assume all classes use public
-# instead of private inheritance when no explicit protection keyword is present.
-
-SIP_SUPPORT = NO
-
-# For Microsoft's IDL there are propget and propput attributes to indicate
-# getter and setter methods for a property. Setting this option to YES (the
-# default) will make doxygen replace the get and set methods by a property in
-# the documentation. This will only work if the methods are indeed getting or
-# setting a simple type. If this is not the case, or you want to show the
-# methods anyway, you should set this option to NO.
-
-IDL_PROPERTY_SUPPORT = YES
-
-# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
-# tag is set to YES, then doxygen will reuse the documentation of the first
-# member in the group (if any) for the other members of the group. By default
-# all members of a group must be documented explicitly.
-
-DISTRIBUTE_GROUP_DOC = NO
-
-# Set the SUBGROUPING tag to YES (the default) to allow class member groups of
-# the same type (for instance a group of public functions) to be put as a
-# subgroup of that type (e.g. under the Public Functions section). Set it to
-# NO to prevent subgrouping. Alternatively, this can be done per class using
-# the \nosubgrouping command.
-
-SUBGROUPING = YES
-
-# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and
-# unions are shown inside the group in which they are included (e.g. using
-# @ingroup) instead of on a separate page (for HTML and Man pages) or
-# section (for LaTeX and RTF).
-
-INLINE_GROUPED_CLASSES = NO
-
-# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and
-# unions with only public data fields will be shown inline in the documentation
-# of the scope in which they are defined (i.e. file, namespace, or group
-# documentation), provided this scope is documented. If set to NO (the default),
-# structs, classes, and unions are shown on a separate page (for HTML and Man
-# pages) or section (for LaTeX and RTF).
-
-INLINE_SIMPLE_STRUCTS = NO
-
-# When TYPEDEF_HIDES_STRUCT is enabled, a typedef of a struct, union, or enum
-# is documented as struct, union, or enum with the name of the typedef. So
-# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
-# with name TypeT. When disabled the typedef will appear as a member of a file,
-# namespace, or class. And the struct will be named TypeS. This can typically
-# be useful for C code in case the coding convention dictates that all compound
-# types are typedef'ed and only the typedef is referenced, never the tag name.
-
-TYPEDEF_HIDES_STRUCT = NO
-
-# The SYMBOL_CACHE_SIZE determines the size of the internal cache use to
-# determine which symbols to keep in memory and which to flush to disk.
-# When the cache is full, less often used symbols will be written to disk.
-# For small to medium size projects (<1000 input files) the default value is
-# probably good enough. For larger projects a too small cache size can cause
-# doxygen to be busy swapping symbols to and from disk most of the time
-# causing a significant performance penalty.
-# If the system has enough physical memory increasing the cache will improve the
-# performance by keeping more symbols in memory. Note that the value works on
-# a logarithmic scale so increasing the size by one will roughly double the
-# memory usage. The cache size is given by this formula:
-# 2^(16+SYMBOL_CACHE_SIZE). The valid range is 0..9, the default is 0,
-# corresponding to a cache size of 2^16 = 65536 symbols.
-
-SYMBOL_CACHE_SIZE = 0
-
-# Similar to the SYMBOL_CACHE_SIZE the size of the symbol lookup cache can be
-# set using LOOKUP_CACHE_SIZE. This cache is used to resolve symbols given
-# their name and scope. Since this can be an expensive process and often the
-# same symbol appear multiple times in the code, doxygen keeps a cache of
-# pre-resolved symbols. If the cache is too small doxygen will become slower.
-# If the cache is too large, memory is wasted. The cache size is given by this
-# formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range is 0..9, the default is 0,
-# corresponding to a cache size of 2^16 = 65536 symbols.
-
-LOOKUP_CACHE_SIZE = 0
-
-#---------------------------------------------------------------------------
-# Build related configuration options
-#---------------------------------------------------------------------------
-
-# If the EXTRACT_ALL tag is set to YES doxygen will assume all entities in
-# documentation are documented, even if no documentation was available.
-# Private class members and static file members will be hidden unless
-# the EXTRACT_PRIVATE and EXTRACT_STATIC tags are set to YES
-
-EXTRACT_ALL = YES
-
-# If the EXTRACT_PRIVATE tag is set to YES all private members of a class
-# will be included in the documentation.
-
-EXTRACT_PRIVATE = NO
-
-# If the EXTRACT_PACKAGE tag is set to YES all members with package or internal
-# scope will be included in the documentation.
-
-EXTRACT_PACKAGE = NO
-
-# If the EXTRACT_STATIC tag is set to YES all static members of a file
-# will be included in the documentation.
-
-EXTRACT_STATIC = NO
-
-# If the EXTRACT_LOCAL_CLASSES tag is set to YES classes (and structs)
-# defined locally in source files will be included in the documentation.
-# If set to NO only classes defined in header files are included.
-
-EXTRACT_LOCAL_CLASSES = YES
-
-# This flag is only useful for Objective-C code. When set to YES local
-# methods, which are defined in the implementation section but not in
-# the interface are included in the documentation.
-# If set to NO (the default) only methods in the interface are included.
-
-EXTRACT_LOCAL_METHODS = NO
-
-# If this flag is set to YES, the members of anonymous namespaces will be
-# extracted and appear in the documentation as a namespace called
-# 'anonymous_namespace{file}', where file will be replaced with the base
-# name of the file that contains the anonymous namespace. By default
-# anonymous namespaces are hidden.
-
-EXTRACT_ANON_NSPACES = NO
-
-# If the HIDE_UNDOC_MEMBERS tag is set to YES, Doxygen will hide all
-# undocumented members of documented classes, files or namespaces.
-# If set to NO (the default) these members will be included in the
-# various overviews, but no documentation section is generated.
-# This option has no effect if EXTRACT_ALL is enabled.
-
-HIDE_UNDOC_MEMBERS = NO
-
-# If the HIDE_UNDOC_CLASSES tag is set to YES, Doxygen will hide all
-# undocumented classes that are normally visible in the class hierarchy.
-# If set to NO (the default) these classes will be included in the various
-# overviews. This option has no effect if EXTRACT_ALL is enabled.
-
-HIDE_UNDOC_CLASSES = NO
-
-# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, Doxygen will hide all
-# friend (class|struct|union) declarations.
-# If set to NO (the default) these declarations will be included in the
-# documentation.
-
-HIDE_FRIEND_COMPOUNDS = NO
-
-# If the HIDE_IN_BODY_DOCS tag is set to YES, Doxygen will hide any
-# documentation blocks found inside the body of a function.
-# If set to NO (the default) these blocks will be appended to the
-# function's detailed documentation block.
-
-HIDE_IN_BODY_DOCS = NO
-
-# The INTERNAL_DOCS tag determines if documentation
-# that is typed after a \internal command is included. If the tag is set
-# to NO (the default) then the documentation will be excluded.
-# Set it to YES to include the internal documentation.
-
-INTERNAL_DOCS = NO
-
-# If the CASE_SENSE_NAMES tag is set to NO then Doxygen will only generate
-# file names in lower-case letters. If set to YES upper-case letters are also
-# allowed. This is useful if you have classes or files whose names only differ
-# in case and if your file system supports case sensitive file names. Windows
-# and Mac users are advised to set this option to NO.
-
-CASE_SENSE_NAMES = NO
-
-# If the HIDE_SCOPE_NAMES tag is set to NO (the default) then Doxygen
-# will show members with their full class and namespace scopes in the
-# documentation. If set to YES the scope will be hidden.
-
-HIDE_SCOPE_NAMES = YES
-
-# If the SHOW_INCLUDE_FILES tag is set to YES (the default) then Doxygen
-# will put a list of the files that are included by a file in the documentation
-# of that file.
-
-SHOW_INCLUDE_FILES = YES
-
-# If the FORCE_LOCAL_INCLUDES tag is set to YES then Doxygen
-# will list include files with double quotes in the documentation
-# rather than with sharp brackets.
-
-FORCE_LOCAL_INCLUDES = NO
-
-# If the INLINE_INFO tag is set to YES (the default) then a tag [inline]
-# is inserted in the documentation for inline members.
-
-INLINE_INFO = YES
-
-# If the SORT_MEMBER_DOCS tag is set to YES (the default) then doxygen
-# will sort the (detailed) documentation of file and class members
-# alphabetically by member name. If set to NO the members will appear in
-# declaration order.
-
-SORT_MEMBER_DOCS = YES
-
-# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the
-# brief documentation of file, namespace and class members alphabetically
-# by member name. If set to NO (the default) the members will appear in
-# declaration order.
-
-SORT_BRIEF_DOCS = NO
-
-# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen
-# will sort the (brief and detailed) documentation of class members so that
-# constructors and destructors are listed first. If set to NO (the default)
-# the constructors will appear in the respective orders defined by
-# SORT_MEMBER_DOCS and SORT_BRIEF_DOCS.
-# This tag will be ignored for brief docs if SORT_BRIEF_DOCS is set to NO
-# and ignored for detailed docs if SORT_MEMBER_DOCS is set to NO.
-
-SORT_MEMBERS_CTORS_1ST = NO
-
-# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the
-# hierarchy of group names into alphabetical order. If set to NO (the default)
-# the group names will appear in their defined order.
-
-SORT_GROUP_NAMES = NO
-
-# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be
-# sorted by fully-qualified names, including namespaces. If set to
-# NO (the default), the class list will be sorted only by class name,
-# not including the namespace part.
-# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
-# Note: This option applies only to the class list, not to the
-# alphabetical list.
-
-SORT_BY_SCOPE_NAME = NO
-
-# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to
-# do proper type resolution of all parameters of a function it will reject a
-# match between the prototype and the implementation of a member function even
-# if there is only one candidate or it is obvious which candidate to choose
-# by doing a simple string match. By disabling STRICT_PROTO_MATCHING doxygen
-# will still accept a match between prototype and implementation in such cases.
-
-STRICT_PROTO_MATCHING = NO
-
-# The GENERATE_TODOLIST tag can be used to enable (YES) or
-# disable (NO) the todo list. This list is created by putting \todo
-# commands in the documentation.
-
-GENERATE_TODOLIST = YES
-
-# The GENERATE_TESTLIST tag can be used to enable (YES) or
-# disable (NO) the test list. This list is created by putting \test
-# commands in the documentation.
-
-GENERATE_TESTLIST = YES
-
-# The GENERATE_BUGLIST tag can be used to enable (YES) or
-# disable (NO) the bug list. This list is created by putting \bug
-# commands in the documentation.
-
-GENERATE_BUGLIST = YES
-
-# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or
-# disable (NO) the deprecated list. This list is created by putting
-# \deprecated commands in the documentation.
-
-GENERATE_DEPRECATEDLIST= YES
-
-# The ENABLED_SECTIONS tag can be used to enable conditional
-# documentation sections, marked by \if sectionname ... \endif.
-
-ENABLED_SECTIONS =
-
-# The MAX_INITIALIZER_LINES tag determines the maximum number of lines
-# the initial value of a variable or macro consists of for it to appear in
-# the documentation. If the initializer consists of more lines than specified
-# here it will be hidden. Use a value of 0 to hide initializers completely.
-# The appearance of the initializer of individual variables and macros in the
-# documentation can be controlled using \showinitializer or \hideinitializer
-# command in the documentation regardless of this setting.
-
-MAX_INITIALIZER_LINES = 30
-
-# Set the SHOW_USED_FILES tag to NO to disable the list of files generated
-# at the bottom of the documentation of classes and structs. If set to YES the
-# list will mention the files that were used to generate the documentation.
-
-SHOW_USED_FILES = YES
-
-# Set the SHOW_FILES tag to NO to disable the generation of the Files page.
-# This will remove the Files entry from the Quick Index and from the
-# Folder Tree View (if specified). The default is YES.
-
-SHOW_FILES = YES
-
-# Set the SHOW_NAMESPACES tag to NO to disable the generation of the
-# Namespaces page. This will remove the Namespaces entry from the Quick Index
-# and from the Folder Tree View (if specified). The default is YES.
-
-SHOW_NAMESPACES = YES
-
-# The FILE_VERSION_FILTER tag can be used to specify a program or script that
-# doxygen should invoke to get the current version for each file (typically from
-# the version control system). Doxygen will invoke the program by executing (via
-# popen()) the command <command> <input-file>, where <command> is the value of
-# the FILE_VERSION_FILTER tag, and <input-file> is the name of an input file
-# provided by doxygen. Whatever the program writes to standard output
-# is used as the file version. See the manual for examples.
-
-FILE_VERSION_FILTER =
-
-# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
-# by doxygen. The layout file controls the global structure of the generated
-# output files in an output format independent way. To create the layout file
-# that represents doxygen's defaults, run doxygen with the -l option.
-# You can optionally specify a file name after the option, if omitted
-# DoxygenLayout.xml will be used as the name of the layout file.
-
-LAYOUT_FILE =
-
-# The CITE_BIB_FILES tag can be used to specify one or more bib files
-# containing the references data. This must be a list of .bib files. The
-# .bib extension is automatically appended if omitted. Using this command
-# requires the bibtex tool to be installed. See also
-# http://en.wikipedia.org/wiki/BibTeX for more info. For LaTeX the style
-# of the bibliography can be controlled using LATEX_BIB_STYLE. To use this
-# feature you need bibtex and perl available in the search path.
-
-CITE_BIB_FILES =
-
-#---------------------------------------------------------------------------
-# configuration options related to warning and progress messages
-#---------------------------------------------------------------------------
-
-# The QUIET tag can be used to turn on/off the messages that are generated
-# by doxygen. Possible values are YES and NO. If left blank NO is used.
-
-QUIET = NO
-
-# The WARNINGS tag can be used to turn on/off the warning messages that are
-# generated by doxygen. Possible values are YES and NO. If left blank
-# NO is used.
-
-WARNINGS = YES
-
-# If WARN_IF_UNDOCUMENTED is set to YES, then doxygen will generate warnings
-# for undocumented members. If EXTRACT_ALL is set to YES then this flag will
-# automatically be disabled.
-
-WARN_IF_UNDOCUMENTED = YES
-
-# If WARN_IF_DOC_ERROR is set to YES, doxygen will generate warnings for
-# potential errors in the documentation, such as not documenting some
-# parameters in a documented function, or documenting parameters that
-# don't exist or using markup commands wrongly.
-
-WARN_IF_DOC_ERROR = YES
-
-# The WARN_NO_PARAMDOC option can be enabled to get warnings for
-# functions that are documented, but have no documentation for their parameters
-# or return value. If set to NO (the default) doxygen will only warn about
-# wrong or incomplete parameter documentation, but not about the absence of
-# documentation.
-
-WARN_NO_PARAMDOC = YES
-
-# The WARN_FORMAT tag determines the format of the warning messages that
-# doxygen can produce. The string should contain the $file, $line, and $text
-# tags, which will be replaced by the file and line number from which the
-# warning originated and the warning text. Optionally the format may contain
-# $version, which will be replaced by the version of the file (if it could
-# be obtained via FILE_VERSION_FILTER)
-
-WARN_FORMAT = "$file:$line: $text"
-
-# The WARN_LOGFILE tag can be used to specify a file to which warning
-# and error messages should be written. If left blank the output is written
-# to stderr.
-
-WARN_LOGFILE =
-
-#---------------------------------------------------------------------------
-# configuration options related to the input files
-#---------------------------------------------------------------------------
-
-# The INPUT tag can be used to specify the files and/or directories that contain
-# documented source files. You may enter file names like "myfile.cpp" or
-# directories like "/usr/src/myproject". Separate the files or directories
-# with spaces.
-
-INPUT = .
-
-# This tag can be used to specify the character encoding of the source files
-# that doxygen parses. Internally doxygen uses the UTF-8 encoding, which is
-# also the default input encoding. Doxygen uses libiconv (or the iconv built
-# into libc) for the transcoding. See http://www.gnu.org/software/libiconv for
-# the list of possible encodings.
-
-INPUT_ENCODING = UTF-8
-
-# If the value of the INPUT tag contains directories, you can use the
-# FILE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp
-# and *.h) to filter out the source-files in the directories. If left
-# blank the following patterns are tested:
-# *.c *.cc *.cxx *.cpp *.c++ *.d *.java *.ii *.ixx *.ipp *.i++ *.inl *.h *.hh
-# *.hxx *.hpp *.h++ *.idl *.odl *.cs *.php *.php3 *.inc *.m *.mm *.dox *.py
-# *.f90 *.f *.for *.vhd *.vhdl
-
-FILE_PATTERNS = *.c \
- *.cpp \
- *.h
-
-# The RECURSIVE tag can be used to turn specify whether or not subdirectories
-# should be searched for input files as well. Possible values are YES and NO.
-# If left blank NO is used.
-
-RECURSIVE = YES
-
-# The EXCLUDE tag can be used to specify files and/or directories that should be
-# excluded from the INPUT source files. This way you can easily exclude a
-# subdirectory from a directory tree whose root is specified with the INPUT tag.
-# Note that relative paths are relative to the directory from which doxygen is
-# run.
-
-EXCLUDE =
-
-# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
-# directories that are symbolic links (a Unix file system feature) are excluded
-# from the input.
-
-EXCLUDE_SYMLINKS = YES
-
-# If the value of the INPUT tag contains directories, you can use the
-# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
-# certain files from those directories. Note that the wildcards are matched
-# against the file with absolute path, so to exclude all test directories
-# for example use the pattern */test/*
-
-EXCLUDE_PATTERNS = *_test[0-9][0-9].c \
- */build/* \
- */CMakeFiles/*
-
-# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
-# (namespaces, classes, functions, etc.) that should be excluded from the
-# output. The symbol name can be a fully qualified name, a word, or if the
-# wildcard * is used, a substring. Examples: ANamespace, AClass,
-# AClass::ANamespace, ANamespace::*Test
-
-EXCLUDE_SYMBOLS =
-
-# The EXAMPLE_PATH tag can be used to specify one or more files or
-# directories that contain example code fragments that are included (see
-# the \include command).
-
-EXAMPLE_PATH =
-
-# If the value of the EXAMPLE_PATH tag contains directories, you can use the
-# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp
-# and *.h) to filter out the source-files in the directories. If left
-# blank all files are included.
-
-EXAMPLE_PATTERNS = *
-
-# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
-# searched for input files to be used with the \include or \dontinclude
-# commands irrespective of the value of the RECURSIVE tag.
-# Possible values are YES and NO. If left blank NO is used.
-
-EXAMPLE_RECURSIVE = NO
-
-# The IMAGE_PATH tag can be used to specify one or more files or
-# directories that contain image that are included in the documentation (see
-# the \image command).
-
-IMAGE_PATH =
-
-# The INPUT_FILTER tag can be used to specify a program that doxygen should
-# invoke to filter for each input file. Doxygen will invoke the filter program
-# by executing (via popen()) the command <filter> <input-file>, where <filter>
-# is the value of the INPUT_FILTER tag, and <input-file> is the name of an
-# input file. Doxygen will then use the output that the filter program writes
-# to standard output. If FILTER_PATTERNS is specified, this tag will be
-# ignored.
-
-INPUT_FILTER =
-
-# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
-# basis. Doxygen will compare the file name with each pattern and apply the
-# filter if there is a match. The filters are a list of the form:
-# pattern=filter (like *.cpp=my_cpp_filter). See INPUT_FILTER for further
-# info on how filters are used. If FILTER_PATTERNS is empty or if
-# non of the patterns match the file name, INPUT_FILTER is applied.
-
-FILTER_PATTERNS =
-
-# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
-# INPUT_FILTER) will be used to filter the input files when producing source
-# files to browse (i.e. when SOURCE_BROWSER is set to YES).
-
-FILTER_SOURCE_FILES = NO
-
-# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
-# pattern. A pattern will override the setting for FILTER_PATTERN (if any)
-# and it is also possible to disable source filtering for a specific pattern
-# using *.ext= (so without naming a filter). This option only has effect when
-# FILTER_SOURCE_FILES is enabled.
-
-FILTER_SOURCE_PATTERNS =
-
-#---------------------------------------------------------------------------
-# configuration options related to source browsing
-#---------------------------------------------------------------------------
-
-# If the SOURCE_BROWSER tag is set to YES then a list of source files will
-# be generated. Documented entities will be cross-referenced with these sources.
-# Note: To get rid of all source code in the generated output, make sure also
-# VERBATIM_HEADERS is set to NO.
-
-SOURCE_BROWSER = YES
-
-# Setting the INLINE_SOURCES tag to YES will include the body
-# of functions and classes directly in the documentation.
-
-INLINE_SOURCES = YES
-
-# Setting the STRIP_CODE_COMMENTS tag to YES (the default) will instruct
-# doxygen to hide any special comment blocks from generated source code
-# fragments. Normal C, C++ and Fortran comments will always remain visible.
-
-STRIP_CODE_COMMENTS = YES
-
-# If the REFERENCED_BY_RELATION tag is set to YES
-# then for each documented function all documented
-# functions referencing it will be listed.
-
-REFERENCED_BY_RELATION = NO
-
-# If the REFERENCES_RELATION tag is set to YES
-# then for each documented function all documented entities
-# called/used by that function will be listed.
-
-REFERENCES_RELATION = NO
-
-# If the REFERENCES_LINK_SOURCE tag is set to YES (the default)
-# and SOURCE_BROWSER tag is set to YES, then the hyperlinks from
-# functions in REFERENCES_RELATION and REFERENCED_BY_RELATION lists will
-# link to the source code. Otherwise they will link to the documentation.
-
-REFERENCES_LINK_SOURCE = YES
-
-# If the USE_HTAGS tag is set to YES then the references to source code
-# will point to the HTML generated by the htags(1) tool instead of doxygen
-# built-in source browser. The htags tool is part of GNU's global source
-# tagging system (see http://www.gnu.org/software/global/global.html). You
-# will need version 4.8.6 or higher.
-
-USE_HTAGS = NO
-
-# If the VERBATIM_HEADERS tag is set to YES (the default) then Doxygen
-# will generate a verbatim copy of the header file for each class for
-# which an include is specified. Set to NO to disable this.
-
-VERBATIM_HEADERS = YES
-
-#---------------------------------------------------------------------------
-# configuration options related to the alphabetical class index
-#---------------------------------------------------------------------------
-
-# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index
-# of all compounds will be generated. Enable this if the project
-# contains a lot of classes, structs, unions or interfaces.
-
-ALPHABETICAL_INDEX = YES
-
-# If the alphabetical index is enabled (see ALPHABETICAL_INDEX) then
-# the COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns
-# in which this list will be split (can be a number in the range [1..20])
-
-COLS_IN_ALPHA_INDEX = 5
-
-# In case all classes in a project start with a common prefix, all
-# classes will be put under the same header in the alphabetical index.
-# The IGNORE_PREFIX tag can be used to specify one or more prefixes that
-# should be ignored while generating the index headers.
-
-IGNORE_PREFIX =
-
-#---------------------------------------------------------------------------
-# configuration options related to the HTML output
-#---------------------------------------------------------------------------
-
-# If the GENERATE_HTML tag is set to YES (the default) Doxygen will
-# generate HTML output.
-
-GENERATE_HTML = YES
-
-# The HTML_OUTPUT tag is used to specify where the HTML docs will be put.
-# If a relative path is entered the value of OUTPUT_DIRECTORY will be
-# put in front of it. If left blank `html' will be used as the default path.
-
-HTML_OUTPUT = html
-
-# The HTML_FILE_EXTENSION tag can be used to specify the file extension for
-# each generated HTML page (for example: .htm,.php,.asp). If it is left blank
-# doxygen will generate files with .html extension.
-
-HTML_FILE_EXTENSION = .html
-
-# The HTML_HEADER tag can be used to specify a personal HTML header for
-# each generated HTML page. If it is left blank doxygen will generate a
-# standard header. Note that when using a custom header you are responsible
-# for the proper inclusion of any scripts and style sheets that doxygen
-# needs, which is dependent on the configuration options used.
-# It is advised to generate a default header using "doxygen -w html
-# header.html footer.html stylesheet.css YourConfigFile" and then modify
-# that header. Note that the header is subject to change so you typically
-# have to redo this when upgrading to a newer version of doxygen or when
-# changing the value of configuration settings such as GENERATE_TREEVIEW!
-
-HTML_HEADER =
-
-# The HTML_FOOTER tag can be used to specify a personal HTML footer for
-# each generated HTML page. If it is left blank doxygen will generate a
-# standard footer.
-
-HTML_FOOTER =
-
-# The HTML_STYLESHEET tag can be used to specify a user-defined cascading
-# style sheet that is used by each HTML page. It can be used to
-# fine-tune the look of the HTML output. If left blank doxygen will
-# generate a default style sheet. Note that it is recommended to use
-# HTML_EXTRA_STYLESHEET instead of this one, as it is more robust and this
-# tag will in the future become obsolete.
-
-HTML_STYLESHEET =
-
-# The HTML_EXTRA_STYLESHEET tag can be used to specify an additional
-# user-defined cascading style sheet that is included after the standard
-# style sheets created by doxygen. Using this option one can overrule
-# certain style aspects. This is preferred over using HTML_STYLESHEET
-# since it does not replace the standard style sheet and is therefor more
-# robust against future updates. Doxygen will copy the style sheet file to
-# the output directory.
-
-HTML_EXTRA_STYLESHEET =
-
-# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
-# other source files which should be copied to the HTML output directory. Note
-# that these files will be copied to the base HTML output directory. Use the
-# $relpath$ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
-# files. In the HTML_STYLESHEET file, use the file name only. Also note that
-# the files will be copied as-is; there are no commands or markers available.
-
-HTML_EXTRA_FILES =
-
-# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output.
-# Doxygen will adjust the colors in the style sheet and background images
-# according to this color. Hue is specified as an angle on a colorwheel,
-# see http://en.wikipedia.org/wiki/Hue for more information.
-# For instance the value 0 represents red, 60 is yellow, 120 is green,
-# 180 is cyan, 240 is blue, 300 purple, and 360 is red again.
-# The allowed range is 0 to 359.
-
-HTML_COLORSTYLE_HUE = 220
-
-# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of
-# the colors in the HTML output. For a value of 0 the output will use
-# grayscales only. A value of 255 will produce the most vivid colors.
-
-HTML_COLORSTYLE_SAT = 34
-
-# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to
-# the luminance component of the colors in the HTML output. Values below
-# 100 gradually make the output lighter, whereas values above 100 make
-# the output darker. The value divided by 100 is the actual gamma applied,
-# so 80 represents a gamma of 0.8, The value 220 represents a gamma of 2.2,
-# and 100 does not change the gamma.
-
-HTML_COLORSTYLE_GAMMA = 174
-
-# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
-# page will contain the date and time when the page was generated. Setting
-# this to NO can help when comparing the output of multiple runs.
-
-HTML_TIMESTAMP = YES
-
-# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
-# documentation will contain sections that can be hidden and shown after the
-# page has loaded.
-
-HTML_DYNAMIC_SECTIONS = NO
-
-# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of
-# entries shown in the various tree structured indices initially; the user
-# can expand and collapse entries dynamically later on. Doxygen will expand
-# the tree to such a level that at most the specified number of entries are
-# visible (unless a fully collapsed tree already exceeds this amount).
-# So setting the number of entries 1 will produce a full collapsed tree by
-# default. 0 is a special value representing an infinite number of entries
-# and will result in a full expanded tree by default.
-
-HTML_INDEX_NUM_ENTRIES = 100
-
-# If the GENERATE_DOCSET tag is set to YES, additional index files
-# will be generated that can be used as input for Apple's Xcode 3
-# integrated development environment, introduced with OSX 10.5 (Leopard).
-# To create a documentation set, doxygen will generate a Makefile in the
-# HTML output directory. Running make will produce the docset in that
-# directory and running "make install" will install the docset in
-# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find
-# it at startup.
-# See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html
-# for more information.
-
-GENERATE_DOCSET = NO
-
-# When GENERATE_DOCSET tag is set to YES, this tag determines the name of the
-# feed. A documentation feed provides an umbrella under which multiple
-# documentation sets from a single provider (such as a company or product suite)
-# can be grouped.
-
-DOCSET_FEEDNAME = "Doxygen generated docs"
-
-# When GENERATE_DOCSET tag is set to YES, this tag specifies a string that
-# should uniquely identify the documentation set bundle. This should be a
-# reverse domain-name style string, e.g. com.mycompany.MyDocSet. Doxygen
-# will append .docset to the name.
-
-DOCSET_BUNDLE_ID = org.doxygen.Project
-
-# When GENERATE_PUBLISHER_ID tag specifies a string that should uniquely
-# identify the documentation publisher. This should be a reverse domain-name
-# style string, e.g. com.mycompany.MyDocSet.documentation.
-
-DOCSET_PUBLISHER_ID = org.doxygen.Publisher
-
-# The GENERATE_PUBLISHER_NAME tag identifies the documentation publisher.
-
-DOCSET_PUBLISHER_NAME = Publisher
-
-# If the GENERATE_HTMLHELP tag is set to YES, additional index files
-# will be generated that can be used as input for tools like the
-# Microsoft HTML help workshop to generate a compiled HTML help file (.chm)
-# of the generated HTML documentation.
-
-GENERATE_HTMLHELP = NO
-
-# If the GENERATE_HTMLHELP tag is set to YES, the CHM_FILE tag can
-# be used to specify the file name of the resulting .chm file. You
-# can add a path in front of the file if the result should not be
-# written to the html output directory.
-
-CHM_FILE =
-
-# If the GENERATE_HTMLHELP tag is set to YES, the HHC_LOCATION tag can
-# be used to specify the location (absolute path including file name) of
-# the HTML help compiler (hhc.exe). If non-empty doxygen will try to run
-# the HTML help compiler on the generated index.hhp.
-
-HHC_LOCATION =
-
-# If the GENERATE_HTMLHELP tag is set to YES, the GENERATE_CHI flag
-# controls if a separate .chi index file is generated (YES) or that
-# it should be included in the master .chm file (NO).
-
-GENERATE_CHI = NO
-
-# If the GENERATE_HTMLHELP tag is set to YES, the CHM_INDEX_ENCODING
-# is used to encode HtmlHelp index (hhk), content (hhc) and project file
-# content.
-
-CHM_INDEX_ENCODING =
-
-# If the GENERATE_HTMLHELP tag is set to YES, the BINARY_TOC flag
-# controls whether a binary table of contents is generated (YES) or a
-# normal table of contents (NO) in the .chm file.
-
-BINARY_TOC = NO
-
-# The TOC_EXPAND flag can be set to YES to add extra items for group members
-# to the contents of the HTML help documentation and to the tree view.
-
-TOC_EXPAND = NO
-
-# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
-# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated
-# that can be used as input for Qt's qhelpgenerator to generate a
-# Qt Compressed Help (.qch) of the generated HTML documentation.
-
-GENERATE_QHP = NO
-
-# If the QHG_LOCATION tag is specified, the QCH_FILE tag can
-# be used to specify the file name of the resulting .qch file.
-# The path specified is relative to the HTML output folder.
-
-QCH_FILE =
-
-# The QHP_NAMESPACE tag specifies the namespace to use when generating
-# Qt Help Project output. For more information please see
-# http://doc.trolltech.com/qthelpproject.html#namespace
-
-QHP_NAMESPACE = org.doxygen.Project
-
-# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating
-# Qt Help Project output. For more information please see
-# http://doc.trolltech.com/qthelpproject.html#virtual-folders
-
-QHP_VIRTUAL_FOLDER = doc
-
-# If QHP_CUST_FILTER_NAME is set, it specifies the name of a custom filter to
-# add. For more information please see
-# http://doc.trolltech.com/qthelpproject.html#custom-filters
-
-QHP_CUST_FILTER_NAME =
-
-# The QHP_CUST_FILT_ATTRS tag specifies the list of the attributes of the
-# custom filter to add. For more information please see
-# <a href="http://doc.trolltech.com/qthelpproject.html#custom-filters">
-# Qt Help Project / Custom Filters</a>.
-
-QHP_CUST_FILTER_ATTRS =
-
-# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
-# project's
-# filter section matches.
-# <a href="http://doc.trolltech.com/qthelpproject.html#filter-attributes">
-# Qt Help Project / Filter Attributes</a>.
-
-QHP_SECT_FILTER_ATTRS =
-
-# If the GENERATE_QHP tag is set to YES, the QHG_LOCATION tag can
-# be used to specify the location of Qt's qhelpgenerator.
-# If non-empty doxygen will try to run qhelpgenerator on the generated
-# .qhp file.
-
-QHG_LOCATION =
-
-# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files
-# will be generated, which together with the HTML files, form an Eclipse help
-# plugin. To install this plugin and make it available under the help contents
-# menu in Eclipse, the contents of the directory containing the HTML and XML
-# files needs to be copied into the plugins directory of eclipse. The name of
-# the directory within the plugins directory should be the same as
-# the ECLIPSE_DOC_ID value. After copying Eclipse needs to be restarted before
-# the help appears.
-
-GENERATE_ECLIPSEHELP = NO
-
-# A unique identifier for the eclipse help plugin. When installing the plugin
-# the directory name containing the HTML and XML files should also have
-# this name.
-
-ECLIPSE_DOC_ID = org.doxygen.Project
-
-# The DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs)
-# at top of each HTML page. The value NO (the default) enables the index and
-# the value YES disables it. Since the tabs have the same information as the
-# navigation tree you can set this option to NO if you already set
-# GENERATE_TREEVIEW to YES.
-
-DISABLE_INDEX = NO
-
-# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
-# structure should be generated to display hierarchical information.
-# If the tag value is set to YES, a side panel will be generated
-# containing a tree-like index structure (just like the one that
-# is generated for HTML Help). For this to work a browser that supports
-# JavaScript, DHTML, CSS and frames is required (i.e. any modern browser).
-# Windows users are probably better off using the HTML help feature.
-# Since the tree basically has the same information as the tab index you
-# could consider to set DISABLE_INDEX to NO when enabling this option.
-
-GENERATE_TREEVIEW = YES
-
-# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values
-# (range [0,1..20]) that doxygen will group on one line in the generated HTML
-# documentation. Note that a value of 0 will completely suppress the enum
-# values from appearing in the overview section.
-
-ENUM_VALUES_PER_LINE = 4
-
-# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be
-# used to set the initial width (in pixels) of the frame in which the tree
-# is shown.
-
-TREEVIEW_WIDTH = 250
-
-# When the EXT_LINKS_IN_WINDOW option is set to YES doxygen will open
-# links to external symbols imported via tag files in a separate window.
-
-EXT_LINKS_IN_WINDOW = NO
-
-# Use this tag to change the font size of Latex formulas included
-# as images in the HTML documentation. The default is 10. Note that
-# when you change the font size after a successful doxygen run you need
-# to manually remove any form_*.png images from the HTML output directory
-# to force them to be regenerated.
-
-FORMULA_FONTSIZE = 10
-
-# Use the FORMULA_TRANPARENT tag to determine whether or not the images
-# generated for formulas are transparent PNGs. Transparent PNGs are
-# not supported properly for IE 6.0, but are supported on all modern browsers.
-# Note that when changing this option you need to delete any form_*.png files
-# in the HTML output before the changes have effect.
-
-FORMULA_TRANSPARENT = YES
-
-# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax
-# (see http://www.mathjax.org) which uses client side Javascript for the
-# rendering instead of using prerendered bitmaps. Use this if you do not
-# have LaTeX installed or if you want to formulas look prettier in the HTML
-# output. When enabled you may also need to install MathJax separately and
-# configure the path to it using the MATHJAX_RELPATH option.
-
-USE_MATHJAX = NO
-
-# When MathJax is enabled you need to specify the location relative to the
-# HTML output directory using the MATHJAX_RELPATH option. The destination
-# directory should contain the MathJax.js script. For instance, if the mathjax
-# directory is located at the same level as the HTML output directory, then
-# MATHJAX_RELPATH should be ../mathjax. The default value points to
-# the MathJax Content Delivery Network so you can quickly see the result without
-# installing MathJax. However, it is strongly recommended to install a local
-# copy of MathJax from http://www.mathjax.org before deployment.
-
-MATHJAX_RELPATH = http://cdn.mathjax.org/mathjax/latest
-
-# The MATHJAX_EXTENSIONS tag can be used to specify one or MathJax extension
-# names that should be enabled during MathJax rendering.
-
-MATHJAX_EXTENSIONS =
-
-# When the SEARCHENGINE tag is enabled doxygen will generate a search box
-# for the HTML output. The underlying search engine uses javascript
-# and DHTML and should work on any modern browser. Note that when using
-# HTML help (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets
-# (GENERATE_DOCSET) there is already a search function so this one should
-# typically be disabled. For large projects the javascript based search engine
-# can be slow, then enabling SERVER_BASED_SEARCH may provide a better solution.
-
-SEARCHENGINE = YES
-
-# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
-# implemented using a PHP enabled web server instead of at the web client
-# using Javascript. Doxygen will generate the search PHP script and index
-# file to put on the web server. The advantage of the server
-# based approach is that it scales better to large projects and allows
-# full text search. The disadvantages are that it is more difficult to setup
-# and does not have live searching capabilities.
-
-SERVER_BASED_SEARCH = NO
-
-#---------------------------------------------------------------------------
-# configuration options related to the LaTeX output
-#---------------------------------------------------------------------------
-
-# If the GENERATE_LATEX tag is set to YES (the default) Doxygen will
-# generate Latex output.
-
-GENERATE_LATEX = NO
-
-# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put.
-# If a relative path is entered the value of OUTPUT_DIRECTORY will be
-# put in front of it. If left blank `latex' will be used as the default path.
-
-LATEX_OUTPUT = latex
-
-# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
-# invoked. If left blank `latex' will be used as the default command name.
-# Note that when enabling USE_PDFLATEX this option is only used for
-# generating bitmaps for formulas in the HTML output, but not in the
-# Makefile that is written to the output directory.
-
-LATEX_CMD_NAME = latex
-
-# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to
-# generate index for LaTeX. If left blank `makeindex' will be used as the
-# default command name.
-
-MAKEINDEX_CMD_NAME = makeindex
-
-# If the COMPACT_LATEX tag is set to YES Doxygen generates more compact
-# LaTeX documents. This may be useful for small projects and may help to
-# save some trees in general.
-
-COMPACT_LATEX = NO
-
-# The PAPER_TYPE tag can be used to set the paper type that is used
-# by the printer. Possible values are: a4, letter, legal and
-# executive. If left blank a4wide will be used.
-
-PAPER_TYPE = a4
-
-# The EXTRA_PACKAGES tag can be to specify one or more names of LaTeX
-# packages that should be included in the LaTeX output.
-
-EXTRA_PACKAGES =
-
-# The LATEX_HEADER tag can be used to specify a personal LaTeX header for
-# the generated latex document. The header should contain everything until
-# the first chapter. If it is left blank doxygen will generate a
-# standard header. Notice: only use this tag if you know what you are doing!
-
-LATEX_HEADER =
-
-# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for
-# the generated latex document. The footer should contain everything after
-# the last chapter. If it is left blank doxygen will generate a
-# standard footer. Notice: only use this tag if you know what you are doing!
-
-LATEX_FOOTER =
-
-# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated
-# is prepared for conversion to pdf (using ps2pdf). The pdf file will
-# contain links (just like the HTML output) instead of page references
-# This makes the output suitable for online browsing using a pdf viewer.
-
-PDF_HYPERLINKS = YES
-
-# If the USE_PDFLATEX tag is set to YES, pdflatex will be used instead of
-# plain latex in the generated Makefile. Set this option to YES to get a
-# higher quality PDF documentation.
-
-USE_PDFLATEX = YES
-
-# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \\batchmode.
-# command to the generated LaTeX files. This will instruct LaTeX to keep
-# running if errors occur, instead of asking the user for help.
-# This option is also used when generating formulas in HTML.
-
-LATEX_BATCHMODE = NO
-
-# If LATEX_HIDE_INDICES is set to YES then doxygen will not
-# include the index chapters (such as File Index, Compound Index, etc.)
-# in the output.
-
-LATEX_HIDE_INDICES = NO
-
-# If LATEX_SOURCE_CODE is set to YES then doxygen will include
-# source code with syntax highlighting in the LaTeX output.
-# Note that which sources are shown also depends on other settings
-# such as SOURCE_BROWSER.
-
-LATEX_SOURCE_CODE = NO
-
-# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
-# bibliography, e.g. plainnat, or ieeetr. The default style is "plain". See
-# http://en.wikipedia.org/wiki/BibTeX for more info.
-
-LATEX_BIB_STYLE = plain
-
-#---------------------------------------------------------------------------
-# configuration options related to the RTF output
-#---------------------------------------------------------------------------
-
-# If the GENERATE_RTF tag is set to YES Doxygen will generate RTF output
-# The RTF output is optimized for Word 97 and may not look very pretty with
-# other RTF readers or editors.
-
-GENERATE_RTF = NO
-
-# The RTF_OUTPUT tag is used to specify where the RTF docs will be put.
-# If a relative path is entered the value of OUTPUT_DIRECTORY will be
-# put in front of it. If left blank `rtf' will be used as the default path.
-
-RTF_OUTPUT = rtf
-
-# If the COMPACT_RTF tag is set to YES Doxygen generates more compact
-# RTF documents. This may be useful for small projects and may help to
-# save some trees in general.
-
-COMPACT_RTF = NO
-
-# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated
-# will contain hyperlink fields. The RTF file will
-# contain links (just like the HTML output) instead of page references.
-# This makes the output suitable for online browsing using WORD or other
-# programs which support those fields.
-# Note: wordpad (write) and others do not support links.
-
-RTF_HYPERLINKS = NO
-
-# Load style sheet definitions from file. Syntax is similar to doxygen's
-# config file, i.e. a series of assignments. You only have to provide
-# replacements, missing definitions are set to their default value.
-
-RTF_STYLESHEET_FILE =
-
-# Set optional variables used in the generation of an rtf document.
-# Syntax is similar to doxygen's config file.
-
-RTF_EXTENSIONS_FILE =
-
-#---------------------------------------------------------------------------
-# configuration options related to the man page output
-#---------------------------------------------------------------------------
-
-# If the GENERATE_MAN tag is set to YES (the default) Doxygen will
-# generate man pages
-
-GENERATE_MAN = NO
-
-# The MAN_OUTPUT tag is used to specify where the man pages will be put.
-# If a relative path is entered the value of OUTPUT_DIRECTORY will be
-# put in front of it. If left blank `man' will be used as the default path.
-
-MAN_OUTPUT = man
-
-# The MAN_EXTENSION tag determines the extension that is added to
-# the generated man pages (default is the subroutine's section .3)
-
-MAN_EXTENSION = .3
-
-# If the MAN_LINKS tag is set to YES and Doxygen generates man output,
-# then it will generate one additional man file for each entity
-# documented in the real man page(s). These additional files
-# only source the real man page, but without them the man command
-# would be unable to find the correct page. The default is NO.
-
-MAN_LINKS = NO
-
-#---------------------------------------------------------------------------
-# configuration options related to the XML output
-#---------------------------------------------------------------------------
-
-# If the GENERATE_XML tag is set to YES Doxygen will
-# generate an XML file that captures the structure of
-# the code including all documentation.
-
-GENERATE_XML = NO
-
-# The XML_OUTPUT tag is used to specify where the XML pages will be put.
-# If a relative path is entered the value of OUTPUT_DIRECTORY will be
-# put in front of it. If left blank `xml' will be used as the default path.
-
-XML_OUTPUT = xml
-
-# The XML_SCHEMA tag can be used to specify an XML schema,
-# which can be used by a validating XML parser to check the
-# syntax of the XML files.
-
-XML_SCHEMA =
-
-# The XML_DTD tag can be used to specify an XML DTD,
-# which can be used by a validating XML parser to check the
-# syntax of the XML files.
-
-XML_DTD =
-
-# If the XML_PROGRAMLISTING tag is set to YES Doxygen will
-# dump the program listings (including syntax highlighting
-# and cross-referencing information) to the XML output. Note that
-# enabling this will significantly increase the size of the XML output.
-
-XML_PROGRAMLISTING = YES
-
-#---------------------------------------------------------------------------
-# configuration options for the AutoGen Definitions output
-#---------------------------------------------------------------------------
-
-# If the GENERATE_AUTOGEN_DEF tag is set to YES Doxygen will
-# generate an AutoGen Definitions (see autogen.sf.net) file
-# that captures the structure of the code including all
-# documentation. Note that this feature is still experimental
-# and incomplete at the moment.
-
-GENERATE_AUTOGEN_DEF = NO
-
-#---------------------------------------------------------------------------
-# configuration options related to the Perl module output
-#---------------------------------------------------------------------------
-
-# If the GENERATE_PERLMOD tag is set to YES Doxygen will
-# generate a Perl module file that captures the structure of
-# the code including all documentation. Note that this
-# feature is still experimental and incomplete at the
-# moment.
-
-GENERATE_PERLMOD = NO
-
-# If the PERLMOD_LATEX tag is set to YES Doxygen will generate
-# the necessary Makefile rules, Perl scripts and LaTeX code to be able
-# to generate PDF and DVI output from the Perl module output.
-
-PERLMOD_LATEX = NO
-
-# If the PERLMOD_PRETTY tag is set to YES the Perl module output will be
-# nicely formatted so it can be parsed by a human reader. This is useful
-# if you want to understand what is going on. On the other hand, if this
-# tag is set to NO the size of the Perl module output will be much smaller
-# and Perl will parse it just the same.
-
-PERLMOD_PRETTY = YES
-
-# The names of the make variables in the generated doxyrules.make file
-# are prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX.
-# This is useful so different doxyrules.make files included by the same
-# Makefile don't overwrite each other's variables.
-
-PERLMOD_MAKEVAR_PREFIX =
-
-#---------------------------------------------------------------------------
-# Configuration options related to the preprocessor
-#---------------------------------------------------------------------------
-
-# If the ENABLE_PREPROCESSING tag is set to YES (the default) Doxygen will
-# evaluate all C-preprocessor directives found in the sources and include
-# files.
-
-ENABLE_PREPROCESSING = YES
-
-# If the MACRO_EXPANSION tag is set to YES Doxygen will expand all macro
-# names in the source code. If set to NO (the default) only conditional
-# compilation will be performed. Macro expansion can be done in a controlled
-# way by setting EXPAND_ONLY_PREDEF to YES.
-
-MACRO_EXPANSION = NO
-
-# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES
-# then the macro expansion is limited to the macros specified with the
-# PREDEFINED and EXPAND_AS_DEFINED tags.
-
-EXPAND_ONLY_PREDEF = NO
-
-# If the SEARCH_INCLUDES tag is set to YES (the default) the includes files
-# pointed to by INCLUDE_PATH will be searched when a #include is found.
-
-SEARCH_INCLUDES = YES
-
-# The INCLUDE_PATH tag can be used to specify one or more directories that
-# contain include files that are not input files but should be processed by
-# the preprocessor.
-
-INCLUDE_PATH =
-
-# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
-# patterns (like *.h and *.hpp) to filter out the header-files in the
-# directories. If left blank, the patterns specified with FILE_PATTERNS will
-# be used.
-
-INCLUDE_FILE_PATTERNS =
-
-# The PREDEFINED tag can be used to specify one or more macro names that
-# are defined before the preprocessor is started (similar to the -D option of
-# gcc). The argument of the tag is a list of macros of the form: name
-# or name=definition (no spaces). If the definition and the = are
-# omitted =1 is assumed. To prevent a macro definition from being
-# undefined via #undef or recursively expanded use the := operator
-# instead of the = operator.
-
-PREDEFINED =
-
-# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then
-# this tag can be used to specify a list of macro names that should be expanded.
-# The macro definition that is found in the sources will be used.
-# Use the PREDEFINED tag if you want to use a different macro definition that
-# overrules the definition found in the source code.
-
-EXPAND_AS_DEFINED =
-
-# If the SKIP_FUNCTION_MACROS tag is set to YES (the default) then
-# doxygen's preprocessor will remove all references to function-like macros
-# that are alone on a line, have an all uppercase name, and do not end with a
-# semicolon, because these will confuse the parser if not removed.
-
-SKIP_FUNCTION_MACROS = YES
-
-#---------------------------------------------------------------------------
-# Configuration::additions related to external references
-#---------------------------------------------------------------------------
-
-# The TAGFILES option can be used to specify one or more tagfiles. For each
-# tag file the location of the external documentation should be added. The
-# format of a tag file without this location is as follows:
-# TAGFILES = file1 file2 ...
-# Adding location for the tag files is done as follows:
-# TAGFILES = file1=loc1 "file2 = loc2" ...
-# where "loc1" and "loc2" can be relative or absolute paths
-# or URLs. Note that each tag file must have a unique name (where the name does
-# NOT include the path). If a tag file is not located in the directory in which
-# doxygen is run, you must also specify the path to the tagfile here.
-
-TAGFILES =
-
-# When a file name is specified after GENERATE_TAGFILE, doxygen will create
-# a tag file that is based on the input files it reads.
-
-GENERATE_TAGFILE =
-
-# If the ALLEXTERNALS tag is set to YES all external classes will be listed
-# in the class index. If set to NO only the inherited external classes
-# will be listed.
-
-ALLEXTERNALS = NO
-
-# If the EXTERNAL_GROUPS tag is set to YES all external groups will be listed
-# in the modules index. If set to NO, only the current project's groups will
-# be listed.
-
-EXTERNAL_GROUPS = YES
-
-# The PERL_PATH should be the absolute path and name of the perl script
-# interpreter (i.e. the result of `which perl').
-
-PERL_PATH = /usr/bin/perl
-
-#---------------------------------------------------------------------------
-# Configuration options related to the dot tool
-#---------------------------------------------------------------------------
-
-# If the CLASS_DIAGRAMS tag is set to YES (the default) Doxygen will
-# generate a inheritance diagram (in HTML, RTF and LaTeX) for classes with base
-# or super classes. Setting the tag to NO turns the diagrams off. Note that
-# this option also works with HAVE_DOT disabled, but it is recommended to
-# install and use dot, since it yields more powerful graphs.
-
-CLASS_DIAGRAMS = YES
-
-# You can define message sequence charts within doxygen comments using the \msc
-# command. Doxygen will then run the mscgen tool (see
-# http://www.mcternan.me.uk/mscgen/) to produce the chart and insert it in the
-# documentation. The MSCGEN_PATH tag allows you to specify the directory where
-# the mscgen tool resides. If left empty the tool is assumed to be found in the
-# default search path.
-
-MSCGEN_PATH =
-
-# If set to YES, the inheritance and collaboration graphs will hide
-# inheritance and usage relations if the target is undocumented
-# or is not a class.
-
-HIDE_UNDOC_RELATIONS = YES
-
-# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
-# available from the path. This tool is part of Graphviz, a graph visualization
-# toolkit from AT&T and Lucent Bell Labs. The other options in this section
-# have no effect if this option is set to NO (the default)
-
-HAVE_DOT = NO
-
-# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is
-# allowed to run in parallel. When set to 0 (the default) doxygen will
-# base this on the number of processors available in the system. You can set it
-# explicitly to a value larger than 0 to get control over the balance
-# between CPU load and processing speed.
-
-DOT_NUM_THREADS = 0
-
-# By default doxygen will use the Helvetica font for all dot files that
-# doxygen generates. When you want a differently looking font you can specify
-# the font name using DOT_FONTNAME. You need to make sure dot is able to find
-# the font, which can be done by putting it in a standard location or by setting
-# the DOTFONTPATH environment variable or by setting DOT_FONTPATH to the
-# directory containing the font.
-
-DOT_FONTNAME = Helvetica
-
-# The DOT_FONTSIZE tag can be used to set the size of the font of dot graphs.
-# The default size is 10pt.
-
-DOT_FONTSIZE = 10
-
-# By default doxygen will tell dot to use the Helvetica font.
-# If you specify a different font using DOT_FONTNAME you can use DOT_FONTPATH to
-# set the path where dot can find it.
-
-DOT_FONTPATH =
-
-# If the CLASS_GRAPH and HAVE_DOT tags are set to YES then doxygen
-# will generate a graph for each documented class showing the direct and
-# indirect inheritance relations. Setting this tag to YES will force the
-# CLASS_DIAGRAMS tag to NO.
-
-CLASS_GRAPH = YES
-
-# If the COLLABORATION_GRAPH and HAVE_DOT tags are set to YES then doxygen
-# will generate a graph for each documented class showing the direct and
-# indirect implementation dependencies (inheritance, containment, and
-# class references variables) of the class with other documented classes.
-
-COLLABORATION_GRAPH = YES
-
-# If the GROUP_GRAPHS and HAVE_DOT tags are set to YES then doxygen
-# will generate a graph for groups, showing the direct groups dependencies
-
-GROUP_GRAPHS = YES
-
-# If the UML_LOOK tag is set to YES doxygen will generate inheritance and
-# collaboration diagrams in a style similar to the OMG's Unified Modeling
-# Language.
-
-UML_LOOK = NO
-
-# If the UML_LOOK tag is enabled, the fields and methods are shown inside
-# the class node. If there are many fields or methods and many nodes the
-# graph may become too big to be useful. The UML_LIMIT_NUM_FIELDS
-# threshold limits the number of items for each type to make the size more
-# managable. Set this to 0 for no limit. Note that the threshold may be
-# exceeded by 50% before the limit is enforced.
-
-UML_LIMIT_NUM_FIELDS = 10
-
-# If set to YES, the inheritance and collaboration graphs will show the
-# relations between templates and their instances.
-
-TEMPLATE_RELATIONS = NO
-
-# If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDE_GRAPH, and HAVE_DOT
-# tags are set to YES then doxygen will generate a graph for each documented
-# file showing the direct and indirect include dependencies of the file with
-# other documented files.
-
-INCLUDE_GRAPH = YES
-
-# If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDED_BY_GRAPH, and
-# HAVE_DOT tags are set to YES then doxygen will generate a graph for each
-# documented header file showing the documented files that directly or
-# indirectly include this file.
-
-INCLUDED_BY_GRAPH = YES
-
-# If the CALL_GRAPH and HAVE_DOT options are set to YES then
-# doxygen will generate a call dependency graph for every global function
-# or class method. Note that enabling this option will significantly increase
-# the time of a run. So in most cases it will be better to enable call graphs
-# for selected functions only using the \callgraph command.
-
-CALL_GRAPH = NO
-
-# If the CALLER_GRAPH and HAVE_DOT tags are set to YES then
-# doxygen will generate a caller dependency graph for every global function
-# or class method. Note that enabling this option will significantly increase
-# the time of a run. So in most cases it will be better to enable caller
-# graphs for selected functions only using the \callergraph command.
-
-CALLER_GRAPH = NO
-
-# If the GRAPHICAL_HIERARCHY and HAVE_DOT tags are set to YES then doxygen
-# will generate a graphical hierarchy of all classes instead of a textual one.
-
-GRAPHICAL_HIERARCHY = YES
-
-# If the DIRECTORY_GRAPH and HAVE_DOT tags are set to YES
-# then doxygen will show the dependencies a directory has on other directories
-# in a graphical way. The dependency relations are determined by the #include
-# relations between the files in the directories.
-
-DIRECTORY_GRAPH = YES
-
-# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
-# generated by dot. Possible values are svg, png, jpg, or gif.
-# If left blank png will be used. If you choose svg you need to set
-# HTML_FILE_EXTENSION to xhtml in order to make the SVG files
-# visible in IE 9+ (other browsers do not have this requirement).
-
-DOT_IMAGE_FORMAT = png
-
-# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
-# enable generation of interactive SVG images that allow zooming and panning.
-# Note that this requires a modern browser other than Internet Explorer.
-# Tested and working are Firefox, Chrome, Safari, and Opera. For IE 9+ you
-# need to set HTML_FILE_EXTENSION to xhtml in order to make the SVG files
-# visible. Older versions of IE do not have SVG support.
-
-INTERACTIVE_SVG = NO
-
-# The tag DOT_PATH can be used to specify the path where the dot tool can be
-# found. If left blank, it is assumed the dot tool can be found in the path.
-
-DOT_PATH =
-
-# The DOTFILE_DIRS tag can be used to specify one or more directories that
-# contain dot files that are included in the documentation (see the
-# \dotfile command).
-
-DOTFILE_DIRS =
-
-# The MSCFILE_DIRS tag can be used to specify one or more directories that
-# contain msc files that are included in the documentation (see the
-# \mscfile command).
-
-MSCFILE_DIRS =
-
-# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of
-# nodes that will be shown in the graph. If the number of nodes in a graph
-# becomes larger than this value, doxygen will truncate the graph, which is
-# visualized by representing a node as a red box. Note that doxygen if the
-# number of direct children of the root node in a graph is already larger than
-# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note
-# that the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
-
-DOT_GRAPH_MAX_NODES = 50
-
-# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the
-# graphs generated by dot. A depth value of 3 means that only nodes reachable
-# from the root by following a path via at most 3 edges will be shown. Nodes
-# that lay further from the root node will be omitted. Note that setting this
-# option to 1 or 2 may greatly reduce the computation time needed for large
-# code bases. Also note that the size of a graph can be further restricted by
-# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
-
-MAX_DOT_GRAPH_DEPTH = 0
-
-# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
-# background. This is disabled by default, because dot on Windows does not
-# seem to support this out of the box. Warning: Depending on the platform used,
-# enabling this option may lead to badly anti-aliased labels on the edges of
-# a graph (i.e. they become hard to read).
-
-DOT_TRANSPARENT = NO
-
-# Set the DOT_MULTI_TARGETS tag to YES allow dot to generate multiple output
-# files in one run (i.e. multiple -o and -T options on the command line). This
-# makes dot run faster, but since only newer versions of dot (>1.8.10)
-# support this, this feature is disabled by default.
-
-DOT_MULTI_TARGETS = NO
-
-# If the GENERATE_LEGEND tag is set to YES (the default) Doxygen will
-# generate a legend page explaining the meaning of the various boxes and
-# arrows in the dot generated graphs.
-
-GENERATE_LEGEND = YES
-
-# If the DOT_CLEANUP tag is set to YES (the default) Doxygen will
-# remove the intermediate dot files that are used to generate
-# the various graphs.
-
-DOT_CLEANUP = YES
+++ /dev/null
- DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
- Version 2, December 2004
-
-Copyright (C) 2013 Adrien Oliva <adrien.oliva@yapbreak.fr>
-
-Everyone is permitted to copy and distribute verbatim or modified
-copies of this license document, and changing it is allowed as long
-as the name is changed.
-
- DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
- TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
-
- 0. You just DO WHAT THE FUCK YOU WANT TO.
-
+++ /dev/null
-.PHONY: all doc test help
-
-all:
- @(cd libavl && $(MAKE) $@)
-
-doc:
- @(doxygen Doxyfile)
-
-test:
- @(cd libavl && $(MAKE) test)
-
-help:
- @(echo "Usage:")
- @(echo "")
- @(echo "make all build libavl library.")
- @(echo "make doc build in-source documentation for libavl.")
- @(echo "make test build tests for libavl.")
- @(echo "make help show this help.")
- @(echo "")
- @(echo "For more information and more make function, run")
- @(echo " $$ cd libavl && make help")
+++ /dev/null
-libavl
-======
-
-Libavl is a library to manage AVL structure to store and organize
-everykind of data. You just need to implement function to compare,
-to desallocate and to print your structure.
-
-Please report bug at <adrien.oliva@yapbreak.fr>
-
-Tracker on http://redmine.yapbreak.fr
-
-Licence
-=======
-
-This work is published under the term of WTF-PL. You can find a copy
-of licence term in LICENSE file.
+++ /dev/null
-- Put install script in Makefile
+++ /dev/null
-# Example of Makefile to build program using libavl shared library
-
-.PHONY: all clean distclean
-
-all: ../libavl/libavl.so example.x
-
-# Be sure that libavl is compiled
-../libavl/libavl.so:
- @(cd ../libavl/ && $(MAKE))
-
-example.o: example.c
- gcc -o example.o -c example.c -I../libavl/
-
-example.x: example.o
- gcc -o example.x -L../libavl/ example.o -lavl
- @(echo "Before run, add \"../libavl/\" to your LD_LIBRARY_PATH env var.")
-
-clean:
- rm example.x
-
-distclean: clean
- rm example.o
-
+++ /dev/null
-/****************************************************************************************
- DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
- Version 2, December 2004
-
-Copyright (C) 2013 Adrien Oliva <adrien.oliva@yapbreak.fr>
-
-Everyone is permitted to copy and distribute verbatim or modified
-copies of this license document, and changing it is allowed as long
-as the name is changed.
-
- DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
- TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
-
- 0. You just DO WHAT THE FUCK YOU WANT TO.
-****************************************************************************************/
-#include <stdlib.h>
-#include <stdio.h>
-#include "avl.h"
-
-// Structure we want to store
-// key is used to order data
-struct data {
- int key;
- int value;
-};
-
-// Function that compares two struct data
-int data_cmp(void *a, void *b)
-{
- struct data *aa = (struct data *) a;
- struct data *bb = (struct data *) b;
-
- // Protect against NULL pointer
- // It could generally never happened
- if (!aa || !bb)
- return 0;
-
- return aa->key - bb->key;
-}
-
-// Function that dumps data structure
-void data_print(void *d)
-{
- struct data *dd = (struct data *) d;
-
- if (dd)
- printf("{ %d => %d }\n", dd->key, dd->value);
-}
-
-// Function that delete a data structure
-void data_delete(void *d)
-{
- struct data *dd = (struct data *) d;
-
- if (dd) {
- // You can put here all additional needed
- // memory deallocation
- free(dd);
- }
-}
-
-// Function that copy data structure
-void data_copy(void *src, void *dst)
-{
- struct data *s = (struct data *) src;
- struct data *d = (struct data *) dst;
-
- d->key = s->key;
- d->value = s->value;
-}
-
-int main(int argc, char **argv)
-{
- tree *avl_tree = NULL;
- struct data tmp;
- unsigned result;
-
- (void) argc;
- (void) argv;
-
- // Initialize a new tree with our three previously defined
- // functions to store data structure.
- avl_tree = init_dictionnary(data_cmp, data_print, data_delete, data_copy);
-
- tmp.key = 42;
- tmp.value = 4242;
-
- // Add element {42, 4242} in our tree.
- result = insert_elmt(avl_tree, &tmp, sizeof(struct data));
- // Here result is equal to 1 since there is only 1 element in tree.
- printf("Result after first insert: %d\n", result);
-
- // Dump tree to stdout with data_print function
- print_tree(avl_tree);
-
- // For all search function, the only value needed in tmp structure
- // is key field.
- tmp.key = 20;
- tmp.value = 0;
-
- if (!is_present(avl_tree, &tmp))
- printf("Key 20 is not found.\n");
-
- tmp.key = 42;
- if (is_present(avl_tree, &tmp))
- printf("Key 42 exist in tree.\n");
-
- if (get_data(avl_tree, &tmp, sizeof(struct data)))
- printf("Now, tmp.key is equal to 4242\n");
-
- delete_node(avl_tree, &tmp);
- if (!is_present(avl_tree, &tmp))
- printf("Key 42 does not exist anymore.\n");
-
- // Free all memory
- delete_tree(avl_tree);
-
- return 0;
-}
-
-
+++ /dev/null
-# ======================================================================================
-# File : Makefile
-# Author : Adrien Oliva
-# Last Change : 01/02/2013 | 10:16:07 AM | Wednesday,January
-# Description : Build script for LibAvl library
-# ======================================================================================
-
-# DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
-# Version 2, December 2004
-#
-# Copyright (C) 2013 Adrien Oliva <adrien.oliva@yapbreak.fr>
-#
-# Everyone is permitted to copy and distribute verbatim or modified
-# copies of this license document, and changing it is allowed as long
-# as the name is changed.
-#
-# DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
-# TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
-#
-# 0. You just DO WHAT THE FUCK YOU WANT TO.
-
-TARGET = libavl.so
-
-include Makefile.global
-
-# Link
-libavl.so: avl.lo
-
-# Dependencies
-avl.o: avl.h syslog.h
-avl.lo: avl.h syslog.h
-
+++ /dev/null
-# ======================================================================================
-# File : Makefile
-# Author : Adrien Oliva
-# Last Change : 01/02/2013 | 10:16:07 AM | Wednesday,January
-# Description : Build script for LibAvl library
-# ======================================================================================
-
-# DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
-# Version 2, December 2004
-#
-# Copyright (C) 2013 Adrien Oliva <adrien.oliva@yapbreak.fr>
-#
-# Everyone is permitted to copy and distribute verbatim or modified
-# copies of this license document, and changing it is allowed as long
-# as the name is changed.
-#
-# DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
-# TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
-#
-# 0. You just DO WHAT THE FUCK YOU WANT TO.
-
-###############################################################################
-# Debug level, piloting by LOGLEVEL variable
-# To set a LOGLEVEL at compilation time, use the following command:
-# make LOGLEVEL=<var>
-# where <var> is
-# 0 none
-# 1 error log
-# 2 warning log
-# 3 info log
-# 4 debug log
-# 5 enter function log
-#
-# by default, LOGLEVEL=5
-ifndef LOGLEVEL
-LOGLEVEL = 5
-endif
-
-
-###############################################################################
-# Set default options
-ifndef RANDOM
-RANDOM = 1
-endif
-ifndef COLOR
-COLOR = 1
-endif
-ifndef COVERAGE
-COVERAGE = 1
-endif
-ifndef PROFILE
-PROFILE = 1
-endif
-###############################################################################
-
-CC = gcc
-CXX = g++
-LD = g++
-
-DEBUG = -ggdb3 \
- -O0 \
- -W \
- -Wall \
- -Wextra \
- -Wunused-value \
- -Waddress \
- -Wmain \
- -Wmissing-braces \
- -Wmissing-noreturn \
- -Wpointer-arith \
- -Wreturn-type \
- -Wshadow \
- -Wsign-conversion \
- -Wstack-protector \
- -Wswitch-default \
- -Wundef \
- -Wuninitialized \
- -Wunused-parameter
-
-RELEASE = -O3
-
-COV = -fprofile-arcs -ftest-coverage
-PROF = -pg
-
-CFLAGS = -DLOGLEVEL=$(LOGLEVEL)
-LDFLAGS =
-
-ifeq ($(RANDOM), 1)
-CFLAGS += -DWITH_RANDOM
-endif
-ifeq ($(COLOR), 1)
-CFLAGS += -DWITH_COLOR
-endif
-ifeq ($(COVERAGE), 1)
-CFLAGS += $(COV)
-LDFLAGS += $(COV)
-endif
-ifeq ($(PROFILE), 1)
-CFLAGS += $(PROF)
-LDFLAGS += $(PROF)
-endif
-ifeq ($(LOGLEVEL), 0)
-CFLAGS += $(DEBUG)
-else
-CFLAGS += $(RELEASE)
-endif
-
-
-VALFLAGS= -v \
- --trace-children=yes \
- --smc-check=all \
- --read-var-info=yes \
- --leak-check=full \
- --show-reachable=yes \
- --track-origins=yes \
- --malloc-fill=ff \
- --free-fill=42
-MAKFLAGS= LOGLEVEL=$(LOGLEVEL) \
- RANDOM=$(RANDOM) \
- COLOR=$(COLOR) \
- PROFILE=$(PROFILE) \
- COVERAGE=$(COVERAGE)
-
-CSRC = $(wildcard *.c)
-CPPSRC = $(wildcard *.cpp)
-HEADER = $(wildcard *.h)
-COBJ = $(CSRC:.c=.o)
-CPPOBJ = $(CPPSRC:.cpp=.o)
-LOBJ = $(wildcard *.lo)
-
-OBJ = $(CPPOBJ) $(COBJ) $(LOBJ)
-SRC = $(CSRC) $(CPPSRC)
-
-GCOV = $(wildcard *.gcov)
-GCDA = $(wildcard *.gcda)
-GCNO = $(wildcard *.gcno)
-
-PROFILE = $(wildcard *.profile)
-
-.PHONY: all clean distclean rebuild\
- test run valgrind coverage profiling\
- release\
- help
-
-%.o: %.cpp
- @(echo -e "CXX\t$@")
- @($(CXX) -o $@ -c $< $(CFLAGS))
-
-%.lo: %.cpp
- @(echo -e "CXX\t$@")
- @($(CXX) -o $@ -c $< $(CFLAGS) -fpic)
-
-%.o: %.c
- @(echo -e "CC\t$@")
- @($(CC) -o $@ -c $< $(CFLAGS))
-
-%.lo: %.c
- @(echo -e "CC\t$@")
- @($(CC) -o $@ -c $< $(CFLAGS) -fpic)
-
-%.x: %.o
- @(echo -e "LD\t$@")
- @($(LD) -o $@ $^ $(LDFLAGS))
-
-lib%.so: %.lo
- @(echo -e "LD\t$@")
- @($(LD) -o $@ $^ $(LDFLAGS) --shared)
-
-# Phony
-all: $(TARGET)
-
-clean:
- @( if [ ! -z "$(OBJ)" ]; then \
- echo -e "RM\t$(OBJ)"; \
- $(RM) $(OBJ); \
- fi )
- @( if [ -f "gmon.out" ]; then \
- echo -e "RM\tgmon.out"; \
- $(RM) gmon.out; \
- fi )
- @( if [ ! -z "$(GCDA)" ]; then \
- echo -e "RM\t$(GCDA)"; \
- $(RM) $(GCDA); \
- fi )
- @( if [ ! -z "$(GCNO)" ]; then \
- echo -e "RM\t$(GCNO)"; \
- $(RM) $(GCNO); \
- fi )
- @( if [ -d unitTests ]; then \
- cd unitTests && $(MAKE) $@; \
- fi )
-
-distclean: clean
- @( if [ ! -z "$(TARGET)" ]; then \
- echo -e "RM\t$(TARGET)"; \
- $(RM) $(TARGET); \
- fi )
- @( if [ ! -z "$(UNIT_TESTS)" ]; then \
- echo -e "RM\t$(UNIT_TESTS)"; \
- $(RM) $(UNIT_TESTS); \
- fi )
- @( if [ ! -z "$(GCOV)" ]; then \
- echo -e "RM\t$(GCOV)"; \
- $(RM) $(GCOV); \
- fi )
- @( if [ ! -z "$(PROFILE)" ]; then \
- echo -e "RM\t$(PROFILE)"; \
- $(RM) $(PROFILE); \
- fi )
- @( if [ -d unitTests ]; then \
- cd unitTests && $(MAKE) $@; \
- fi )
-
-rebuild: clean
- @( $(MAKE) $(MAKFLAGS) )
-
-rebuildtest: clean
- @( $(MAKE) $(MAKFLAGS) test )
-
-ifneq ($(UNIT_TESTS), )
-test: $(UNIT_TESTS)
- @( echo "To launch tests, run \"make run\""; )
-else
-test:
- @( if [ -d unitTests ]; then \
- cd unitTests && $(MAKE) $(MAKFLAGS) $@; \
- else \
- echo "No unit tests folder"; \
- fi )
-endif
-
-run_tests = echo "Run $(test_run)...";\
- ./$(test_run);
-
-ifneq ($(UNIT_TESTS), )
-run: test
- @($(foreach test_run,$(UNIT_TESTS),$(run_tests)))
-else
-run:
- @( if [ -d unitTests ]; then \
- cd unitTests && $(MAKE) $(MAKFLAGS) $@; \
- else \
- echo "No unit test folder"; \
- fi )
-endif
-
-valgrind_tests = echo "Valgrind $(test_run)..."; \
- valgrind $(VALFLAGS) ./$(test_run);
-
-ifneq ($(UNIT_TESTS), )
-valgrind:
- @(echo "Compile project without profiling info")
- @($(MAKE) clean)
- @($(MAKE) $(MAKFLAGS) PROFILE=0 test)
- @($(foreach test_run,$(UNIT_TESTS),$(valgrind_tests)))
-else
-valgrind:
- @( if [ -d unitTests ]; then \
- cd unitTests && $(MAKE) $@; \
- else \
- echo "No unit test folder"; \
- fi )
-endif
-
-get_coverage = cd unitTests &&\
- gcov ../$(source_file) | grep -m 1 -A 1 $(source_file) 2> /dev/null;\
- if [ -f $(source_file).gcov ]; then\
- mv $(source_file).gcov ../ &&\
- rm *.gcov &&\
- echo "Coverage report available on $(source_file).gcov";\
- else\
- echo "No coverage info found. Please rebuild your solution with COVERAGE flag set to 1";\
- fi;\
- cd ..
-
-ifneq ($(UNIT_TESTS), )
-coverage: run
-else
-coverage:
- @( if [ -d unitTests ]; then \
- cd unitTests && $(MAKE) $(MAKFLAGS) COVERAGE=1 $@ && cd ..; \
- $(foreach source_file,$(SRC),$(get_coverage)); \
- else \
- echo "No unit test found"; \
- fi )
-endif
-
-get_profile = if [ -f gmon.out ]; then\
- gprof "$(test_run)" gmon.out > ../$(test_run).profile &&\
- echo "Profile report for $(test_run) is available at $(test_run).profile";\
- else\
- echo "No profiling info found. Please rebuild your solution with PROFILE flag set to 1";\
- fi;
-
-ifneq ($(UNIT_TESTS), )
-profiling: run
- @( $(foreach test_run,$(UNIT_TESTS),$(get_profile)) )
-else
-profiling:
- @( if [ -d unitTests ]; then \
- cd unitTests && $(MAKE) $(MAKFLAGS) PROFILE=1 $@; \
- else \
- echo "No unit test found"; \
- fi )
-endif
-
-release:
- @( echo "Clean project")
- @( $(MAKE) clean )
- @( $(MAKE) $(MAKFLAGS) LOGLEVEL=0 PROFILE=0 COVERAGE=0 )
-
-help:
- @( echo "Wonderfull Makefile system help center"; \
- echo ""; \
- echo "make - compile project (library or exe)"; \
- echo "make rebuild - rebuild project completely"; \
- echo "make rebuildtest - rebuild project completely with unit tests"; \
- echo "make release - compile project in release mode."; \
- echo " /!\ a clean is performed during this operation"; \
- echo "make clean - clean object file, profile and coverage temporary file"; \
- echo "make distclean - clean project, delete binary, coverage and profile report"; \
- echo "make help - show this help and quit"; \
- echo "";\
- echo "TEST TOOLS"; \
- echo "----------"; \
- echo ""; \
- echo "make test - compile unit test set for project"; \
- echo " unit tests must be in a unitTests folder"; \
- echo "make run - compile and run unit test"; \
- echo "make valgrind - perform a valgrind test on unit test set"; \
- echo " /!\ a clean is performed during this operation"; \
- echo "make coverage - create coverage data based on unit tests set"; \
- echo "make profiling - create profiling data based on unit tests set"; \
- echo " /!\ if you just run \"make valgrind\", you need to rebuild"; \
- echo " project with PROFILE=1"; \
- echo ""; \
- echo "OPTIONS"; \
- echo "-------"; \
- echo ""; \
- echo "LOGLEVEL=x - compile source with flag -DLOGLEVEL=x"; \
- echo " with syslog.h system, you can use the following"; \
- echo " value:"; \
- echo " 0 - no log, debug options are disabled"; \
- echo " 1 - Error log"; \
- echo " 2 - Warning log"; \
- echo " 3 - Info log"; \
- echo " 4 - Debug log"; \
- echo " 5 - Enter function log"; \
- echo " === Set to 5 by default ==="; \
- echo "RANDOM=x - compile source with flag -DWITH_RANDOM if set to 1."; \
- echo " This flag activate random string generator in unit tests"; \
- echo " === Activate by default ==="; \
- echo "COLOR=x - compile source with flag -DWITH_COLOR if set to 1."; \
- echo " This flag activate colored log on stdout"; \
- echo " === Activate by default ==="; \
- echo "PROFILE=x - allow code profiling if set to 1."; \
- echo " === Activate by default ==="; \
- echo "COVERAGE=x - allow code coverage analysis if set to 1."; \
- echo " === Activate by default ==="; \
- echo "" )
-
+++ /dev/null
-/*\r
- * Libavl is a library to manage AVL structure to store and organize\r
- * everykind of data. You just need to implement function to compare,\r
- * to desallocate and to print your structure.\r
- *\r
- * DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE \r
- * Version 2, December 2004 \r
- *\r
- * Copyright (C) 2013 Adrien Oliva <adrien.oliva@yapbreak.fr>\r
- *\r
- * Everyone is permitted to copy and distribute verbatim or modified \r
- * copies of this license document, and changing it is allowed as long \r
- * as the name is changed. \r
- *\r
- * DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE \r
- * TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION \r
- *\r
- * 0. You just DO WHAT THE FUCK YOU WANT TO.\r
- */\r
-\r
-/**\r
- * \file avl.c\r
- * \author Adrien Oliva\r
- * \date May, 24th, 2011\r
- * \brief Generic AVL-tree library.\r
- * \version 1.0.0\r
- *\r
- * Implementation of an AVL tree to store generic data.\r
- * In computer science, an AVL tree is a self-balancing binary search tree,\r
- * and it was the first such data structure to be invented. In an AVL tree,\r
- * the heights of the two child subtrees of any node differ by at most one.\r
- * Lookup, insertion, and deletion all take \f$\mathcal{O}(\log n)\f$\r
- * time in both the average and worst cases, where \e n is the number of\r
- * nodes in the tree prior to the operation. Insertions and deletions may\r
- * require the tree to be rebalanced by one or more tree rotations.\r
- *\r
- * The AVL tree is named after its two Soviet inventors, G.M. Adelson-Velskii\r
- * and E.M. Landis, who published it in their 1962 paper "An algorithm for the\r
- * organization of information."\r
- *\r
- * The balance factor of a node is the height of its left subtree minus the\r
- * height of its right subtree (sometimes opposite) and a node with balance\r
- * factor 1, 0, or -1 is considered balanced. A node with any other balance\r
- * factor is considered unbalanced and requires rebalancing the tree. The\r
- * balance factor is either stored directly at each node or computed from the\r
- * heights of the subtrees.\r
- *\r
- * \section Usage Use of library\r
- *\r
- * Here is an example of code that store structure in AVL tree:\r
- *\r
- * <pre>\r
- * #include <stdlib.h>\r
- * #include <stdio.h>\r
- * #include "avl.h"\r
- *\r
- * // Structure we want to store\r
- * // key is used to order data\r
- * struct data {\r
- * int key;\r
- * int value;\r
- * };\r
- *\r
- * // Function that compares two struct data\r
- * int data_cmp(void *a, void *b)\r
- * {\r
- * struct data *aa = (struct data *) a;\r
- * struct data *bb = (struct data *) b;\r
- *\r
- * // Protect against NULL pointer\r
- * // It could generally never happened\r
- * if (!aa || !bb)\r
- * return 0;\r
- *\r
- * return aa->key - bb->key;\r
- * }\r
- *\r
- * // Function that dumps data structure\r
- * void data_print(void *d)\r
- * {\r
- * struct data *dd = (struct data *) d;\r
- *\r
- * if (dd)\r
- * printf("{ %d => %d }\n", dd->key, dd->value);\r
- * }\r
- *\r
- * // Function that delete a data structure\r
- * void data_delete(void *d)\r
- * {\r
- * struct data *dd = (struct data *) d;\r
- *\r
- * if (dd) {\r
- * // You can put here all additional needed\r
- * // memory deallocation\r
- * free(dd);\r
- * }\r
- * }\r
- *\r
- * int main(int argc, char *argv)\r
- * {\r
- * tree *avl_tree = NULL;\r
- * struct data tmp;\r
- * int result;\r
- *\r
- * // Initialize a new tree with our three previously defined\r
- * // functions to store data structure.\r
- * avl_tree = init_dictionnary(data_cmp, data_print, data_delete);\r
- *\r
- * tmp.key = 42;\r
- * tmp.value = 4242;\r
- *\r
- * // Add element {42, 4242} in our tree.\r
- * result = insert_elmt(avl_tree, &tmp, sizeof(struct data));\r
- * // Here result is equal to 1 since there is only 1 element in tree.\r
- *\r
- * // Dump tree to stdout with data_print function\r
- * print_tree(avl_tree);\r
- *\r
- * // For all search function, the only value needed in tmp structure\r
- * // is key field.\r
- * tmp.key = 20;\r
- * tmp.value = 0;\r
- *\r
- * if (!is_present(avl_tree, &tmp))\r
- * printf("Key 20 is not found.\n");\r
- *\r
- * tmp.key = 42;\r
- * if (is_present(avl_tree, &tmp))\r
- * printf("Key 42 exist in tree.\n");\r
- *\r
- * if (get_data(avl_tree, &tmp, sizeof(struct data)))\r
- * printf("Now, tmp.key is equal to 4242\n");\r
- *\r
- * delete_node(avl_tree, &tmp);\r
- * if (!is_present(avl_tree, &tmp))\r
- * printf("Key 42 does not exist anymore.\n");\r
- *\r
- * // Free all memory\r
- * delete_tree(avl_tree);\r
- *\r
- * return 0;\r
- * }\r
- * </pre>\r
- *\r
- * You can find this example in folder \b example.\r
- *\r
- * \subsection Tree initialisation\r
- *\r
- * To start a new tree, you need to init a new one with function\r
- * \b init_tree.\r
- *\r
- * \subsection Manage data\r
- *\r
- * The libavl provide all necessary function to store, retrieve and\r
- * browse your data. The following set gives basic operation:\r
- * * \b insert_elmt\r
- * * \b is_present\r
- * * \b get_data\r
- * * \b delete_node\r
- * * \b delete_node_min\r
- *\r
- * Moreover, libavl gives the availability to browse your entire data\r
- * or a subset of your data with:\r
- * * \b explore_tree\r
- * * \b explore_restrain_tree\r
- * * \b print_tree\r
- *\r
- * Finally, libavl take care of your memory and deallocate all memory\r
- * used in a tree when you want to destroy it with \b delete_tree.\r
- *\r
- */\r
-#ifndef LOGLEVEL\r
-# define LOGLEVEL 0\r
-#endif\r
-\r
-#include <stdio.h>\r
-#include <stdlib.h>\r
-#include <string.h>\r
-\r
-#include "avl.h"\r
-#include "syslog.h"\r
-\r
-/** Library version\r
- */\r
-#define LIBAVL_MAJOR_VERSION 1\r
-#define LIBAVL_MINOR_VERSION 0\r
-#define LIBAVL_REVISION 0\r
-#define LIBAVL_VERSION "1.0.0"\r
-#define LIBAVL_VERSION_CHECK(maj, min) ( ((maj) == LIBAVL_MAJOR_VERSION)\\r
- && ((min) == LIBAVL_MINOR_VERSION))\r
-\r
-\r
-/** \fn int is_present_recur(node n, void *d, int (*data_cmp) (void *, void *));\r
- * \brief Recursive function to check if a given data is present in tree.\r
- *\r
- * \return 1 if data is present, 0 if not.\r
- * \param n Node of subtree to analyze.\r
- * \param d Pointer to data.\r
- * \param data_cmp Function to compare two nodes.\r
- *\r
- * \warning If you use this function you probably make a mistake.\r
- */\r
-int is_present_recur(node n, void *d, int (*data_cmp) (void *, void *))\r
-{\r
- int cmp = 0;\r
-\r
- // Prevent analyze of a Null node\r
- if (n == NULL)\r
- return 0;\r
-\r
- // Compare data\r
- cmp = data_cmp(n->data, d);\r
-\r
- if (cmp == 0)\r
- // Node found, return true\r
- return 1;\r
- else if (cmp > 0)\r
- // Current node is higher than data to look for,\r
- // need to go to left subtree.\r
- return is_present_recur(n->left, d, data_cmp);\r
- else\r
- // Current node is smaller than data to look for,\r
- // need to go to right subtree.\r
- return is_present_recur(n->right, d, data_cmp);\r
-}\r
-\r
-/** Use for debug only. Print recursive level of inserted element */\r
-#if LOGLEVEL > 3\r
-static int level_insert = 0;\r
-#endif\r
-\r
-/** \fn int height_tree(node tree);\r
- * \brief Give the height of tree.\r
- *\r
- * \return Height of tree\r
- * \param tree Root of tree to analyze\r
- *\r
- * If there is no son, height of node is 1. Else, the height is maximum\r
- * height of subtrees plus 1.\r
- *\r
- * \warning If you use this function you probably make a mistake.\r
- */\r
-unsigned int height_tree(node n)\r
-{\r
- if (n == NULL)\r
- return 0;\r
-\r
- return n->height;\r
-}\r
-\r
-/** \fn void adjust_tree_height(node n);\r
- * \brief Update height field of tree.\r
- *\r
- * \param n Calculate new height of tree pointed by \c tree.\r
- *\r
- * For the height calculation rules, see \c height_tree function.\r
- *\r
- * \warning If you use this function you probably make a mistake.\r
- */\r
-void adjust_tree_height(node n)\r
-{\r
- unsigned int h1;\r
- unsigned int h2;\r
-\r
- h1 = height_tree(n->left);\r
- h2 = height_tree(n->right);\r
-\r
- if (h1 > h2)\r
- n->height = h1 + 1;\r
- else\r
- n->height = h2 + 1;\r
-}\r
-\r
-/** \fn node rotate_tree_right(node n);\r
- * \brief Proceed right rotation to tree pointed by \c n.\r
- *\r
- * \return New root of right rotated tree.\r
- * \param n Pointer to root of tree.\r
- *\r
- * \warning If you use this function you probably make a mistake.\r
- */\r
-node rotate_tree_right(node n)\r
-{\r
- node temp = n->left;\r
- n->left = temp->right;\r
- adjust_tree_height(n);\r
- temp->right = n;\r
- adjust_tree_height(temp);\r
- return temp;\r
-}\r
-\r
-/** \fn node rotate_tree_left(node n);\r
- * \brief Proceed left rotation to tree pointed by \c n.\r
- *\r
- * \return New root of left rotated tree.\r
- * \param n Pointer to root of tree.\r
- *\r
- * \warning If you use this function you probably make a mistake.\r
- */\r
-node rotate_tree_left(node n)\r
-{\r
- node temp = n->right;\r
- n->right = temp->left;\r
- adjust_tree_height(n);\r
- temp->left = n;\r
- adjust_tree_height(temp);\r
- return temp;\r
-}\r
-\r
-\r
-/** \fn node equi_left(node n);\r
- * \brief Balance left tree.\r
- *\r
- * \return New root of left-balanced tree.\r
- * \param n Pointer to root of tree.\r
- *\r
- * This function make rotation and update height if necessary.\r
- *\r
- * \warning If you use this function you probably make a mistake.\r
- */\r
-node equi_left(node n)\r
-{\r
-\r
- node son = n->left;\r
-\r
- DLOG("height tree: tree(%d) | left (%d) | right (%d) | son (%d)",\r
- height_tree(n),\r
- height_tree(n->left),\r
- height_tree(n->right),\r
- height_tree(son));\r
- if (height_tree(son) > height_tree(n->right) + 1) {\r
- if (height_tree(son->right) > height_tree(son->left)) {\r
- DLOG("Need rotate left");\r
- n->left = rotate_tree_left(n->left);\r
- }\r
- DLOG("Need rotate right");\r
- n = rotate_tree_right(n);\r
- } else {\r
- DLOG("No rotate");\r
- adjust_tree_height(n);\r
- }\r
- return n;\r
-}\r
-\r
-/** \fn node equi_right(node n);\r
- * \brief Balance right tree.\r
- *\r
- * \return New root of right-balanced tree.\r
- * \param n Pointer to root of tree.\r
- *\r
- * This function make rotation and update height if necessary.\r
- *\r
- * \warning If you use this function you probably make a mistake.\r
- */\r
-node equi_right(node n)\r
-{\r
- node son = n->right;\r
-\r
- if (height_tree(son) > height_tree(n->left) + 1) {\r
- if (height_tree(son->left) > height_tree(son->right))\r
- n->right = rotate_tree_right(n->right);\r
- n = rotate_tree_left(n);\r
- } else {\r
- adjust_tree_height(n);\r
- }\r
- return n;\r
-}\r
-\r
-\r
-/** \fn int delete_node_min_recur(node *n, void (*data_delete) (void *));\r
- * \brief Recursive deletion of minimum element.\r
- *\r
- * \return True if element is deleted, false if not.\r
- * \param n Root of tree where minimum element must be deleted.\r
- * \param data_delete Fonction to delete a node in tree.\r
- *\r
- * \warning If you use this function you probably make a mistake.\r
- */\r
-int delete_node_min_recur(node *n, void (*data_delete) (void *))\r
-{\r
- node aux = NULL;\r
- int result;\r
-\r
- if (*n == NULL)\r
- return 0;\r
-\r
- if ((*n)->left == NULL) {\r
- // No node in left subtree, this means that the current node\r
- // is the minimum node stored in tree.\r
- aux = *n;\r
- *n = aux->right;\r
- data_delete(aux->data);\r
- free(aux);\r
- return 1;\r
- } else {\r
- // not the minimum, go deep\r
- result = delete_node_min_recur(&((*n)->left), data_delete);\r
- // balance resulting tree\r
- *n = equi_right(*n);\r
- }\r
-\r
- return result;\r
-}\r
-\r
-/** \fn node delete_node_recur(node *root, void *data,\r
- * int (*data_cmp) (void *, void *),\r
- * void (*data_delete) (void *));\r
- * \brief Recursive deletion of the a node.\r
- *\r
- * \param root Pointer of pointer to subtree.\r
- * \param data Data to delete. Only field used in \c avl_data_cmp\r
- * must be filled.\r
- * \param data_cmp Function use to compare node.\r
- * \param data_delete Function use to delete node.\r
- * \return True if node is deleted, false else.\r
- * \r
- * \warning If you use this function you probably make a mistake.\r
- */\r
-int delete_node_recur(node *root, void *data,\r
- int (*data_cmp) (void *, void *),\r
- void (*data_delete) (void *))\r
-{\r
- int cmp = 0;\r
- int result = 0;\r
- node aux = NULL;\r
-\r
- if (*root == NULL) {\r
- WLOG("Node does not exist");\r
- return 0;\r
- }\r
-\r
- cmp = data_cmp(data, (*root)->data);\r
- if (cmp == 0) {\r
- // Current node is the node to delete.\r
- if ((*root)->right == NULL) {\r
- // simple deletion because there is no right subtree.\r
- // attach the left subtree instead of the deleted node\r
- aux = *root;\r
- *root = (*root)->left;\r
-\r
- // release memory used in node.\r
- data_delete(aux->data);\r
- free(aux);\r
- } else {\r
- // There is a right subtree.\r
- // swap minimun element of right subtree and\r
- // the deleted data, efectively delete data\r
- // and re balance right subtree.\r
- void *d;\r
- node temp = (*root)->right;\r
-\r
- // look for the minimum element of right subtree.\r
- while (temp->left != NULL)\r
- temp = temp->left;\r
-\r
- // swap data\r
- d = (*root)->data;\r
- (*root)->data = temp->data;\r
- temp->data = d;\r
-\r
- // delete minimum node.\r
- delete_node_min_recur(&((*root)->right), data_delete);\r
- // rebalance subtree.\r
- *root = equi_left(*root);\r
- }\r
- return 1;\r
- } else if (cmp > 0) {\r
- // current node is smaller than node to delete\r
- // go down into right subtree.\r
- result = delete_node_recur(&((*root)->right), data, data_cmp, data_delete);\r
- // rebalance subtree.\r
- *root = equi_left(*root);\r
- } else {\r
- // current node is higher than node to delete\r
- // go down into left subtree.\r
- result = delete_node_recur(&((*root)->left), data, data_cmp, data_delete);\r
- // rebalance subtree.\r
- *root = equi_right(*root);\r
- }\r
-\r
- return result;\r
-}\r
-\r
-/** \fn int insert_elmt_recur(node *n, node add_node,\r
- * int (*data_cmp) (void *, void *));\r
- * \brief Recursive function too add element in tree.\r
- *\r
- * \return Number of element inserted.\r
- * \param n Root of tree where element must be inserted.\r
- * \param add_node Element to be added in tree.\r
- * \param data_cmp Function to compare nodes.\r
- *\r
- * \warning If you use this function you probably make a mistake.\r
- */\r
-int insert_elmt_recur(node *n, node add_node, int (*data_cmp) (void *, void *))\r
-{\r
- int present = 0; // 1 means that data already present\r
- int cmp;\r
-\r
- // Here is the end of a tree. It must create new node here\r
- DLOG("Insert %p at level %d", add_node, level_insert);\r
- if (*n == NULL) {\r
- (*n) = add_node;\r
- (*n)->height = 1;\r
- (*n)->left = NULL;\r
- (*n)->right = NULL;\r
-\r
- return 0;\r
- }\r
-\r
- cmp = data_cmp((*n)->data, add_node->data);\r
-\r
- // Check if current node is the node you want to add\r
- if (cmp == 0)\r
- // node already exist\r
- return 1;\r
-\r
- if (cmp > 0) {\r
- // Current node is higher that node you want to add\r
- // Insert it on left subtree.\r
- DLOG("Down into left level %d", ++level_insert);\r
- present = insert_elmt_recur(&(*n)->left, add_node, data_cmp);\r
- DLOG("Out of level %d", level_insert--);\r
-\r
- if (!present) {\r
- // node was really inserted, need to re-balance tree\r
- *n = equi_left(*n);\r
- return 0;\r
- } else\r
- // node not inserted in subtree\r
- return 1;\r
- } else {\r
- // Current node is smaller that node you want to add\r
- // Insert it on right subtree.\r
- DLOG("Down into right level %d", ++level_insert);\r
- present = insert_elmt_recur(&(*n)->right, add_node, data_cmp);\r
- DLOG("Out of level %d", level_insert--);\r
-\r
- if (!present) {\r
- // node was really inserted, need to re-balance tree\r
- *n = equi_right(*n);\r
- return 0;\r
- } else\r
- // node not inserted in subtree\r
- return 1;\r
- }\r
-\r
-}\r
-\r
-/** \fn void verif_avl(node n, int tree_min, int tree_max,\r
- * void *data_min, void *data_max,\r
- * int (*data_cmp) (void *, void *));\r
- * \brief Recursive deffensive function to check if tree is an AVL tree.\r
- *\r
- * \param n Pointer to root of tree.\r
- * \param tree_min Boolean must be true if \c tree is the minimum node.\r
- * \param tree_max Boolean must be true if \c tree is the maximum node.\r
- * \param data_min Pointer to the minimum element of sub-tree.\r
- * \param data_max Pointer to the maximum element of sub-tree.\r
- * \param data_cmp Fonction to compare nodes.\r
- *\r
- * \warning If you use this function you probably make a mistake.\r
- */\r
-void verif_avl(node n,\r
- int tree_min,\r
- int tree_max,\r
- void *data_min,\r
- void *data_max,\r
- int (*data_cmp) (void *, void *))\r
-{\r
- unsigned hg;\r
- unsigned hd;\r
-\r
- // Check order of data.\r
- if (tree_min && data_cmp(n->data, data_min) < 0) {\r
- DLOG("Tree->data < data_min");\r
- exit(-1);\r
- }\r
- if (tree_max && data_cmp(n->data, data_max) > 0) {\r
- DLOG("Tree->data > data_min");\r
- exit(-2);\r
- }\r
-\r
- // Check avl left subtree.\r
- if (n->left != NULL) {\r
- verif_avl(n->left,\r
- tree_min,\r
- 1,\r
- data_min,\r
- n->data,\r
- data_cmp);\r
- hg = n->left->height;\r
- } else {\r
- hg = 0;\r
- }\r
-\r
- // Check avl right subtree.\r
- if (n->right != NULL) {\r
- verif_avl(n->right,\r
- 1,\r
- tree_max,\r
- n->data,\r
- data_max,\r
- data_cmp);\r
- hd = n->right->height;\r
- } else {\r
- hd = 0;\r
- }\r
-\r
-\r
- // Check height consistency of each subtree\r
- if (hg <= hd) {\r
- if (!(hd + 1 == n->height && hg + 2 >= n->height)) {\r
- DLOG("(hg<hd) Error in tree height: hd %u | hg %u | tree->height %u",\r
- hd, hg, n->height);\r
- exit(-3);\r
- }\r
- } else {\r
- if (!(hg + 1 == n->height && hd + 2 >= n->height)) {\r
- DLOG("(hg>hd) Error in tree height: hd %u | hg %u | tree->height %u",\r
- hd, hg, n->height);\r
- exit(-4);\r
- }\r
- }\r
-}\r
-\r
-/** \fn void delete_tree_recur(node n, void (*data_delete) (void *));\r
- * \brief Recursively delete all node in tree.\r
- *\r
- * \param n Root node of tree to delete.\r
- * \param data_delete Function use to delete a node.\r
- *\r
- * \warning If you use this function you probably make a mistake.\r
- */\r
-void delete_tree_recur(node n, void (*data_delete) (void *))\r
-{\r
- if (n == NULL)\r
- return;\r
-\r
- if (n->left != NULL)\r
- delete_tree_recur(n->left, data_delete);\r
- if (n->right != NULL)\r
- delete_tree_recur(n->right, data_delete);\r
-\r
- data_delete(n->data);\r
- free(n);\r
-}\r
-\r
-/** \fn void print_tree_recur(node t, void (*data_print) (void *));\r
- * \brief Recursive function to print tree. Use for debug.\r
- *\r
- * \param t Pointer to root of tree.\r
- * \param data_print Function to display a node.\r
- *\r
- * \warning If you use this function you probably make a mistake.\r
- */\r
-void print_tree_recur(node t, void (*data_print) (void *))\r
-{\r
- if (t == NULL)\r
- return;\r
-\r
- // recursively print left subtree.\r
- print_tree_recur(t->left, data_print);\r
- {\r
- // print current node with debug information.\r
- unsigned i = 0;\r
- for (i = 0; i < t->height; i++)\r
- printf(" ");\r
- printf("[%d|%p]", t->height, t);\r
- data_print(t->data);\r
- printf("\n");\r
- }\r
- // recursively print right subtree.\r
- print_tree_recur(t->right, data_print);\r
-}\r
-\r
-/** \fn void explore_tree_recur(node t, void (*treatement)(void *, void *),\r
- * void *param);\r
- * \brief Recursive exploration of tree.\r
- *\r
- * \param t Pointer to subtree.\r
- * \param treatement Function apply to each node of tree.\r
- * \param param Pointer to data to pass to \c treatement function.\r
- *\r
- * \warning If you use this function you probably make a mistake.\r
- */\r
-void explore_tree_recur(node t, void (*treatement)(void *, void *), void *param)\r
-{\r
- if (t == NULL)\r
- return;\r
-\r
- // recursively treat left subtree.\r
- explore_tree_recur(t->left, treatement, param);\r
- // treat current node.\r
- treatement(t->data, param);\r
- // recursively treat right subtree.\r
- explore_tree_recur(t->right, treatement, param);\r
-}\r
-\r
-/** \fn int explore_restrain_tree_recur(node t, int (*check)(void *, void *),\r
- * void *param, void *data_min,\r
- * void *data_max,\r
- * int (*data_cmp) (void *, void *));\r
- * \brief Recursive and restrain exploration of tree.\r
- *\r
- * \return Accumulation of return value of \c check function.\r
- * \param t Pointer to root of tree.\r
- * \param check Function apply to each node of tree between \c data_min and\r
- * \c data_max.\r
- * \param param Pointer to data to pass to \c check function\r
- * \param data_min All treated node are greater than \c data_min\r
- * \param data_max All treated node are smaller than \c data_max\r
- * \param data_cmp Function to compare nodes.\r
- *\r
- * \warning If you use this function you probably make a mistake.\r
- */\r
-int explore_restrain_tree_recur(node t, int (*check)(void *, void *),\r
- void *param,\r
- void *data_min, void *data_max,\r
- int (*data_cmp) (void *, void *))\r
-{\r
- if (t == NULL)\r
- return 0;\r
-\r
- if (data_cmp(t->data, data_max) > 0)\r
- // current data is not in the asked range.\r
- return explore_restrain_tree_recur(t->left, check, param,\r
- data_min, data_max,\r
- data_cmp);\r
- else if (data_cmp(t->data, data_min) < 0)\r
- // current data is not in the asked range.\r
- return explore_restrain_tree_recur(t->right, check, param,\r
- data_min, data_max,\r
- data_cmp);\r
- else {\r
- // current data is in the range.\r
- int accu = 0;\r
- // treat recursively left subtree.\r
- accu += explore_restrain_tree_recur(t->left, check, param,\r
- data_min, data_max,\r
- data_cmp);\r
- // treat current node.\r
- accu += check(t->data, param);\r
- // treat recursively right subtree.\r
- accu += explore_restrain_tree_recur(t->right, check, param,\r
- data_min, data_max,\r
- data_cmp);\r
- return accu;\r
- }\r
-}\r
-\r
-\r
-/** \fn int get_data_recur(node n, void *data, size_t data_size,\r
- * int (*data_cmp) (void *, void *))\r
- * \brief Recursively get of a single data.\r
- *\r
- * \param n Root of tree to analyze.\r
- * \param data Pointer to the asked data. At the begining of the function,\r
- * only field used in \c avl_data_cmp must be filled, at the end (and if\r
- * data exist in tree), all filled will be filled.\r
- * \param data_size Size of the data structure (need to copy data).\r
- * \param data_cmp Function to compare nodes.\r
- * \return 1 if data was found, 0 if not.\r
- *\r
- * \warning If you use this function, you probably make a mistake.\r
- */\r
-int get_data_recur(node n, void *data, size_t data_size, int (*data_cmp) (void *, void *))\r
-{\r
- int cmp = 0;\r
-\r
- if (n == NULL)\r
- return 0;\r
-\r
- cmp = data_cmp(n->data, data);\r
- if (cmp == 0) {\r
- // Current node is the good node, copy it.\r
- memcpy(data, n->data, data_size);\r
- return 1;\r
- } else if (cmp > 0) {\r
- // Need to go deep in the left subtree.\r
- return get_data_recur(n->left, data, data_size, data_cmp);\r
- } else {\r
- // Need to go deep in the right subtree.\r
- return get_data_recur(n->right, data, data_size, data_cmp);\r
- }\r
-\r
-}\r
-\r
-/** \fn int stub__data_cmp(void *a, void *b)\r
- * \brief Stub function used if no data_cmp functio is provided.\r
- *\r
- * \param a First node to compare.\r
- * \param b Second node to compare.\r
- * \return Difference of pointer nodes.\r
- *\r
- * \warning This function is just a stub and shall never be used\r
- * in your production project.\r
- */\r
-int stub__data_cmp(void *a, void *b)\r
-{\r
- return (int) ((ptrdiff_t) a - (ptrdiff_t) b);\r
-}\r
-\r
-/** \fn void stub__data_print(void *d)\r
- * \brief Stub function used if no data_print function is provided.\r
- *\r
- * \param d Data to print.\r
- *\r
- * Print to \c stdout the pointer of data.\r
- *\r
- * \warning This function is just a stub and shall never be used\r
- * in your production project.\r
- */\r
-void stub__data_print(void *d)\r
-{\r
- printf("0x%p", d);\r
-}\r
-\r
-/** \fn void stub__data_delete(void *d)\r
- * \brief Stub function used if no data_delete function is provided.\r
- *\r
- * \param d Data to delete.\r
- *\r
- * This fonction call \c free on \c d.\r
- *\r
- * \warning This function is just a stub. If your data is more\r
- * complicated than a single static structure, you must provide\r
- * your \c data_delete implementation. If not your program will\r
- * cause memory leaks on tree deletion.\r
- */\r
-void stub__data_delete(void *d)\r
-{\r
- free(d);\r
-}\r
-\r
-/** \fn void stub__data_copy(void *src, void *dst)\r
- * \brief Stub function used if no data_copy function is provided.\r
- *\r
- * \param src Data source\r
- * \param dst Data destination\r
- *\r
- * This function call \c memcpy to copy \c src into \c dst.\r
- *\r
- * \warning This function is just a stub. If your data is more complicated\r
- * than a single static structure, you must provide your \c data_copy\r
- * implementation.\r
- */\r
-void stub__data_copy(void *src, void *dst)\r
-{\r
- memcpy(dst, src, sizeof(src));\r
-}\r
-\r
-/* ************************************************************************* *\\r
-|* EXTERNAL FUNCTION *|\r
-\* ************************************************************************* */\r
-\r
-/** \fn tree *init_dictionnary(int (*data_cmp)(void *, void *),\r
- * void (*data_print)(void *),\r
- * void (*data_delete)(void *),\r
- * void *(*data_copy)(void *));\r
- * \brief Initialize dictionnary.\r
- *\r
- * \return Pointer to new tree.\r
- *\r
- * \param data_cmp Function to compare data.\r
- * \param data_print Function to print data.\r
- * \param data_delete Function to delete data.\r
- * \param data_copy Function to copy data.\r
- *\r
- * This function return an initilized tree.\r
- *\r
- * \note By default, if you do not provide function usefull to the tree,\r
- * the LibAVL library uses its own function. As LibAVL does not know exactly\r
- * the structure and the definition of your data, result can not be as good\r
- * as expected. Details on these functions are given in the following.\r
- *\r
- * \section LibAVL internal data function\r
- *\r
- * - Compare function: by default, the internal \c data_cmp function will\r
- * return the difference between the two pointer given in arguments\r
- *\r
- * return (int) ((ptrdiff_t) a - (ptrdiff_t) b);\r
- *\r
- * The \c data_cmp function is really critical and guarantee efficiency of\r
- * LibAVL.\r
- * - Print function: by default, the internal \c data_print function will\r
- * print the addresse contained in pointer in argument, in hexadecimal\r
- *\r
- * printf("0x%08x\n", d);\r
- *\r
- * Since \c data_print is mainly used as debug function to dump a complete\r
- * tree, it is not the most important data function, but with the correct\r
- * implementation, it could save lots of time and money when something\r
- * went wrong.\r
- * - Delete function: by default, the internal \c data_delete function will\r
- * call \c free on the argument pointer. If your data is only a static\r
- * structure or a simple type, this function is enough. But for bigger\r
- * object like a string array, it is necessary to provide a new\r
- * \c data_delete function to avoid memory leak.\r
- * - Copy function: by default, the internal \c data_copy function will\r
- * memcpy data.\r
- */\r
-tree *init_dictionnary(int (*data_cmp)(void *, void *),\r
- void (*data_print)(void *),\r
- void (*data_delete)(void *),\r
- void (*data_copy)(void *, void *))\r
-{\r
- // New tree allocation\r
- tree *t = malloc(sizeof(tree));\r
-\r
- // Initialized field\r
- t->count = 0;\r
- t->root = NULL;\r
- t->data_cmp = data_cmp ? data_cmp : stub__data_cmp;\r
- t->data_print = data_print ? data_print : stub__data_print;\r
- t->data_delete = data_delete ? data_delete : stub__data_delete;\r
- t->data_copy = data_copy ? data_copy : stub__data_copy;\r
-\r
- return t;\r
-}\r
-\r
-/* \fn int insert_elmt(tree *t, void *data, size_t datasize);\r
- * \brief Insert new element in tree.\r
- *\r
- * \return Number of element inserted in tree.\r
- * \param t Pointer to tree.\r
- * \param data Pointer to data to add.\r
- * \param datasize Size of data to add.\r
- *\r
- * This function allocate a new memory space with the given size\r
- * and copy object pointed by \c data to the newly created space.\r
- */\r
-unsigned int insert_elmt(tree *t, void *data, size_t datasize)\r
-{\r
- node to_add = NULL;\r
- int present = 0;\r
-\r
- // check if data is already present\r
- if (is_present(t, data))\r
- return t->count;\r
-\r
- // Allocate memory for the new data and copy data.\r
- to_add = malloc(sizeof(struct _node));\r
- to_add->data = malloc(datasize);\r
- t->data_copy(data, to_add->data);\r
- to_add->height = 0;\r
- to_add->left = to_add->right = NULL;\r
-\r
- // recursively insert data in tree.\r
- present = insert_elmt_recur(&(t->root), to_add, t->data_cmp);\r
-\r
- // increment counter of element if so.\r
- if (!present) {\r
- DLOG("New data was added.");\r
- return ++t->count;\r
- } else {\r
- DLOG("Data was updated.");\r
- return t->count;\r
- }\r
-}\r
-\r
-\r
-/* \fn void verif_tree(tree *t);\r
- * \brief Deffensive check if tree is a real AVL tree.\r
- *\r
- * \param t Pointer to tree.\r
- *\r
- * If tree is not an AVL tree, this function end on an assert.\r
- */\r
-void verif_tree(tree *t)\r
-{\r
- if (t == NULL)\r
- return;\r
- if (t->root == NULL)\r
- return;\r
-\r
- // recursively check of avl tree.\r
- verif_avl(t->root, 0, 0, t->root->data, t->root->data, t->data_cmp);\r
-}\r
-\r
-/* \fn void delete_tree(tree *t);\r
- * \brief Deallocate all memory used by tree.\r
- *\r
- * \param t Pointer to tree to delete.\r
- */\r
-void delete_tree(tree *t)\r
-{\r
- if (t == NULL)\r
- return;\r
-\r
- delete_tree_recur(t->root, t->data_delete);\r
- free(t);\r
-}\r
-\r
-/* \fn void print_tree(tree *t);\r
- * \brief Use for debug only. Print all element in tree with function\r
- * \c data_print.\r
- *\r
- * \param t Pointer to tree.\r
- */\r
-void print_tree(tree *t)\r
-{\r
- if (t == NULL)\r
- return;\r
- if (t->root == NULL)\r
- return;\r
-\r
- // recursively print the tree.\r
- print_tree_recur(t->root, t->data_print);\r
-}\r
-\r
-/* \fn void explore_tree(tree *t, void (*treatement)(void *, void *),\r
- * void *param);\r
- * \brief Execute function \c treatement on every node in tree.\r
- *\r
- * \param t Pointer to tree.\r
- * \param treatement Function to apply to each node.\r
- * \param param Pointer to extra data to pass to \c treatement function.\r
- *\r
- * This function goes thought the entire tree and, if \c n is the pointer\r
- * to the current node, call the function:\r
- * treatement(n, param);\r
- *\r
- */\r
-void explore_tree(tree *t, void (*treatement)(void *, void *), void *param)\r
-{\r
- if (t == NULL)\r
- return;\r
- if (t->root == NULL)\r
- return;\r
-\r
- // recursively explore the whole tree.\r
- explore_tree_recur(t->root, treatement, param);\r
-}\r
-\r
-/* \fn explore_restrain_tree(tree *t, int (*check)(void *, void *),\r
- * void *param,\r
- * void *data_min, void *data_max);\r
- * \brief Execute function \c check on every node between \c data_min and\r
- * \c data_max.\r
- *\r
- * \return Accumulation of all return value of \c check function.\r
- * \param t Pointer to tree.\r
- * \param check Function apply on every node between \c data_min and\r
- * \c data_max\r
- * \param param Pointer to extra data to pass to \c check function.\r
- * \param data_min Pointer to the minimum element.\r
- * \param data_max Pointer to the maximum element.\r
- *\r
- * This function goes thought a part of tree bounded with \c data_min and\r
- * \c data_max, and if \c n is the pointer to the current node, it calls\r
- * the function:\r
- *\r
- * accu += check(n, param);\r
- *\r
- * The value of \c accu is returned by \c explore_restrain_tree.\r
- */\r
-int explore_restrain_tree(tree *t, int (*check)(void *, void *), void *param,\r
- void *data_min, void *data_max)\r
-{\r
- if (t == NULL)\r
- return 0;\r
- if (t->root == NULL)\r
- return 0;\r
-\r
- // recursively explore part of tree.\r
- return explore_restrain_tree_recur(t->root, check, param,\r
- data_min, data_max,\r
- t->data_cmp);\r
-}\r
-\r
-/* \fn int is_present(tree *t, void *d);\r
- * \brief Function to check if a given data is present in tree.\r
- *\r
- * \return 1 if data is present, 0 if not.\r
- * \param t Pointer to tree.\r
- * \param d Pointer to data. Only field used in \c data_cmp need\r
- * to be filled in \c d.\r
- */\r
-int is_present(tree *t, void *d)\r
-{\r
- if (t == NULL)\r
- return 0;\r
-\r
- // Return result of a recursive exploration\r
- return is_present_recur(t->root, d, t->data_cmp);\r
-}\r
-\r
-/* \fn void delete_node_min(tree *t);\r
- * \brief Delete minimum element of a tree.\r
- *\r
- * \param t Tree where minimum element will be deleted.\r
- */\r
-void delete_node_min(tree *t)\r
-{\r
- if (t == NULL || t->root == NULL)\r
- return;\r
-\r
- // go recursively in tree to delete minimum node\r
- if (delete_node_min_recur(&(t->root), t->data_delete))\r
- t->count--;\r
-}\r
-\r
-/* \fn void delete_node(tree *t, void *data);\r
- * \brief Delete node n of tree.\r
- *\r
- * \param t Pointer to tree.\r
- * \param data Data to delete.\r
- */\r
-void delete_node(tree *t, void *data)\r
-{\r
- if (t == NULL)\r
- return;\r
- if (t->root == NULL)\r
- return;\r
- // explore tree recursively to delete node\r
- if (delete_node_recur(&(t->root), data, t->data_cmp, t->data_delete))\r
- t->count--;\r
-}\r
-\r
-/* \fn int get_data(tree *t, void *data, size_t data_size);\r
- * \brief Fill information pointed by data with the data stored in the tree.\r
- *\r
- * \return True if value pointed by data are relevant, false if not.\r
- *\r
- * \param t Pointer to tree.\r
- * \param data Data to retrieve. At the begining of the function, only\r
- * field used in \c avl_data_cmp must be filled.\r
- * \param data_size Size of data structure pointed by data.\r
- */\r
-int get_data(tree *t, void *data, size_t data_size)\r
-{\r
- if (t == NULL)\r
- return 0;\r
- if (t->root == NULL)\r
- return 0;\r
-\r
- return get_data_recur(t->root, data, data_size, t->data_cmp);\r
-}\r
-\r
+++ /dev/null
-/*
- * Libavl is a library to manage AVL structure to store and organize
- * everykind of data. You just need to implement function to compare,
- * to desallocate and to print your structure.
- *
- * DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
- * Version 2, December 2004
- *
- * Copyright (C) 2013 Adrien Oliva <adrien.oliva@yapbreak.fr>
- *
- * Everyone is permitted to copy and distribute verbatim or modified
- * copies of this license document, and changing it is allowed as long
- * as the name is changed.
- *
- * DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
- * TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
- *
- * 0. You just DO WHAT THE FUCK YOU WANT TO.
- */
-
-/**
- * \file avl.h
- * \author Adrien Oliva
- * \date May, 24th, 2011
- * \brief Generic AVL-tree library.
- * \version 1.0.0
- *
- * Implementation of an AVL tree to store generic data.
- * In computer science, an AVL tree is a self-balancing binary search tree,
- * and it was the first such data structure to be invented. In an AVL tree,
- * the heights of the two child subtrees of any node differ by at most one.
- * Lookup, insertion, and deletion all take \f$\mathcal{O}(\log n)\f$
- * time in both the average and worst cases, where \e n is the number of
- * nodes in the tree prior to the operation. Insertions and deletions may
- * require the tree to be rebalanced by one or more tree rotations.
- *
- * The AVL tree is named after its two Soviet inventors, G.M. Adelson-Velskii
- * and E.M. Landis, who published it in their 1962 paper "An algorithm for the
- * organization of information."
- *
- * The balance factor of a node is the height of its left subtree minus the
- * height of its right subtree (sometimes opposite) and a node with balance
- * factor 1, 0, or -1 is considered balanced. A node with any other balance
- * factor is considered unbalanced and requires rebalancing the tree. The
- * balance factor is either stored directly at each node or computed from the
- * heights of the subtrees.
- *
- * \section Usage Use of library
- *
- * Here is an example of code that store structure in AVL tree:
- *
- * <pre>
- * #include <stdlib.h>
- * #include <stdio.h>
- * #include "avl.h"
- *
- * // Structure we want to store
- * // key is used to order data
- * struct data {
- * int key;
- * int value;
- * };
- *
- * // Function that compares two struct data
- * int data_cmp(void *a, void *b)
- * {
- * struct data *aa = (struct data *) a;
- * struct data *bb = (struct data *) b;
- *
- * // Protect against NULL pointer
- * // It could generally never happened
- * if (!aa || !bb)
- * return 0;
- *
- * return aa->key - bb->key;
- * }
- *
- * // Function that dumps data structure
- * void data_print(void *d)
- * {
- * struct data *dd = (struct data *) d;
- *
- * if (dd)
- * printf("{ %d => %d }\n", dd->key, dd->value);
- * }
- *
- * // Function that delete a data structure
- * void data_delete(void *d)
- * {
- * struct data *dd = (struct data *) d;
- *
- * if (dd) {
- * // You can put here all additional needed
- * // memory deallocation
- * free(dd);
- * }
- * }
- *
- * int main(int argc, char *argv)
- * {
- * tree *avl_tree = NULL;
- * struct data tmp;
- * int result;
- *
- * // Initialize a new tree with our three previously defined
- * // functions to store data structure.
- * avl_tree = init_dictionnary(data_cmp, data_print, data_delete);
- *
- * tmp.key = 42;
- * tmp.value = 4242;
- *
- * // Add element {42, 4242} in our tree.
- * result = insert_elmt(avl_tree, &tmp, sizeof(struct data));
- * // Here result is equal to 1 since there is only 1 element in tree.
- *
- * // Dump tree to stdout with data_print function
- * print_tree(avl_tree);
- *
- * // For all search function, the only value needed in tmp structure
- * // is key field.
- * tmp.key = 20;
- * tmp.value = 0;
- *
- * if (!is_present(avl_tree, &tmp))
- * printf("Key 20 is not found.\n");
- *
- * tmp.key = 42;
- * if (is_present(avl_tree, &tmp))
- * printf("Key 42 exist in tree.\n");
- *
- * if (get_data(avl_tree, &tmp, sizeof(struct data)))
- * printf("Now, tmp.key is equal to 4242\n");
- *
- * delete_node(avl_tree, &tmp);
- * if (!is_present(avl_tree, &tmp))
- * printf("Key 42 does not exist anymore.\n");
- *
- * // Free all memory
- * delete_tree(avl_tree);
- *
- * return 0;
- * }
- * </pre>
- *
- * You can find this example in folder \b example.
- *
- * \subsection Tree initialisation
- *
- * To start a new tree, you need to init a new one with function
- * \b init_tree.
- *
- * \subsection Manage data
- *
- * The libavl provide all necessary function to store, retrieve and
- * browse your data. The following set gives basic operation:
- * * \b insert_elmt
- * * \b is_present
- * * \b get_data
- * * \b delete_node
- * * \b delete_node_min
- *
- * Moreover, libavl gives the availability to browse your entire data
- * or a subset of your data with:
- * * \b explore_tree
- * * \b explore_restrain_tree
- * * \b print_tree
- *
- * Finally, libavl take care of your memory and deallocate all memory
- * used in a tree when you want to destroy it with \b delete_tree.
- *
- */
-#ifndef __AVL_H__
-#define __AVL_H__
-
-#include <stddef.h>
-
-
-
-/** \struct _node
- * \brief Node of a tree
- *
- * Structure that contain all data usefull to organize the tree
- */
-struct _node {
- /** Size of subtree */
- unsigned height;
- /** Left son */
- struct _node *left;
- /** Right son */
- struct _node *right;
- /** Pointer to data stored in this node */
- void *data;
-};
-
-/**
- * \brief Pointer to the \c _node structure.
- */
-typedef struct _node *node;
-
-/**
- * \brief Tree structure wich contains all necessary element.
- */
-typedef struct _tree {
- /** Number of element in tree */
- unsigned count;
- /** Pointer to the first node of tree */
- node root;
- /** \brief External function to compare data
- *
- * \param a Pointer to first element to compare
- * \param b Pointer to second element to compare
- *
- * \return 0 if a = b, positive if a > b and negative if a < b.
- *
- * \note \e You must implement this function. It is necessary for the library
- * to work and depends on your data you want to store.
- */
- int (* data_cmp) (void *, void *);
- /** \brief External function to print data.
- *
- * \param d Pointer to data to print.
- *
- * This function is usefull for debuging program.
- *
- * \note \e You must implement this function. It is necessary for the library
- * to work and depends on your data you want to store.
- */
- void (* data_print) (void *d);
-
- /** \brief External function to delete data.
- *
- * \param d Pointer to data to delete.
- *
- * This function is usefull for when you want to delete data from tree to prevent
- * memory leak.
- *
- * \note \e You must implement this function. It is necessary for the library
- * to work and depends on your data you want to store.
- */
- void (* data_delete) (void *d);
-
- /** \brief External function to copy data.
- *
- * \param d Pointer to data to copy.
- * \return New data allocation with all its fields filled.
- *
- * \note \e You must implement this function. It is necessary for the library
- * to work and depends on your data you want to store.
- */
- void (* data_copy) (void *, void *);
-} tree;
-
-
-
-/* ************************************************************************* *\
-|* EXTERNAL FUNCTION *|
-\* ************************************************************************* */
-
-/** \fn tree *init_dictionnary(int (*data_cmp)(void *, void *),
- * void (*data_print)(void *),
- * void (*data_delete)(void *),
- * void (*data_copy)(void *, void *));
- * \brief Initialize dictionnary.
- *
- * \return Pointer to new tree.
- *
- * \param data_cmp Function to compare data.
- * \param data_print Function to print data.
- * \param data_delete Function to delete data.
- * \param data_copy Function to copy data.
- *
- * This function return an initilized tree.
- *
- * \note By default, if you do not provide function usefull to the tree,
- * the LibAVL library uses its own function. As LibAVL does not know exactly
- * the structure and the definition of your data, result can not be as good
- * as expected. Details on these functions are given in the following.
- *
- * \section LibAVL internal data function
- *
- * - Compare function: by default, the internal \c data_cmp function will
- * return the difference between the two pointer given in arguments
- *
- * return (int) ((ptrdiff_t) a - (ptrdiff_t) b);
- *
- * The \c data_cmp function is really critical and guarantee efficiency of
- * LibAVL.
- * - Print function: by default, the internal \c data_print function will
- * print the addresse contained in pointer in argument, in hexadecimal
- *
- * printf("0x%08x\n", d);
- *
- * Since \c data_print is mainly used as debug function to dump a complete
- * tree, it is not the most important data function, but with the correct
- * implementation, it could save lots of time and money when something
- * went wrong.
- * - Delete function: by default, the internal \c data_delete function will
- * call \c free on the argument pointer. If your data is only a static
- * structure or a simple type, this function is enough. But for bigger
- * object like a string array, it is necessary to provide a new
- * \c data_delete function to avoid memory leak.
- * - Copy function: by default, the internal \c data_copy function will
- * memcpy data.
- */
-tree *init_dictionnary(int (*data_cmp)(void *, void *),
- void (*data_print)(void *),
- void (*data_delete)(void *),
- void (*data_copy)(void *, void *));
-
-/** \fn int insert_elmt(tree *t, void *data, size_t datasize);
- * \brief Insert new element in tree.
- *
- * \return Number of element inserted in tree.
- * \param t Pointer to tree.
- * \param data Pointer to data to add.
- * \param datasize Size of data to add.
- *
- * This function allocate a new memory space with the given size
- * and copy object pointed by \c data to the newly created space.
- */
-unsigned int insert_elmt(tree *t, void *data, size_t datasize);
-
-/** \fn void verif_tree(tree *t);
- * \brief Deffensive check if tree is a real AVL tree.
- *
- * \param t Pointer to tree.
- *
- * If tree is not an AVL tree, this function end on an assert.
- */
-void verif_tree(tree *t);
-
-/** \fn void delete_tree(tree *t);
- * \brief Deallocate all memory used by tree.
- *
- * \param t Pointer to tree to delete.
- */
-void delete_tree(tree *t);
-
-/** \fn void print_tree(tree *t);
- * \brief Use for debug only. Print all element in tree with function
- * \c data_print.
- *
- * \param t Pointer to tree.
- */
-void print_tree(tree *t);
-
-/** \fn void explore_tree(tree *t, void (*treatement)(void *, void *),
- * void *param);
- * \brief Execute function \c treatement on every node in tree.
- *
- * \param t Pointer to tree.
- * \param treatement Function to apply to each node.
- * \param param Pointer to extra data to pass to \c treatement function.
- *
- * This function goes thought the entire tree and, if \c n is the pointer
- * to the current node, call the function:
- *
- * treatement(n, param);
- *
- */
-void explore_tree(tree *t, void (*treatement)(void *, void *), void *param);
-
-/** \fn explore_restrain_tree(tree *t, int (*check)(void *, void *),
- * void *param,
- * void *data_min, void *data_max);
- * \brief Execute function \c check on every node between \c data_min and
- * \c data_max.
- *
- * \return Accumulation of all return value of \c check function.
- * \param t Pointer to tree.
- * \param check Function apply on every node between \c data_min and
- * \c data_max
- * \param param Pointer to extra data to pass to \c check function.
- * \param data_min Pointer to the minimum element.
- * \param data_max Pointer to the maximum element.
- *
- * This function goes thought a part of tree bounded with \c data_min and
- * \c data_max, and if \c n is the pointer to the current node, it calls
- * the function:
- *
- * accu += check(n, param);
- *
- * The value of \c accu is returned by \c explore_restrain_tree.
- */
-int explore_restrain_tree(tree *t, int (*check)(void *, void *), void *param,
- void *data_min, void *data_max);
-
-/** \fn int is_present(tree *t, void *d);
- * \brief Function to check if a given data is present in tree.
- *
- * \return 1 if data is present, 0 if not.
- * \param t Pointer to tree.
- * \param d Pointer to data. Only field used in \c avl_data_cmp need
- * to be filled in \c d.
- */
-int is_present(tree *t, void *d);
-
-/** \fn void delete_node_min(tree *t);
- * \brief Delete minimum element of a tree.
- *
- * \param t Tree where minimum element will be deleted.
- */
-void delete_node_min(tree *t);
-
-/** \fn void delete_node(tree *t, void *data);
- * \brief Delete node n of tree.
- *
- * \param t Pointer to tree.
- * \param data Data to delete.
- */
-void delete_node(tree *t, void *data);
-
-/** \fn int get_data(tree *t, void *data, size_t data_size);
- * \brief Fill information pointed by data with the data stored in the tree.
- *
- * \return True if value pointed by data are relevant, false if not.
- *
- * \param t Pointer to tree.
- * \param data Data to retrieve. At the begining of the function, only
- * field used in \c avl_data_cmp must be filled.
- * \param data_size Size of data structure pointed by data.
- */
-int get_data(tree *t, void *data, size_t data_size);
-
-#endif
+++ /dev/null
-# ======================================================================================
-# File : Makefile
-# Author : Adrien Oliva
-# Last Change : 01/02/2013 | 18:53:35 PM | Wednesday,January
-# Description : Build script for FlieIO library (Unit test part)
-# ======================================================================================
-UNIT_TESTS = avl_tests.x
-TEST_DEPEND = ../avl.h ../syslog.h minunit.h
-
-include ../Makefile.global
-
-# Link
-avl_tests.x: avl_tests.o\
- avl_test01.o\
- avl_test02.o\
- avl_test03.o\
- avl_test04.o\
- avl_test05.o\
- avl_test06.o\
- avl_test07.o\
- avl_test08.o\
- avl_test09.o\
- avl_test10.o\
- avl_test11.o\
- ../avl.o
-
-# Dependencies
-avl_tests.o: $(TEST_DEPEND)
-avl_test01.o: $(TEST_DEPEND)
-avl_test02.o: $(TEST_DEPEND)
-avl_test03.o: $(TEST_DEPEND)
-avl_test04.o: $(TEST_DEPEND)
-avl_test05.o: $(TEST_DEPEND)
-avl_test06.o: $(TEST_DEPEND)
-avl_test07.o: $(TEST_DEPEND)
-avl_test08.o: $(TEST_DEPEND)
-avl_test09.o: $(TEST_DEPEND)
-avl_test10.o: $(TEST_DEPEND)
-avl_test11.o: $(TEST_DEPEND)
+++ /dev/null
-/*
- * Libavl is a library to manage AVL structure to store and organize
- * everykind of data. You just need to implement function to compare,
- * to desallocate and to print your structure.
- *
- * DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
- * Version 2, December 2004
- *
- * Copyright (C) 2013 Adrien Oliva <adrien.oliva@yapbreak.fr>
- *
- * Everyone is permitted to copy and distribute verbatim or modified
- * copies of this license document, and changing it is allowed as long
- * as the name is changed.
- *
- * DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
- * TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
- *
- * 0. You just DO WHAT THE FUCK YOU WANT TO.
- */
-
-#include <stdio.h>
-#include <stdlib.h>
-
-#include "../syslog.h"
-#include "../avl.h"
-
-int data_cmp(void *a, void *b)
-{
- return (int) ((char *) a - (char *) b);
-}
-
-void data_print(void *d)
-{
- printf("%p", d);
-}
-
-void data_delete(void *d)
-{
- (void) d;
-}
-
-char *alloc_tests()
-{
- tree *first = NULL;
-
- // Try to allocate a new tree.
- first = init_dictionnary(data_cmp, data_print, data_delete, NULL);
- if (first == NULL) {
- ELOG("Init dictionnary error");
- return "Init dictionnary error";
- }
- if (sizeof(*first) != sizeof(tree)) {
- ELOG("Wrong returned size");
- return "Wrong returned size";
- }
-
- // Try to delete it
- delete_tree(first);
-
- // Try to delete a null tree
- delete_tree(NULL);
-
-
- return NULL;
-}
+++ /dev/null
-/*
- * Libavl is a library to manage AVL structure to store and organize
- * everykind of data. You just need to implement function to compare,
- * to desallocate and to print your structure.
- *
- * DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
- * Version 2, December 2004
- *
- * Copyright (C) 2013 Adrien Oliva <adrien.oliva@yapbreak.fr>
- *
- * Everyone is permitted to copy and distribute verbatim or modified
- * copies of this license document, and changing it is allowed as long
- * as the name is changed.
- *
- * DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
- * TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
- *
- * 0. You just DO WHAT THE FUCK YOU WANT TO.
- */
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <time.h>
-
-#include "../syslog.h"
-#include "../avl.h"
-
-static int data_cmp(void *a, void *b)
-{
- int aa = *((int *) a);
- int bb = *((int *) b);
-
- return aa - bb;
-}
-
-static void data_print(void *d)
-{
- printf("%p|%d", d, *((int *) d));
-}
-
-static void data_delete(void *d)
-{
- free(d);
-}
-
-static void data_copy(void *src, void *dst)
-{
- *((int *) dst) = *((int *) src);
-}
-
-char *insert_tests()
-{
- tree *first = NULL;
- int data;
- unsigned int result;
-
- unsigned long rand_seed = (unsigned long) time(NULL);
- ILOG("Random seed: %lu", rand_seed);
- srand(rand_seed);
- // Try to allocate a new tree.
- first = init_dictionnary(data_cmp, data_print, data_delete, data_copy);
- if (first == NULL) {
- ELOG("Init dictionnary error");
- return "Init dictionnary error";
- }
- if (sizeof(*first) != sizeof(tree)) {
- ELOG("Wrong returned size");
- return "Wrong returned size";
- }
-
- data = rand();
-
- // Insert one element
- result = insert_elmt(first, &data, sizeof(int));
- if (result != 1) {
- ELOG("Wrong result of insert element");
- return "Wrong result of insert element";
- }
-
- // Check if element is in tree
- if (!is_present(first, &data)) {
- ELOG("Data not found in tree");
- return "Data not found in tree";
- }
-
-
- // Try to delete it
- delete_tree(first);
-
-
-
- return NULL;
-}
+++ /dev/null
-/*
- * Libavl is a library to manage AVL structure to store and organize
- * everykind of data. You just need to implement function to compare,
- * to desallocate and to print your structure.
- *
- * DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
- * Version 2, December 2004
- *
- * Copyright (C) 2013 Adrien Oliva <adrien.oliva@yapbreak.fr>
- *
- * Everyone is permitted to copy and distribute verbatim or modified
- * copies of this license document, and changing it is allowed as long
- * as the name is changed.
- *
- * DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
- * TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
- *
- * 0. You just DO WHAT THE FUCK YOU WANT TO.
- */
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <time.h>
-
-#include "../syslog.h"
-#include "../avl.h"
-
-static int data_cmp(void *a, void *b)
-{
- int aa = *((int *) a);
- int bb = *((int *) b);
-
- return aa - bb;
-}
-
-static void data_print(void *d)
-{
- printf("%p|%d", d, *((int *) d));
-}
-
-static void data_delete(void *d)
-{
- free(d);
-}
-
-char *lookup_tests()
-{
- tree *first = NULL;
- int data;
- unsigned int result;
-
- unsigned long rand_seed = (unsigned long) time(NULL);
- ILOG("Random seed: %lu", rand_seed);
- srand(rand_seed);
- // Try to allocate a new tree.
- first = init_dictionnary(data_cmp, data_print, data_delete, NULL);
- if (first == NULL) {
- ELOG("Init dictionnary error");
- return "Init dictionnary error";
- }
- if (sizeof(*first) != sizeof(tree)) {
- ELOG("Wrong returned size");
- return "Wrong returned size";
- }
-
- data = rand();
-
- // Insert one element
- result = insert_elmt(first, &data, sizeof(int));
- if (result != 1) {
- ELOG("Wrong result of insert element");
- return "Wrong result of insert element";
- }
-
- // Check if element is in tree
- if (!is_present(first, &data)) {
- ELOG("Data not found in tree");
- return "Data not found in tree";
- }
-
- // Insert element already installed
- result = insert_elmt(first, &data, sizeof(int));
-
- // Check if random element is present
- data++;
- if (is_present(first, &data)) {
- ELOG("Unknown Data found");
- return "Unknown data found";
- }
-
-
- // Try to delete it
- delete_tree(first);
-
-
-
- return NULL;
-}
+++ /dev/null
-/*
- * Libavl is a library to manage AVL structure to store and organize
- * everykind of data. You just need to implement function to compare,
- * to desallocate and to print your structure.
- *
- * DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
- * Version 2, December 2004
- *
- * Copyright (C) 2013 Adrien Oliva <adrien.oliva@yapbreak.fr>
- *
- * Everyone is permitted to copy and distribute verbatim or modified
- * copies of this license document, and changing it is allowed as long
- * as the name is changed.
- *
- * DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
- * TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
- *
- * 0. You just DO WHAT THE FUCK YOU WANT TO.
- */
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <time.h>
-
-#include "../syslog.h"
-#include "../avl.h"
-
-static int data_cmp(void *a, void *b)
-{
- int aa = *((int *) a);
- int bb = *((int *) b);
-
- return aa - bb;
-}
-
-static void data_print(void *d)
-{
- printf("%p|%d", d, *((int *) d));
-}
-
-static void data_delete(void *d)
-{
- free(d);
-}
-
-#define MAX_ELEMENT 10000
-
-char *add_existing_tests()
-{
- tree *first = NULL;
- int data[MAX_ELEMENT];
- unsigned int result;
- unsigned int element_in_tree = 0;
- int i = 0;
-
- unsigned long rand_seed = (unsigned long) time(NULL);
- ILOG("Random seed: %lu", rand_seed);
- srand(rand_seed);
-
- for (i = 0; i < MAX_ELEMENT; i++) {
- data[i] = rand();
- }
-
-
- // Try to allocate a new tree.
- first = init_dictionnary(data_cmp, data_print, data_delete, NULL);
- if (first == NULL) {
- ELOG("Init dictionnary error");
- return "Init dictionnary error";
- }
-
- verif_tree(first);
- for (i = 0; i < MAX_ELEMENT; i++) {
- if (!is_present(first, &(data[i]))) {
- element_in_tree++;
- }
- result = insert_elmt(first, &(data[i]), sizeof(int));
- if (result != element_in_tree) {
- ELOG("Wrong result of inserted element");
- return "Wrong result of inserted element";
- }
- verif_tree(first);
- }
-
- // Try to add existing data
- for (i = 0; i < MAX_ELEMENT; i++) {
- if (!is_present(first, &(data[i]))) {
- ELOG("Element is not present, it said! F**k");
- return "Element is not present";
- }
- result = insert_elmt(first, &(data[i]), sizeof(int));
- if (result != element_in_tree) {
- ELOG("Wrong result of inserted element");
- return "Wrong result of inserted element";
- }
- verif_tree(first);
- }
-
-
- // Try to delete it
- delete_tree(first);
-
-
-
- return NULL;
-}
+++ /dev/null
-/*
- * Libavl is a library to manage AVL structure to store and organize
- * everykind of data. You just need to implement function to compare,
- * to desallocate and to print your structure.
- *
- * DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
- * Version 2, December 2004
- *
- * Copyright (C) 2013 Adrien Oliva <adrien.oliva@yapbreak.fr>
- *
- * Everyone is permitted to copy and distribute verbatim or modified
- * copies of this license document, and changing it is allowed as long
- * as the name is changed.
- *
- * DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
- * TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
- *
- * 0. You just DO WHAT THE FUCK YOU WANT TO.
- */
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <time.h>
-
-#include "../syslog.h"
-#include "../avl.h"
-
-static int data_cmp(void *a, void *b)
-{
- int aa = *((int *) a);
- int bb = *((int *) b);
-
- return aa - bb;
-}
-
-static void data_print(void *d)
-{
- printf("%p|%d", d, *((int *) d));
-}
-
-static void data_delete(void *d)
-{
- free(d);
-}
-
-#define MAX_ELEMENT 10000
-
-char *delete_tests()
-{
- tree *first = NULL;
- int data[MAX_ELEMENT];
- unsigned int result;
- unsigned int element_in_tree = 0;
- int i = 0;
-
- unsigned long rand_seed = (unsigned long) time(NULL);
- ILOG("Random seed: %lu", rand_seed);
- srand(rand_seed);
-
- for (i = 0; i < MAX_ELEMENT; i++) {
- data[i] = rand();
- }
-
-
- verif_tree(first);
-
- // Try to allocate a new tree.
- first = init_dictionnary(data_cmp, data_print, data_delete, NULL);
- if (first == NULL) {
- ELOG("Init dictionnary error");
- return "Init dictionnary error";
- }
-
- // Add data
- verif_tree(first);
- for (i = 0; i < MAX_ELEMENT; i++) {
- if (!is_present(first, &(data[i]))) {
- element_in_tree++;
- }
- result = insert_elmt(first, &(data[i]), sizeof(int));
- if (result != element_in_tree) {
- ELOG("Wrong result of inserted element");
- return "Wrong result of inserted element";
- }
- verif_tree(first);
- }
-
- // Delete data
- for (i = 0; i < MAX_ELEMENT; i++) {
- delete_node(first, &(data[i]));
- if (is_present(first, &(data[i]))) {
- ELOG("Data not deleted");
- return "Data not deleted";
- }
- verif_tree(first);
- }
-
-
- // Try to delete it
- delete_tree(first);
-
-
-
- return NULL;
-}
+++ /dev/null
-/*
- * Libavl is a library to manage AVL structure to store and organize
- * everykind of data. You just need to implement function to compare,
- * to desallocate and to print your structure.
- *
- * DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
- * Version 2, December 2004
- *
- * Copyright (C) 2013 Adrien Oliva <adrien.oliva@yapbreak.fr>
- *
- * Everyone is permitted to copy and distribute verbatim or modified
- * copies of this license document, and changing it is allowed as long
- * as the name is changed.
- *
- * DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
- * TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
- *
- * 0. You just DO WHAT THE FUCK YOU WANT TO.
- */
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <time.h>
-
-#include "../syslog.h"
-#include "../avl.h"
-
-struct _tree_data {
- int key;
- int value;
-};
-
-static int data_cmp(void *a, void *b)
-{
- struct _tree_data aa = *((struct _tree_data *) a);
- struct _tree_data bb = *((struct _tree_data *) b);
-
- return aa.key - bb.key;
-}
-
-static void data_print(void *d)
-{
- printf("%p|%d-%d", d,
- ((struct _tree_data *) d)->key, ((struct _tree_data *) d)->value);
-}
-
-static void data_delete(void *d)
-{
- free(d);
-}
-
-#define MAX_ELEMENT 10000
-
-char *struct_tests()
-{
- tree *first = NULL;
- struct _tree_data data[MAX_ELEMENT];
- struct _tree_data look_for_data;
- unsigned int result;
- int bool_result;
- unsigned int element_in_tree = 0;
- int i = 0;
-
- unsigned long rand_seed = (unsigned long) time(NULL);
- ILOG("Random seed: %lu", rand_seed);
- srand(rand_seed);
-
- for (i = 0; i < MAX_ELEMENT; i++) {
- data[i].key = rand();
- data[i].value = rand();
- }
-
-
- verif_tree(first);
-
- // Get data on non existing tree
- for (i = MAX_ELEMENT - 1; i >= 0; i--) {
- look_for_data.key = data[i].key;
- bool_result = get_data(first, &(look_for_data), sizeof(struct _tree_data));
- if (bool_result) {
- ELOG("Data found");
- return "Data found";
- }
- }
-
- // Try to allocate a new tree.
- first = init_dictionnary(data_cmp, data_print, data_delete, NULL);
- if (first == NULL) {
- ELOG("Init dictionnary error");
- return "Init dictionnary error";
- }
-
- // Get data on empty tree
- for (i = MAX_ELEMENT - 1; i >= 0; i--) {
- look_for_data.key = data[i].key;
- bool_result = get_data(first, &(look_for_data), sizeof(struct _tree_data));
- if (bool_result) {
- ELOG("Data found");
- return "Data found";
- }
- }
-
- // Add data
- verif_tree(first);
- for (i = 0; i < MAX_ELEMENT; i++) {
- look_for_data.key = data[i].key;
- if (!is_present(first, &(look_for_data))) {
- element_in_tree++;
- }
- result = insert_elmt(first, &(data[i]), sizeof(struct _tree_data));
- if (result != element_in_tree) {
- ELOG("Wrong result of inserted element");
- return "Wrong result of inserted element";
- }
- verif_tree(first);
- }
-
- // Get data
- for (i = MAX_ELEMENT - 1; i >= 0; i--) {
- look_for_data.key = data[i].key;
- bool_result = get_data(first, &(look_for_data), sizeof(struct _tree_data));
- if (!bool_result) {
- ELOG("Data not found");
- return "Data not found";
- }
- if ( look_for_data.key != data[i].key
- && look_for_data.value != data[i].value) {
- ELOG("Not the good data retrieve.");
- return "Not the good data retrieve.";
- }
- verif_tree(first);
- }
-
-
- // Try to delete it
- delete_tree(first);
-
-
-
- return NULL;
-}
+++ /dev/null
-/*
- * Libavl is a library to manage AVL structure to store and organize
- * everykind of data. You just need to implement function to compare,
- * to desallocate and to print your structure.
- *
- * DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
- * Version 2, December 2004
- *
- * Copyright (C) 2013 Adrien Oliva <adrien.oliva@yapbreak.fr>
- *
- * Everyone is permitted to copy and distribute verbatim or modified
- * copies of this license document, and changing it is allowed as long
- * as the name is changed.
- *
- * DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
- * TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
- *
- * 0. You just DO WHAT THE FUCK YOU WANT TO.
- */
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <time.h>
-
-#include "../syslog.h"
-#include "../avl.h"
-
-struct _tree_data {
- int key;
- int value;
-};
-
-static int data_cmp(void *a, void *b)
-{
- struct _tree_data aa = *((struct _tree_data *) a);
- struct _tree_data bb = *((struct _tree_data *) b);
-
- return aa.key - bb.key;
-}
-
-static void data_print(void *d)
-{
- printf("%p|%d-%d", d,
- ((struct _tree_data *) d)->key, ((struct _tree_data *) d)->value);
-}
-
-static void data_delete(void *d)
-{
- free(d);
-}
-
-#define MAX_ELEMENT 10000
-
-char *get_data_tests()
-{
- tree *first = NULL;
- struct _tree_data data[MAX_ELEMENT];
- struct _tree_data tmp_elmnt;
- struct _tree_data current_min;
- unsigned int result;
- unsigned int element_in_tree = 0;
- int i = 0;
- int j = 0;
-
- unsigned long rand_seed = (unsigned long) time(NULL);
- ILOG("Random seed: %lu", rand_seed);
- srand(rand_seed);
-
- for (i = 0; i < MAX_ELEMENT; i++) {
- data[i].key = rand();
- data[i].value = rand();
- }
-
-
- verif_tree(first);
-
- // Try to allocate a new tree.
- first = init_dictionnary(data_cmp, data_print, data_delete, NULL);
- if (first == NULL) {
- ELOG("Init dictionnary error");
- return "Init dictionnary error";
- }
-
- // Add data
- verif_tree(first);
- for (i = 0; i < MAX_ELEMENT; i++) {
- tmp_elmnt.key = data[i].key;
- if (!is_present(first, &(tmp_elmnt))) {
- element_in_tree++;
- }
- result = insert_elmt(first, &(data[i]), sizeof(struct _tree_data));
- if (result != element_in_tree) {
- ELOG("Wrong result of inserted element");
- return "Wrong result of inserted element";
- }
- verif_tree(first);
- }
-
- current_min.key = (int) 0x80000000;
- current_min.value = (int) 0x80000000;
-
- for (i = 0; i < MAX_ELEMENT && element_in_tree != 0; i++) {
- tmp_elmnt.key = (int) 0x7fffffff;
- tmp_elmnt.value = (int) 0x7fffffff;
- // Get minimum data
- for (j = 0; j < MAX_ELEMENT; j++) {
- if ( data[j].key < tmp_elmnt.key
- && data[j].key > current_min.key) {
- tmp_elmnt.key = data[j].key;
- tmp_elmnt.value = data[j].value;
- }
-
- }
-
- current_min.key = tmp_elmnt.key;
- current_min.value = tmp_elmnt.value;
-
- if (!is_present(first, &tmp_elmnt)) {
- ELOG("Minimum data not in tree");
- return "Minimum data not in tree";
- }
- delete_node_min(first);
- if (is_present(first, &tmp_elmnt)) {
- ELOG("Minimum element deleted");
- return "Minimum element deleted";
- }
- element_in_tree--;
- verif_tree(first);
- }
-
- // Try to delete it
- delete_tree(first);
-
-
-
- return NULL;
-}
+++ /dev/null
-/*
- * Libavl is a library to manage AVL structure to store and organize
- * everykind of data. You just need to implement function to compare,
- * to desallocate and to print your structure.
- *
- * DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
- * Version 2, December 2004
- *
- * Copyright (C) 2013 Adrien Oliva <adrien.oliva@yapbreak.fr>
- *
- * Everyone is permitted to copy and distribute verbatim or modified
- * copies of this license document, and changing it is allowed as long
- * as the name is changed.
- *
- * DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
- * TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
- *
- * 0. You just DO WHAT THE FUCK YOU WANT TO.
- */
-
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <time.h>
-
-#include "../syslog.h"
-#include "../avl.h"
-
-struct _tree_data {
- int key;
- int value;
-};
-
-static int data_cmp(void *a, void *b)
-{
- struct _tree_data aa = *((struct _tree_data *) a);
- struct _tree_data bb = *((struct _tree_data *) b);
-
- return aa.key - bb.key;
-}
-
-static void data_print(void *d)
-{
- printf("%p|%d-%d", d,
- ((struct _tree_data *) d)->key, ((struct _tree_data *) d)->value);
-}
-
-static void data_delete(void *d)
-{
- free(d);
-}
-
-#define MAX_ELEMENT 10000
-
-char *print_tests()
-{
- tree *first = NULL;
- struct _tree_data data[MAX_ELEMENT];
- struct _tree_data tmp_elmnt;
- unsigned int result;
- unsigned int element_in_tree = 0;
- int i = 0;
-
- unsigned long rand_seed = (unsigned long) time(NULL);
- ILOG("Random seed: %lu", rand_seed);
- srand(rand_seed);
-
- for (i = 0; i < MAX_ELEMENT; i++) {
- data[i].key = rand();
- data[i].value = rand();
- }
-
-
- verif_tree(first);
- // Try to print an null tree.
- print_tree(first);
-
- // Try to allocate a new tree.
- first = init_dictionnary(data_cmp, data_print, data_delete, NULL);
- if (first == NULL) {
- ELOG("Init dictionnary error");
- return "Init dictionnary error";
- }
-
- // Try to print an empty tree
- print_tree(first);
-
- // Add data
- verif_tree(first);
- for (i = 0; i < MAX_ELEMENT; i++) {
- tmp_elmnt.key = data[i].key;
- if (!is_present(first, &(tmp_elmnt))) {
- element_in_tree++;
- }
- result = insert_elmt(first, &(data[i]), sizeof(struct _tree_data));
- if (result != element_in_tree) {
- ELOG("Wrong result of inserted element");
- return "Wrong result of inserted element";
- }
- verif_tree(first);
- }
-
- print_tree(first);
-
- // Try to delete it
- delete_tree(first);
-
-
-
- return NULL;
-}
+++ /dev/null
-/*
- * Libavl is a library to manage AVL structure to store and organize
- * everykind of data. You just need to implement function to compare,
- * to desallocate and to print your structure.
- *
- * DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
- * Version 2, December 2004
- *
- * Copyright (C) 2013 Adrien Oliva <adrien.oliva@yapbreak.fr>
- *
- * Everyone is permitted to copy and distribute verbatim or modified
- * copies of this license document, and changing it is allowed as long
- * as the name is changed.
- *
- * DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
- * TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
- *
- * 0. You just DO WHAT THE FUCK YOU WANT TO.
- */
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <time.h>
-#include <string.h>
-
-#include "../syslog.h"
-#include "../avl.h"
-
-struct _tree_data {
- int key;
- int value;
-};
-
-static int data_cmp(void *a, void *b)
-{
- struct _tree_data aa = *((struct _tree_data *) a);
- struct _tree_data bb = *((struct _tree_data *) b);
-
- return aa.key - bb.key;
-}
-
-static void data_print(void *d)
-{
- printf("%p|%d-%d", d,
- ((struct _tree_data *) d)->key, ((struct _tree_data *) d)->value);
-}
-
-static void data_delete(void *d)
-{
- free(d);
-}
-
-static void data_copy(void *src, void *dst)
-{
- memcpy(dst, src, sizeof(struct _tree_data));
-}
-
-#define MAX_ELEMENT 10000
-
-static void count_treat(void *n, void *param)
-{
- struct _tree_data *data = (struct _tree_data *) n;
-
- if (param != NULL) {
- *((unsigned int *) param) += (unsigned) data->value;
- }
-}
-
-char *explore_tests()
-{
- tree *first = NULL;
- struct _tree_data data[MAX_ELEMENT];
- struct _tree_data tmp_elmnt;
- unsigned int result;
- unsigned int element_in_tree = 0;
- int i = 0;
- unsigned int r = 0;
-
- unsigned long rand_seed = (unsigned long) time(NULL);
- ILOG("Random seed: %lu", rand_seed);
- srand(rand_seed);
-
- for (i = 0; i < MAX_ELEMENT; i++) {
- data[i].key = rand();
- data[i].value = 1;
- }
-
- // explore tree on a NULL tree
- explore_tree(first, count_treat, &r);
- if (r != 0) {
- ELOG("Wrong result on NULL tree");
- return "Wrong result on NULL tree";
- }
-
- // Try to allocate a new tree.
- first = init_dictionnary(data_cmp, data_print, data_delete, data_copy);
- if (first == NULL) {
- ELOG("Init dictionnary error");
- return "Init dictionnary error";
- }
-
- // explore tree on an empty tree
- explore_tree(first, count_treat, &r);
- if (r != 0) {
- ELOG("Wrong result on empty tree");
- return "Wrong result on empty tree";
- }
-
- // Add data
- verif_tree(first);
- for (i = 0; i < MAX_ELEMENT; i++) {
- tmp_elmnt.key = data[i].key;
- if (!is_present(first, &(tmp_elmnt))) {
- element_in_tree++;
- }
- result = insert_elmt(first, &(data[i]), sizeof(struct _tree_data));
- if (result != element_in_tree) {
- ELOG("Wrong result of inserted element");
- return "Wrong result of inserted element";
- }
- verif_tree(first);
- }
-
- explore_tree(first, count_treat, &r);
- if (r != element_in_tree) {
- ELOG("Wrong result on empty tree: %d != %d", r, element_in_tree);
- return "Wrong result on empty tree";
- }
-
- // Try to delete it
- delete_tree(first);
-
-
-
- return NULL;
-}
+++ /dev/null
-/*
- * Libavl is a library to manage AVL structure to store and organize
- * everykind of data. You just need to implement function to compare,
- * to desallocate and to print your structure.
- *
- * DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
- * Version 2, December 2004
- *
- * Copyright (C) 2013 Adrien Oliva <adrien.oliva@yapbreak.fr>
- *
- * Everyone is permitted to copy and distribute verbatim or modified
- * copies of this license document, and changing it is allowed as long
- * as the name is changed.
- *
- * DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
- * TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
- *
- * 0. You just DO WHAT THE FUCK YOU WANT TO.
- */
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <time.h>
-#include <string.h>
-
-#include "../syslog.h"
-#include "../avl.h"
-
-struct _tree_data {
- int key;
- int value;
-};
-
-static int data_cmp(void *a, void *b)
-{
- struct _tree_data aa = *((struct _tree_data *) a);
- struct _tree_data bb = *((struct _tree_data *) b);
-
- return aa.key - bb.key;
-}
-
-static void data_print(void *d)
-{
- printf("%p|%d-%d", d,
- ((struct _tree_data *) d)->key, ((struct _tree_data *) d)->value);
-}
-
-static void data_delete(void *d)
-{
- free(d);
-}
-
-static void data_copy(void *src, void *dst)
-{
- memcpy(dst, src, sizeof(struct _tree_data));
-}
-
-#define MAX_ELEMENT 10000
-
-static int count_treat(void *n, void *param)
-{
- struct _tree_data *data = (struct _tree_data *) n;
-
- if (param != NULL) {
- *((unsigned int *) param) += (unsigned) data->value;
- }
-
- return 1;
-}
-
-char *explore_restrain_tests()
-{
- tree *first = NULL;
- struct _tree_data data[MAX_ELEMENT];
- struct _tree_data tmp_elmnt;
- struct _tree_data node_min;
- struct _tree_data node_max;
- unsigned int result;
- unsigned int element_in_tree = 0;
- int i = 0;
- int j = 0;
- unsigned int r = 0;
- int return_value = 0;
- int count = 0;
-
- unsigned long rand_seed = (unsigned long) time(NULL);
- ILOG("Random seed: %lu", rand_seed);
- srand(rand_seed);
-
- node_min.key = rand();
- node_max.key = 0;
- while (node_max.key < node_min.key)
- node_max.key = rand();
-
- for (i = 0; i < MAX_ELEMENT; i++) {
- data[i].key = rand();
- data[i].value = 1;
- if ( (data[i].key < node_max.key)
- && (data[i].key > node_min.key)
- ) {
- count++;
- for (j = 0; j < i; j++) {
- if (data[i].key == data[j].key) {
- count--;
- break;
- }
- }
- }
-
- }
-
- // explore tree on a NULL tree
- return_value = explore_restrain_tree(first, count_treat, &r, &node_min, &node_max);
- if (r != 0 || return_value != 0) {
- ELOG("Wrong result on NULL tree");
- return "Wrong result on NULL tree";
- }
-
- // Try to allocate a new tree.
- first = init_dictionnary(data_cmp, data_print, data_delete, data_copy);
- if (first == NULL) {
- ELOG("Init dictionnary error");
- return "Init dictionnary error";
- }
-
- // explore tree on an empty tree
- return_value = explore_restrain_tree(first, count_treat, &r, &node_min, &node_max);
- if (r != 0 || return_value != 0) {
- ELOG("Wrong result on empty tree");
- return "Wrong result on empty tree";
- }
-
- // Add data
- verif_tree(first);
- for (i = 0; i < MAX_ELEMENT; i++) {
- tmp_elmnt.key = data[i].key;
- if (!is_present(first, &(tmp_elmnt))) {
- element_in_tree++;
- }
- result = insert_elmt(first, &(data[i]), sizeof(struct _tree_data));
- if (result != element_in_tree) {
- ELOG("Wrong result of inserted element");
- return "Wrong result of inserted element";
- }
- verif_tree(first);
- }
-
- return_value = explore_restrain_tree(first, count_treat, &r, &node_min, &node_max);
- if (r != (unsigned) return_value) {
- ELOG("Wrong return param");
- return "Wrong return param";
- }
- if (return_value != count) {
- ELOG("Wrong number of detected element in tree");
- return "Wrong number of detected element in tree";
- }
-
- // Try to delete it
- delete_tree(first);
-
- return NULL;
-}
+++ /dev/null
-/*
- * Libavl is a library to manage AVL structure to store and organize
- * everykind of data. You just need to implement function to compare,
- * to desallocate and to print your structure.
- *
- * DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
- * Version 2, December 2004
- *
- * Copyright (C) 2013 Adrien Oliva <adrien.oliva@yapbreak.fr>
- *
- * Everyone is permitted to copy and distribute verbatim or modified
- * copies of this license document, and changing it is allowed as long
- * as the name is changed.
- *
- * DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
- * TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
- *
- * 0. You just DO WHAT THE FUCK YOU WANT TO.
- */
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <time.h>
-
-#include "../syslog.h"
-#include "../avl.h"
-
-static int data_cmp(void *a, void *b)
-{
- int aa = *((int *) a);
- int bb = *((int *) b);
-
- return aa - bb;
-}
-
-static void data_print(void *d)
-{
- printf("%p|%d", d, *((int *) d));
-}
-
-static void data_delete(void *d)
-{
- free(d);
-}
-
-static void data_copy(void *src, void *dst)
-{
- *((int *) dst) = *((int *) src);
-}
-
-char *same_element_values_tests()
-{
- tree *first = NULL;
- int data;
- int get_data_result = 0;
- unsigned int result;
-
- unsigned long rand_seed = (unsigned long) time(NULL);
- ILOG("Random seed: %lu", rand_seed);
- srand(rand_seed);
- // Try to allocate a new tree.
- first = init_dictionnary(data_cmp, data_print, data_delete, data_copy);
- if (first == NULL) {
- ELOG("Init dictionnary error");
- return "Init dictionnary error";
- }
- if (sizeof(*first) != sizeof(tree)) {
- ELOG("Wrong returned size");
- return "Wrong returned size";
- }
-
- data = rand();
-
- // Insert one element
- result = insert_elmt(first, &data, sizeof(int));
- if (result != 1) {
- ELOG("Wrong result of insert element");
- return "Wrong result of insert element";
- }
-
- // Check if element is in tree
- if (!is_present(first, &data)) {
- ELOG("Data not found in tree");
- return "Data not found in tree";
- }
-
- // Check value of element
- get_data_result = data;
- if (!get_data(first, &get_data_result, sizeof(int))) {
- ELOG("Wrong get data result");
- return "Wrong get data result";
- }
-
- if (data != get_data_result) {
- ELOG("Wrong data stored");
- return "Wrong data stored";
- }
-
- // Insert the same element
- result = insert_elmt(first, &data, sizeof(int));
- if (result != 1) {
- ELOG("Wrong result of insert element");
- return "Wrong result of insert element";
- }
-
- // Check if element is in tree
- if (!is_present(first, &data)) {
- ELOG("Data not found in tree");
- return "Data not found in tree";
- }
-
- // Check value of element
- get_data_result = data;
- if (!get_data(first, &get_data_result, sizeof(int))) {
- ELOG("Wrong get data result");
- return "Wrong get data result";
- }
-
- if (data != get_data_result) {
- ELOG("Wrong data stored");
- return "Wrong data stored";
- }
-
- // Try to delete it
- delete_tree(first);
-
-
-
- return NULL;
-}
+++ /dev/null
-/*
- * Libavl is a library to manage AVL structure to store and organize
- * everykind of data. You just need to implement function to compare,
- * to desallocate and to print your structure.
- *
- * DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
- * Version 2, December 2004
- *
- * Copyright (C) 2013 Adrien Oliva <adrien.oliva@yapbreak.fr>
- *
- * Everyone is permitted to copy and distribute verbatim or modified
- * copies of this license document, and changing it is allowed as long
- * as the name is changed.
- *
- * DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
- * TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
- *
- * 0. You just DO WHAT THE FUCK YOU WANT TO.
- */
-
-#include <stdio.h>
-#include <stdlib.h>
-
-#include "../syslog.h"
-#include "../avl.h"
-#include "minunit.h"
-
-int tests_run = 0;
-
-extern char *alloc_tests();
-extern char *insert_tests();
-extern char *lookup_tests();
-extern char *add_existing_tests();
-extern char *delete_tests();
-extern char *struct_tests();
-extern char *get_data_tests();
-extern char *print_tests();
-extern char *explore_tests();
-extern char *explore_restrain_tests();
-extern char *same_element_values_tests();
-
-static char *all_tests() {
- mu_run_test(alloc_tests);
- mu_run_test(insert_tests);
- mu_run_test(lookup_tests);
- mu_run_test(add_existing_tests);
- mu_run_test(delete_tests);
- mu_run_test(struct_tests);
- mu_run_test(get_data_tests);
- mu_run_test(print_tests);
- mu_run_test(explore_tests);
- mu_run_test(explore_restrain_tests);
- mu_run_test(same_element_values_tests);
-
- return NULL;
-}
-
-int main(int argc, char **argv)
-{
- (void) argc;
- (void) argv;
-
- mu_run_all(all_tests);
-
- return 0;
-}
+++ /dev/null
-// ======================================================================================
-// File : minunit.h
-// Author : Adrien Oliva
-// Last Change : 01/02/2013 | 10:46:45 AM | Wednesday,January
-// Description : Minimal unit test framework
-// ======================================================================================
-#ifndef __MINUNIT_H__
-#define __MINUNIT_H__
-
-// ========================================================
-// Test framework configuration
-// ========================================================
-
-#ifdef WITH_RANDOM
-#ifdef __CPLUSPLUS
-#include <ctime>
-#include <random>
-#endif
-#endif
-
-// ========================================================
-// Test framework:
-// Each unit test function must be on form
-// char *unit_test();
-// On success, function must return NULL and on error,
-// function must return a string describing the error.
-//
-// To help writing test, you can use the "mu_assert"
-// macro to perform a vital test. If test fails, macro
-// return the given error message. If test is ok,
-// program continue without doing anything.
-//
-// Once a test function is written, you must call it
-// with macro "mu_run_test" which takes in argument
-// the test function. You can compile all tests in a
-// single function "char *all_test()" which calls all
-// your "mu_run_test". With such a function, you can
-// simply call in your main, the macro "mu_run_all":
-// it runs all your tests, print the number of passed
-// tests, and the error message if a test fails.
-//
-// Finally, the last macro provide by minunit is
-// "mu_run_set". This macro is similar to
-// "mu_run_test" but does not increase the number of
-// test run.
-// ========================================================
-
-#ifdef __CPLUSPLUS
-#define mu_assert(message, test) do { \
- if (!(test)) \
- return const_cast<char *>(message); \
-} while (0)
-#else
-#define mu_assert(message, test) do { \
- if (!(test)) \
- return (char *) (message); \
-} while (0)
-#endif
-
-#ifdef __CPLUSPLUS
-#define mu_try try
-#define mu_catch(message) catch (...) { \
- std::string error_msg = std::string("Exception in "); \
- error_msg += std::string(__func__); \
- error_msg += std::string(": "); \
- error_msg += message; \
- return const_cast<char *>(error_msg.c_str()); \
-}
-#endif
-
-#define mu_run_test(test) do { \
- char *message = test(); \
- tests_run++; \
- if (message) \
- return message; \
-} while (0)
-
-#define mu_run_set(test_set) do { \
- char *message = test_set(); \
- if (message) \
- return message; \
-} while (0)
-
-#define mu_run_all(all_tests) do { \
- char *result = all_tests(); \
- printf("%d test(s) run.\n", tests_run); \
- if (result != 0) { \
- fprintf(stdout, "%s\n", result); \
- fprintf(stderr, "\e[01;31m"); \
- fflush(stderr); \
- fprintf(stdout, "TEST FAILED"); \
- fflush(stdout); \
- fprintf(stderr, "\e[0m"); \
- fflush(stderr); \
- fprintf(stdout, "\n"); \
- return -1; \
- } else { \
- fprintf(stderr, "\e[01;32m"); \
- fflush(stderr); \
- fprintf(stdout, "ALL TESTS PASSED"); \
- fflush(stdout); \
- fprintf(stderr, "\e[0m"); \
- fflush(stderr); \
- fprintf(stdout, "\n"); \
- return 0; \
- } \
-} while (0)
-
-extern int tests_run;
-
-// ========================================================
-// Usefull function to generate random stuff
-// ========================================================
-
-#ifdef __CPLUSPLUS
-static void inline get_random_string(std::string &str, std::string &pool, int size) {
- unsigned index = 0;
-#ifdef WITH_RANDOM
- std::random_device rd;
- unsigned bytes = 0;
- for (int i = 0; i < size; i++) {
- index = rd() % pool.size();
- if (pool[index] & 0x80) {
- while (((pool[index] & 0xc0) >> 6) != 0x03)
- index--;
- if (((pool[index] & 0xfe) >> 1) == 0x7e)
- bytes = 6;
- else if (((pool[index] & 0xfc) >> 2) == 0x3e)
- bytes = 5;
- else if (((pool[index] & 0xf8) >> 3) == 0x1e)
- bytes = 4;
- else if (((pool[index] & 0xf0) >> 4) == 0x0e)
- bytes = 3;
- else if (((pool[index] & 0xe0) >> 5) == 0x06)
- bytes = 2;
- for (unsigned int j = 0; j < bytes; j++)
- str += pool[index + j];
- } else {
- str += pool[index];
- }
- }
-#else
- for (int i = 0; i < size; i++) {
- do {
- str += pool[index % pool.size()];
- index++;
- } while (pool[index % pool.size()] & 0x80);
- }
-
-#endif
-}
-#endif
-
-#endif
for (k = 0; k <= hyphen_prime; k++) hyph_list[k]= 0;
#endif
- hyph_count = 0; /* or use reset_hyphen() in itex.c */
+ hyph_count = 0;
if (current_prime != 0)
{
current_font_mem_size = newsize;
if (trace_flag)
- probe_show(); /* 94/Mar/25 */
+ probe_show();
+
return font_info;
}
#endif
}
if (trace_flag)
- probe_show(); /* 94/Mar/25 */
+ probe_show();
return str_pool;
}
}
if (trace_flag)
- probe_show(); /* 94/Mar/25 */
+ probe_show();
return str_start;
}
trie_c = (packed_ASCII_code *) malloc (roundup(nc));
trie_r = (trie_pointer *) malloc (roundup(nr));
trie_hash = (trie_pointer *) malloc (roundup(nh));
-/* trie_taken = (bool *) malloc (nt); */
trie_taken = (char *) malloc (roundup(nt));
if (trie_c == NULL || trie_o == NULL || trie_l == NULL || trie_r == NULL ||
update_statistics ((int) trie_taken, nt, 0);
/* trie_size = size; */ /* ??? */
if (trace_flag)
- probe_show(); /* 94/Mar/25 */
+ probe_show();
- return 0; // success
+ return 0; // success
}
#endif
#endif
#ifdef ALLOCATEPARAMSTACK
-int current_param_size=0; /* current param size */
+int current_param_size = 0;
halfword *realloc_param_stack (int size)
{
buffer = newbuffer;
update_statistics ((int) buffer, n, current_buf_size);
+
#ifdef USEMEMSET
memset(buffer + current_buf_size, 0, newsize - current_buf_size);
#else
for (k = current_buf_size; k < newsize; k++) buffer[k]= 0;
#endif
+
current_buf_size = newsize;
if (trace_flag)
if (pdf_file_name != NULL)
free(pdf_file_name);
- pdf_file_name = log_file_name = dvi_file_name = NULL; /* 00/Jun/18 */
+ pdf_file_name = log_file_name = dvi_file_name = NULL;
return 0;
}
# Release version
# CFLAGS=/c /Ge /Gy /Gf /Ox /W4 /DMSDOS /DTeX /DPHARLAP /DNDEBUG /Ilib /YX
CFLAGS=/nologo /c /MT /GF /Gy /Ox /W4 /DMSDOS /DTeX /DPHARLAP /DNDEBUG \
- /I"kpathsea" /I"libharu/include" /I"libharu/win32/include" /I"libavl/libavl"
+ /I"kpathsea" /I"libharu/include" /I"libharu/win32/include"
# Debugging version
# CFLAGS=/c /Ge /Gy /Gf /Od /Zi /W4 /DMSDOS /DTeX /DPHARLAP /Ilib /YX
tex0.obj tex1.obj tex2.obj tex3.obj tex4.obj \
tex5.obj tex6.obj tex7.obj tex8.obj tex9.obj \
yandy_pool.obj yandytex.res md5.obj md5file.obj \
- yandy_pdf_backend.obj avl.obj
+ yandy_pdf_backend.obj
# ### ### ### ### ### ### ### ### ### ### ### ### ### ### ### ### ### ### ###
$(LINK) $(LFLAGS) yandytex itex openinou subroute local \
tex0 tex1 tex2 tex3 tex4 tex5 tex6 tex7 tex8 tex9 \
yandy_pool yandytex.res md5 md5file yandy_pdf_backend \
- avl \
kpathsea\kpathsea.lib libharu\libhpdf.lib libpng\libpng.lib zlib\zlib.lib
del ..\yandy\bin\yandytex.exe
copy yandytex.exe ..\yandy\bin\yandytex.exe
# ### ### ### ### ### ### ### ### ### ### ### ### ### ### ### ### ### ### ###
-avl.obj: libavl/libavl/avl.c
- $(CC) $(CFLAGS) libavl/libavl/avl.c
-
yandy_pdf_backend.obj: yandy_pdf_backend.c
$(CC) $(CFLAGS) yandy_pdf_backend.c
}
HPDF_Free(yandy_pdf);
- free_tfm_map();
}
else
{
//EXTERN integer ten_pow[10];
EXTERN integer scaled_out;
EXTERN bool pdf_output_flag;
-EXTERN tree *avl_tree;
-EXTERN void init_tfm_map(void);
-EXTERN void free_tfm_map(void);
EXTERN void pdf_ship_out(pointer p);
EXTERN void pdf_vlist_out (void);
EXTERN void pdf_hlist_out (void);
HPDF_Doc yandy_pdf;
HPDF_Page yandy_page;
HPDF_Font yandy_font[1024];
-tree *avl_tree = NULL;
-struct tfm_map
-{
- char * tfm_name;
- unsigned int key;
-};
-
-int tfm_cmp(void * a, void * b)
-{
- char * aa = ((struct tfm_map *) (a))->tfm_name;
- char * bb = ((struct tfm_map *) (b))->tfm_name;
-
- return (strcmp(aa, bb)) ;
-}
-
-void tfm_print(void *d)
-{
- struct tfm_map * dd = (struct tfm_map *) d;
-
- if (dd)
- printf("{ %s => %d }\n", dd->tfm_name, dd->key);
-}
-
-void tfm_delete(void *d)
-{
- struct tfm_map *dd = (struct tfm_map *) d;
-
- if (dd)
- {
- free(dd);
- }
-}
-
-void tfm_copy(void *src, void *dst)
-{
- struct tfm_map *s = (struct tfm_map *) src;
- struct tfm_map *d = (struct tfm_map *) dst;
- d->tfm_name = s->tfm_name;
- d->key = s->key;
-}
-
-void init_tfm_map(void)
-{
- avl_tree = init_dictionnary(tfm_cmp, tfm_print, tfm_delete, tfm_copy);
-}
-
-void free_tfm_map(void)
-{
- delete_tree(avl_tree);
-}
-
-int insert_font_index(char * name)
-{
- struct tfm_map nn;
- nn.tfm_name = name;
- nn.key = avl_tree->count + 1;
-
- return insert_elmt(avl_tree, &nn, sizeof(struct tfm_map));
-}
-
-int get_font_index(char * name)
-{
- struct tfm_map nn;
-
- nn.tfm_name = name;
- nn.key = -1;
-
- if (is_present(avl_tree, &nn))
- {
- if (get_data(avl_tree, &nn, sizeof(struct tfm_map)))
- return nn.key;
- else
- return 0;
- }
-
- return 0;
-}
// report error.
void pdf_error(const char * t, const char * p)
{
if (total_pages == 0)
{
- init_tfm_map();
yandy_pdf = HPDF_New (pdf_error_handler, NULL);
HPDF_SetCompressionMode (yandy_pdf, HPDF_COMP_ALL);
yandy_pdf -> pdf_version = HPDF_VER_17;
#endif
#include "hpdf.h"
#include "hpdf_utils.h"
-#include "avl.h"
typedef int integer;
typedef double glue_ratio;
OSDN Git Service
