codequery-0.18.1/000077500000000000000000000000001300045745200136015ustar00rootroot00000000000000codequery-0.18.1/.gitignore000066400000000000000000000005101300045745200155650ustar00rootroot00000000000000# Compiled Object files *.slo *.lo *.o # Compiled Dynamic libraries *.so *.dylib # Compiled Static libraries *.lai *.la *.a # Ignore backups *~ *.bak # Ignore the following directories build/ build32/ build64/ output/ Output/ bin/ html/ # Ignore cscope and ctags files, and our db files cscope.files cscope.out tags *.db codequery-0.18.1/.travis.yml000066400000000000000000000044021300045745200157120ustar00rootroot00000000000000language: cpp compiler: gcc env: global: # The next declaration is the encrypted COVERITY_SCAN_TOKEN, created # via the "travis encrypt" command using the project repo's public key - secure: "ev1xh15/xbYiElXyiC5yEwPiP99Vp9jO7zNjk9AVrH76MZNlHOp90bdDYF7zkgRMKBWORcQubTF8h9iM1EFYXwxWVapuKrFlISQKHuErOo+hjKFzMvJcdYhBd2BZCbkQmowv1U860QlZGx+oW6hhG1sJmWfzm/AANQuc6/+qozI=" before_install: - uname -a - export DEBIAN_FRONTEND=noninteractive - sudo add-apt-repository "deb http://archive.ubuntu.com/ubuntu trusty universe" - sudo add-apt-repository "deb http://archive.ubuntu.com/ubuntu trusty main" - sudo apt-get update -qq - sudo DEBIAN_FRONTEND=noninteractive apt-get -y -o Dpkg::Options::="--force-confdef" -o Dpkg::Options::="--force-confnew" install -qq qdbus qmlscene qt5-default qt5-qmake qtbase5-dev-tools qtchooser qtdeclarative5-dev xbitmaps xterm libqt5svg5-dev qttools5-dev qtscript5-dev qtdeclarative5-folderlistmodel-plugin qtdeclarative5-controls-plugin qttools5-dev-tools - sudo DEBIAN_FRONTEND=noninteractive apt-get -y -o Dpkg::Options::="--force-confdef" -o Dpkg::Options::="--force-confnew" install -qq cmake sqlite3 libsqlite3-dev cscope exuberant-ctags rpm libqt5scintilla2-dev qt4-dev-tools libqscintilla2-dev script: - mkdir -p build - cd build - rm -rf * - cmake -G "Unix Makefiles" .. - make package - sudo make install - cqmakedb -v - cd .. - cscope -cbR - ctags --fields=+i -nR - cqmakedb -s cq.db -c cscope.out -t tags -p -d - cqsearch -s cq.db -p 1 -t CODEQUERY_SW_VERSION -u - cd build - rm -rf * - cmake -G "Unix Makefiles" -DBUILD_QT5=ON .. - make package - sudo make install - cqmakedb -v - cd .. - rm cscope.out - rm tags - rm cq.db - cscope -cbR - ctags --fields=+i -nR - cqmakedb -s cq.db -c cscope.out -t tags -p -d - cqsearch -s cq.db -p 1 -t CODEQUERY_SW_VERSION -u addons: coverity_scan: project: name: "ruben2020/codequery" description: "Build submitted via Travis CI" notification_email: ruben2020-git@users.sourceforge.net build_command_prepend: "mkdir -p build; cd build; rm -rf *; cmake .." build_command: "make" branch_pattern: coverity_scan notifications: email: - ruben2020-git@users.sourceforge.net on_success: change on_failure: always codequery-0.18.1/CMakeLists.txt000066400000000000000000000041531300045745200163440ustar00rootroot00000000000000cmake_minimum_required(VERSION 2.8.12) project(CodeQuery) option(BUILD_QT5 OFF) IF(MSVC) ADD_DEFINITIONS(/D _CRT_SECURE_NO_WARNINGS) ELSE(MSVC) SET( CMAKE_CXX_FLAGS "-O2 -Wno-unused-result" ) SET( CMAKE_CXX_FLAGS_DEBUG "-O2 -Wno-unused-result" ) SET( CMAKE_CXX_FLAGS_RELEASE "-O2 -Wno-unused-result" ) ENDIF(MSVC) set(CMAKE_MODULE_PATH ${CMAKE_MODULE_PATH} "${CMAKE_SOURCE_DIR}/cmakefind/") set( EXECUTABLE_OUTPUT_PATH ${PROJECT_BINARY_DIR} ) #INCLUDE_DIRECTORIES( "../makedb" ) #set( OPTLISTLIB_SRCS makedb/optlist.cpp ) #add_library( optlist_lib STATIC ${OPTLISTLIB_SRCS} ) add_subdirectory( "querylib" ) add_subdirectory( "makedb" ) add_subdirectory( "cli" ) add_subdirectory( "showgraph" ) add_subdirectory( "gui" ) if (UNIX) if( CMAKE_SIZEOF_VOID_P EQUAL 8 ) set( CPACK_DEBIAN_PACKAGE_ARCHITECTURE "amd64" ) set( CPACK_RPM_PACKAGE_ARCHITECTURE "x86_64" ) else( CMAKE_SIZEOF_VOID_P EQUAL 8 ) set( CPACK_DEBIAN_PACKAGE_ARCHITECTURE "i386" ) set( CPACK_RPM_PACKAGE_ARCHITECTURE "i686" ) endif( CMAKE_SIZEOF_VOID_P EQUAL 8 ) set( CPACK_GENERATOR "DEB;RPM;TGZ") set( CPACK_PACKAGE_NAME "codequery" ) set( CPACK_PACKAGE_VERSION "0.18.0" ) set( CPACK_PACKAGE_FILE_NAME "${CPACK_PACKAGE_NAME}-${CPACK_PACKAGE_VERSION}-Linux-${CPACK_DEBIAN_PACKAGE_ARCHITECTURE}" ) set( CPACK_DEBIAN_PACKAGE_DEPENDS "libqtgui4 (>= 4.8.0) , libqt4-xml (>= 4.8.0) , libsqlite3-0 (>= 3.7.0) , libqscintilla2-9 (>= 2.6.0) , cscope , exuberant-ctags") set( CPACK_PACKAGE_DESCRIPTION_SUMMARY "Code understanding and searching tool") set( CPACK_PACKAGE_DESCRIPTION "Code understanding and searching tool") set( CPACK_DEBIAN_PACKAGE_SECTION "devel" ) set( CPACK_DEBIAN_PACKAGE_MAINTAINER "ruben2020 ruben2020-git@users.sourceforge.net") set( CPACK_RPM_PACKAGE_LICENSE "GPLv2+") set( CPACK_RPM_PACKAGE_GROUP "Development/Tools") set( CPACK_PACKAGE_VENDOR "ruben2020") set( CPACK_RPM_PACKAGE_REQUIRES "ruben2020 ruben2020-git@users.sourceforge.net") set( CPACK_DEBIAN_PACKAGE_HOMEPAGE "http://ruben2020.github.io/codequery/") set( CPACK_RPM_PACKAGE_REQUIRES "qt >= 4.8,sqlite >= 3.7,qscintilla >= 2.6,cscope,ctags") include(CPack) endif(UNIX) codequery-0.18.1/Doxyfile000066400000000000000000002343001300045745200153110ustar00rootroot00000000000000# Doxyfile 1.8.3.1 # 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 = "CodeQuery" # 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 = "0.09" # 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 = "A code-understanding, code-browsing or code-search tool. This is a tool to index, then query or search C, C++, Java and Python source code." # 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 = "doc/logotitle_small.png" # 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 = "build/doxy" # 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 = # 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 = NO # 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 = NO # 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 = YES # 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 = NO # 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 section-label ... \endif # and \cond section-label ... \endcond blocks. 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 , where is the value of # the FILE_VERSION_FILTER tag, and 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. Do not use # file names with spaces, bibtex cannot handle them. 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 = NO # 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 = # 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 = NO # 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 = # 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 , where # is the value of the INPUT_FILTER tag, and 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 = # If the USE_MD_FILE_AS_MAINPAGE tag refers to the name of a markdown file that # is part of the input, its contents will be placed on the main page (index.html). # This can be useful if you have a project on for instance GitHub and want reuse # the introduction page also for the doxygen output. USE_MDFILE_AS_MAINPAGE = #--------------------------------------------------------------------------- # 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 = NO # Setting the INLINE_SOURCES tag to YES will include the body # of functions and classes directly in the documentation. INLINE_SOURCES = NO # 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 = YES # 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 = YES # 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 = 100 # 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 = 80 # 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 # # Qt Help Project / Custom Filters. QHP_CUST_FILTER_ATTRS = # The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this # project's # filter section matches. # # Qt Help Project / Filter Attributes. 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 = NO # 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 can set the default output format to be used for # thA MathJax output. Supported types are HTML-CSS, NativeMML (i.e. MathML) and # SVG. The default value is HTML-CSS, which is slower, but has the best # compatibility. MATHJAX_FORMAT = HTML-CSS # 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 web server instead of a web client using Javascript. # There are two flavours of web server based search depending on the # EXTERNAL_SEARCH setting. When disabled, doxygen will generate a PHP script for # searching and an index file used by the script. When EXTERNAL_SEARCH is # enabled the indexing and searching needs to be provided by external tools. # See the manual for details. SERVER_BASED_SEARCH = NO # When EXTERNAL_SEARCH is enabled doxygen will no longer generate the PHP # script for searching. Instead the search results are written to an XML file # which needs to be processed by an external indexer. Doxygen will invoke an # external search engine pointed to by the SEARCHENGINE_URL option to obtain # the search results. Doxygen ships with an example indexer (doxyindexer) and # search engine (doxysearch.cgi) which are based on the open source search engine # library Xapian. See the manual for configuration details. EXTERNAL_SEARCH = NO # The SEARCHENGINE_URL should point to a search engine hosted by a web server # which will returned the search results when EXTERNAL_SEARCH is enabled. # Doxygen ships with an example search engine (doxysearch) which is based on # the open source search engine library Xapian. See the manual for configuration # details. SEARCHENGINE_URL = # When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed # search data is written to a file for indexing by an external tool. With the # SEARCHDATA_FILE tag the name of this file can be specified. SEARCHDATA_FILE = searchdata.xml # When SERVER_BASED_SEARCH AND EXTERNAL_SEARCH are both enabled the # EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is # useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple # projects and redirect the results back to the right project. EXTERNAL_SEARCH_ID = # The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen # projects other than the one defined by this configuration file, but that are # all added to the same external search index. Each project needs to have a # unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id # of to a relative location where the documentation can be found. # The format is: EXTRA_SEARCH_MAPPINGS = id1=loc1 id2=loc2 ... EXTRA_SEARCH_MAPPINGS = #--------------------------------------------------------------------------- # 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 = YES # 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 codequery-0.18.1/LICENSE.md000066400000000000000000000427461300045745200152220ustar00rootroot00000000000000### GNU GENERAL PUBLIC LICENSE Version 2, June 1991 Copyright (C) 1989, 1991 Free Software Foundation, Inc. 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. ### Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This General Public License applies to most of the Free Software Foundation's software and to any other program whose authors commit to using it. (Some other Free Software Foundation software is covered by the GNU Lesser General Public License instead.) You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs; and that you know you can do these things. To protect your rights, we need to make restrictions that forbid anyone to deny you these rights or to ask you to surrender the rights. These restrictions translate to certain responsibilities for you if you distribute copies of the software, or if you modify it. For example, if you distribute copies of such a program, whether gratis or for a fee, you must give the recipients all the rights that you have. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. We protect your rights with two steps: (1) copyright the software, and (2) offer you this license which gives you legal permission to copy, distribute and/or modify the software. Also, for each author's protection and ours, we want to make certain that everyone understands that there is no warranty for this free software. If the software is modified by someone else and passed on, we want its recipients to know that what they have is not the original, so that any problems introduced by others will not reflect on the original authors' reputations. Finally, any free program is threatened constantly by software patents. We wish to avoid the danger that redistributors of a free program will individually obtain patent licenses, in effect making the program proprietary. To prevent this, we have made it clear that any patent must be licensed for everyone's free use or not licensed at all. The precise terms and conditions for copying, distribution and modification follow. ### TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION **0.** This License applies to any program or other work which contains a notice placed by the copyright holder saying it may be distributed under the terms of this General Public License. The "Program", below, refers to any such program or work, and a "work based on the Program" means either the Program or any derivative work under copyright law: that is to say, a work containing the Program or a portion of it, either verbatim or with modifications and/or translated into another language. (Hereinafter, translation is included without limitation in the term "modification".) Each licensee is addressed as "you". Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running the Program is not restricted, and the output from the Program is covered only if its contents constitute a work based on the Program (independent of having been made by running the Program). Whether that is true depends on what the Program does. **1.** You may copy and distribute verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and give any other recipients of the Program a copy of this License along with the Program. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. **2.** You may modify your copy or copies of the Program or any portion of it, thus forming a work based on the Program, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: **a)** You must cause the modified files to carry prominent notices stating that you changed the files and the date of any change. **b)** You must cause any work that you distribute or publish, that in whole or in part contains or is derived from the Program or any part thereof, to be licensed as a whole at no charge to all third parties under the terms of this License. **c)** If the modified program normally reads commands interactively when run, you must cause it, when started running for such interactive use in the most ordinary way, to print or display an announcement including an appropriate copyright notice and a notice that there is no warranty (or else, saying that you provide a warranty) and that users may redistribute the program under these conditions, and telling the user how to view a copy of this License. (Exception: if the Program itself is interactive but does not normally print such an announcement, your work based on the Program is not required to print an announcement.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Program, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Program, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Program. In addition, mere aggregation of another work not based on the Program with the Program (or with a work based on the Program) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. **3.** You may copy and distribute the Program (or a work based on it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you also do one of the following: **a)** Accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, **b)** Accompany it with a written offer, valid for at least three years, to give any third party, for a charge no more than your cost of physically performing source distribution, a complete machine-readable copy of the corresponding source code, to be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, **c)** Accompany it with the information you received as to the offer to distribute corresponding source code. (This alternative is allowed only for noncommercial distribution and only if you received the program in object code or executable form with such an offer, in accord with Subsection b above.) The source code for a work means the preferred form of the work for making modifications to it. For an executable work, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the executable. However, as a special exception, the source code distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. If distribution of executable or object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place counts as distribution of the source code, even though third parties are not compelled to copy the source along with the object code. **4.** You may not copy, modify, sublicense, or distribute the Program except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense or distribute the Program is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. **5.** You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Program or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Program (or any work based on the Program), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Program or works based on it. **6.** Each time you redistribute the Program (or any work based on the Program), the recipient automatically receives a license from the original licensor to copy, distribute or modify the Program subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties to this License. **7.** If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Program at all. For example, if a patent license would not permit royalty-free redistribution of the Program by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Program. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system, which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. **8.** If the distribution and/or use of the Program is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Program under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. **9.** The Free Software Foundation may publish revised and/or new versions of the General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of this License, you may choose any version ever published by the Free Software Foundation. **10.** If you wish to incorporate parts of the Program into other free programs whose distribution conditions are different, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. **NO WARRANTY** **11.** BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. **12.** IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. ### END OF TERMS AND CONDITIONS ### How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. one line to give the program's name and an idea of what it does. Copyright (C) yyyy name of author This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. Also add information on how to contact you by electronic and paper mail. If the program is interactive, make it output a short notice like this when it starts in an interactive mode: Gnomovision version 69, Copyright (C) year name of author Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands \`show w' and \`show c' should show the appropriate parts of the General Public License. Of course, the commands you use may be called something other than \`show w' and \`show c'; they could even be mouse-clicks or menu items--whatever suits your program. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the program, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision' (which makes passes at compilers) written by James Hacker. signature of Ty Coon, 1 April 1989 Ty Coon, President of Vice This General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the [GNU Lesser General Public License](http://www.gnu.org/licenses/lgpl.html) instead of this License. codequery-0.18.1/NEWS.txt000066400000000000000000000064261300045745200151260ustar00rootroot00000000000000 Version 0.18.0 - Oct 9, 2016 Migrated from GPLv3 to GPLv2 because some companies ban GPLv3 software List of functions in the file viewer area is a major new feature Now the selection of one or two levels has been added for function call graphs Replaced Dipperstein's optlist with Sittler's getopt replacement (MIT licensed), to avoid LGPLv3 Updated showgraph (now BSD licensed), with rebase from the git repo Various bug fixes for the file viewer Version 0.17.0 - Sept 25, 2016 Now Javascript is officially supported through starscope The full file path option is added to the command-line version of the tool for vim support HOWTO documentation updated for compatibility with Mac OS CodeQuery now officially built using Qt5 for Mac OS, but still in Qt4 for Windows and Linux Travis script updated to include Coverity scanning Version 0.16.0 - May 2, 2015 Brace matching on the file viewer Better handling for current line highlight Annotation in file viewer to quickly and easily identify the selected item Changed version to the semantic versioning scheme MAJOR.MINOR.PATCH Qt4 (default) and Qt5 now supported by CMake build option Version 0.15 - Aug 12, 2014 Added support for Mac OS Allowed -q in cscope.out header Added info to HOWTOs on how to exclude standard include paths Version 0.14 - Mar 9, 2014 Fixed Java and Ruby syntax highlight bug Fixed bug where database file combobox becomes too large due to very long filename Version 0.13 - Mar 1, 2014 Grep feature added Last search history stored persistently Version 0.12 - Feb 23, 2014 QScintilla used for code editing widget Imported a number of syntax highlight themes from Notepad++ Ruby and Go now officially supported through starscope RPM packages will now be generated also Version 0.11 - Dec 31, 2013 File path filter New query type: Calls of this function Search results traversing within same file Improvements on graph's initial size and zoom Bug fix on external editor settings text Version 0.10 - Aug 10, 2013 ctags file processing optimization New GUI features: Header files only, Functions inside this file, new About box New GUI features: Ability to change file viewer font and tab space width Autocomplete made asynchronous and optimized Version 0.09 - Apr 20, 2013 Fixed some cscope.out parser and SQL handling bugs Added font resize buttons for file viewer Version 0.08 - Apr 14, 2013 Fixed Windows app icon and taskbar bugs Version 0.07 - Apr 13, 2013 Added ability to parse cscope.out generated by pycscope (for Python support) Added syntax highlighting for Python and Java File path can now be selected and copied in the GUI tool Version 0.06 - Feb 27, 2013 Fixed syntax highlight bug, added user warning if CQ database is older than viewed source file, removed the extra console window appearing alongside the GUI app in Windows Version 0.05 - Feb 25, 2013 Fixed file path bug in Windows and initial version of cqsearch CLI tool Version 0.04 - Feb 24, 2013 Initial version of visualization for function call graph and class inheritance is now working. Version 0.03 - Feb 22, 2013 Added wildcard search * and ?. Added previous and next history browsing for search. Version 0.02 - Feb 19, 2013 Fixed external editor file path recognition bug for Windows (could not recognize spaces e.g. C:\Program Files). Version 0.01 - Feb 18, 2013 Initial release codequery-0.18.1/README.md000066400000000000000000000233561300045745200150710ustar00rootroot00000000000000![CodeQuery](doc/logotitle.png) =============================== This is a tool to index, then query or search C, C++, Java, Python, Ruby, Go and Javascript source code. It builds upon the databases of [cscope](http://cscope.sourceforge.net/) and [Exuberant ctags](http://ctags.sourceforge.net/). The databases of *cscope* and *ctags* would be processed by the *cqmakedb* tool to generate the CodeQuery database file. The CodeQuery database file can be viewed and queried using the *codequery* GUI tool. [![Build Status](https://api.travis-ci.org/ruben2020/codequery.svg)](https://travis-ci.org/ruben2020/codequery) [![Coverity Status](https://scan.coverity.com/projects/10066/badge.svg)](https://scan.coverity.com/projects/ruben2020-codequery) ## Latest version = 0.18.0 Windows and Linux binaries available here for download: [CodeQuery@sourceforge downloads](https://sourceforge.net/projects/codequery/files/) To build on Linux, please read the [INSTALL-LINUX](doc/INSTALL-LINUX.md) file. On Mac, the software can be installed through [Brew](http://brew.sh/) using `brew install codequery`. Please read [NEWS](NEWS.txt) to find out more. ## How is it different from cscope and ctags? What are the advantages? Both cscope and ctags can do symbol lookup and identify functions, macros, classes and structs. cscope is very C-centric, but is fuzzy enough to cover C++ and Java, but not very well for e.g. it doesn't understand destructors and class member instantiations. It can't provide relationships of class inheritance and membership. cscope can do "functions that call this function" and "functions called by this function". This is a very powerful feature that makes cscope stand out among comparable tools. ctags does many languages well and understands destructors, member instantiations, and the relationships of class membership and inheritance. From ctags, we can find out "members and methods of this class", "class which owns this member or method", "parent of this class", "child of this class" etc. However, it doesn't do "functions that call this function" or "functions called by this function". So both these tools have their pros and cons, but complement each other. CodeQuery is a project that attempts to combine the features available from both cscope and ctags, provide faster database access compared to cscope (because it uses sqlite) and provides a nice GUI tool as well. Due to this faster database access, fast auto-completion of search terms and multiple complex queries to perform visualization is possible. In addition, [pycscope](https://github.com/portante/pycscope) is used to add support for Python, in place of cscope. In addition, [starscope](https://github.com/eapache/starscope) is used to add support for Ruby, Go and Javascript, in place of cscope. ## What features does CodeQuery have? * Combines the best of both cscope and ctags * Faster due to the use of sqlite for the CodeQuery database * Cross-platform GUI tool * Fast auto-completion of search term * Case-insensitive, partial keyword search - wildcard search supported * and ? * Exact match search * Filter search results by file path * File viewer with syntax highlighting * Ability to open viewed file in an external editor or IDE * Visualization of function call graph and class inheritance based on search term * Visualization graphs can be saved to PNG or Graphviz DOT files ## What types of query can I make? * Symbol * Function or macro definition * Class or struct * Functions calling this function * Functions called by this function * Calls of this function or macro * Class which owns this member or method * Members and methods of this class * Parent of this class (inheritance) * Children of this class (inheritance) * Files including this file * Full path for file * Functions and macros inside this file * Grep ## What does it look like? ![CodeQuery screenshot](doc/screenshot.png) ## How does the visualization look like? Here's a function call graph based on the search term of "updateFilePathLabel". A -> B means A calls B: ![Visualization screenshot](doc/screenshot2.png) ## Are other editors like vim or emacs supported? Yes! There is a vim plugin for CodeQuery called [vim-codequery](https://github.com/devjoe/vim-codequery) by [devjoe](https://github.com/devjoe). We welcome contributors to develop plugins for other editors too. ## What does it cost? How is it licensed? It's freeware and free open source software. This software is licensed under the [GNU GPL v2](https://www.gnu.org/licenses/old-licenses/gpl-2.0.html). See [LICENSE.md](LICENSE.md) or [LICENSE.txt](windows-install/LICENSE.txt). Files under the `querylib` directory are licensed under the [MIT license](http://opensource.org/licenses/MIT). See [QueryLib README](querylib/README.txt). This is a library to query CodeQuery database files. This library is MIT-licensed, so that it may be used to create plugins for editors, IDEs and other software without license restrictions. It's only dependency is on sqlite3. ## Can I use it in a commercial environment without purchasing, for an unlimited time? Yes. However, donations are welcomed. ## Which platforms are supported? It has been tested on Windows 7 64-bit, Windows XP 32-bit, Mac OS X, Ubuntu and Fedora Linux 64-bit and, Ubuntu and Fedora Linux 32-bit. Contributions are welcomed to attempt ports to other operating systems. ## Is the software available in other languages? Yes. This applies only to the GUI tool. Contributions are welcomed to update or provide new translations. ## How to install it? On Windows, EXE setup packages will be provided here: [CodeQuery@sourceforge downloads](https://sourceforge.net/projects/codequery/files/). The EXE setup package shall also contain cscope.exe, ctags.exe and the required DLLs. So, everything you need is in one package. However, [pycscope](https://github.com/portante/pycscope) (optional - only for Python) and [starscope](https://github.com/eapache/starscope) (optional - only for Ruby, Go and Javascript) are not bundled together with this setup package and need to be installed separately. On Linux, tar.gz, RPM and Debian package installations will be provided here: [CodeQuery@sourceforge downloads](https://sourceforge.net/projects/codequery/files/). On Mac, the software can be installed through [Brew](http://brew.sh/) using `brew install codequery`. To build on Linux and Mac, please read the [INSTALL-LINUX](doc/INSTALL-LINUX.md) file. Version 15.8a of [cscope](http://cscope.sourceforge.net/) or higher, works best with CodeQuery. ## How do I use it? On Windows: [HOWTO-WINDOWS](windows-install/HOWTO-WINDOWS.txt). This file is included in the EXE setup package. On Linux and Mac: [HOWTO-LINUX](doc/HOWTO-LINUX.md) Please read the HOWTO file provided for each platform. The workflow looks like this: ![CodeQuery workflow](doc/workflow.png) ## How do I generate whole-program call graphs or UML class diagrams? CodeQuery cannot do this at the moment. To generate whole-program call graphs, please use [GNU cflow](https://www.gnu.org/software/cflow/) or [CodeViz](https://github.com/petersenna/codeviz) for C and C++. For Java, there is [Javashot](http://code.google.com/p/javashot/). To generate whole-program UML class diagrams for various object-oriented languages, please use [tags2uml](https://github.com/ruben2020/tags2uml). ## Are there any known limitations? For C and C++, [inline assembly code](http://en.wikipedia.org/wiki/Inline_assembler) is not supported by all the tools. This mainly affects embedded software, OS and driver code. Please exclude files with inline assembly code from the list of files (cscope.files) to be scanned. ## How do I contact the authors for support, issues, bug reports, fix patches, feature requests etc.? Please see the email address below, and also the Issues tab in GitHub. Email address: ![Contact address](doc/emailaddr.png) Website: [CodeQuery website](https://github.com/ruben2020/codequery) ## How can I contribute? * Report bugs * Provide feedback, new ideas, suggestions etc. What would you like to see? * Tell your friends, propose it on StackOverflow, write about it, tweet it * Fix bugs (see Issues tab) * Update translations (Deutsch, Francais, Japanese etc.) * Port to other platforms * Write plugins for emacs, eclipse, Notepad++ etc. * Write a web-based interface to CodeQuery's database * Add support for other languages e.g. Javascript ## List of Contributors [ruben2020](https://github.com/ruben2020) [naseer](https://github.com/naseer) [bruno-](https://github.com/bruno-) [devjoe](https://github.com/devjoe) [jonashaag](https://github.com/jonashaag) [ilovezfs](https://github.com/ilovezfs) [JCount](https://github.com/JCount) (More welcomed) ## Credits We thank the people behind the following projects: [cscope](http://cscope.sourceforge.net/) - our database is derived from this [Exuberant ctags](http://ctags.sourceforge.net/)- our database is derived from this [pycscope](https://github.com/portante/pycscope) - our database (for Python) is derived from this [starscope](https://github.com/eapache/starscope) - our database (for Ruby, Go and Javascript) is derived from this [sqlite3](http://www.sqlite.org/) - our database is using this format [CMake](http://www.cmake.org/) - cross-platform build toolchain for CodeQuery [Qt open source](http://qt-project.org/) - GUI toolkit used to build CodeQuery [showgraph](http://code.google.com/p/showgraph/) - visualization done using this library [scintilla](http://www.scintilla.org/) - our code editing widget (in the form of QScintilla) [vim-codequery](https://github.com/devjoe/vim-codequery) - vim plugin for CodeQuery [Axialis](http://www.axialis.com/iconworkshop) - free images for CodeQuery and this website [brew](http://brew.sh/) - binaries for Mac here codequery-0.18.1/cli/000077500000000000000000000000001300045745200143505ustar00rootroot00000000000000codequery-0.18.1/cli/CMakeLists.txt000066400000000000000000000007441300045745200171150ustar00rootroot00000000000000cmake_minimum_required(VERSION 2.8.12) project(CodeQueryCLI) #add_definitions( -Wall ) find_package(Sqlite REQUIRED) include_directories( "." ) include_directories( "../makedb" ) include_directories( "../querylib" ) include_directories( "${SQLITE_INCLUDE_DIR}" ) set( CQSEARCH_SRCS main_cli.cpp ) add_executable( cqsearch ${CQSEARCH_SRCS} ) target_link_libraries( cqsearch ${SQLITE_LIBRARIES} small_lib sqlquery_lib ) install(TARGETS cqsearch RUNTIME DESTINATION bin) codequery-0.18.1/cli/README.md000066400000000000000000000003221300045745200156240ustar00rootroot00000000000000CodeQuery command line interface ================================ This provides the command line interface (CLI) for CodeQuery's query interface. Type the following to get help: ```bash cqsearch -h ``` codequery-0.18.1/cli/main_cli.cpp000066400000000000000000000155351300045745200166400ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ #include #include #include #include "small_lib.h" #include "getopt2.h" #include "sqlquery.h" #include "swver.h" void printhelp(const char* str) { printf("Usage: %s [-s [-p ] [-t ] -[e|f] ] [-u] [-d] [-v] [-h]\n\n", str); printf("options:\n"); printf(" -s : CodeQuery sqlite3 db file path\n"); printf(" -p : parameter is a number denoted by n\n"); printf(" default n = 1 (Symbol)\n"); printf(" -t : search term without spaces\n"); printf(" if Exact Match is switched off, wild card\n"); printf(" searches are possible. Use * and ?\n"); printf(" -e : Exact Match switched ON \n"); printf(" Case-sensitive\n"); printf(" -f : Exact Match switched OFF (fuzzy search)\n"); printf(" Case-insensitive with wild card search (default)\n"); printf(" -u : show full file path instead of file name\n"); printf(" -d : debug\n"); printf(" -v : version\n"); printf(" -h : help\n\n"); printf("The combinations possible are -s -t -e, -s -t -f -u\n"); printf("The additional optional arguments are -d\n\n"); printf("The possible values for n are:\n"); printf(" 1: Symbol (default)\n"); printf(" 2: Function or macro definition\n"); printf(" 3: Class or struct\n"); printf(" 4: Files including this file\n"); printf(" 5: Full file path\n"); printf(" 6: Functions calling this function\n"); printf(" 7: Functions called by this function\n"); printf(" 8: Calls of this function or macro\n"); printf(" 9: Members and methods of this class\n"); printf(" 10: Class which owns this member or method\n"); printf(" 11: Children of this class (inheritance)\n"); printf(" 12: Parent of this class (inheritance)\n"); printf(" 13: Functions or macros inside this file\n\n"); printf("Example:\n%s -s myproject.db -p 6 -t read*file -f\n\n", str); } void printlicense(void) { printf(CODEQUERY_SW_VERSION); printf("\n"); printf(CODEQUERY_SW_LICENSE); } bool fileexists(const char* fn) { bool retval; FILE *fp; fp = fopen(fn, "r"); retval = (fp != NULL); if (retval) fclose(fp); return retval; } void process_argwithopt(char* thisOpt, int option, bool& err, tStr& fnstr, bool filemustexist) { if (thisOpt != NULL) { fnstr = thisOpt; if (filemustexist && (fileexists(fnstr.c_str()) == false)) { printf("Error: File %s doesn't exist.\n", fnstr.c_str()); err = true; } } else { printf("Error: -%c used without file option.\n", option); err = true; } } int process_query(tStr sqfn, tStr term, tStr param, bool exact, bool full, bool debug) { if ((sqfn.empty())||(term.empty())||(param.empty())) return 1; int retVal = 0; sqlquery sq; sqlquery::en_filereadstatus filestatus = sq.open_dbfile(sqfn); switch (filestatus) { case sqlquery::sqlfileOK: break; case sqlquery::sqlfileOPENERROR: printf("Error: File %s open error!\n", sqfn.c_str()); return 1; case sqlquery::sqlfileNOTCORRECTDB: printf("Error: File %s does not have correct database format!\n", sqfn.c_str()); return 1; case sqlquery::sqlfileINCORRECTVER: printf("Error: File %s has an unsupported database version number!\n", sqfn.c_str()); return 1; case sqlquery::sqlfileUNKNOWNERROR: printf("Error: Unknown Error!\n"); return 1; } int intParam = atoi(param.c_str()) - 1; if ((intParam < 0) || (intParam >= sqlquery::sqlresultAUTOCOMPLETE)) { printf("Error: Parameter is out of range!\n"); return 1; } sqlqueryresultlist resultlst; resultlst = sq.search(term, (sqlquery::en_queryType) intParam, exact); if (resultlst.result_type == sqlqueryresultlist::sqlresultERROR) { printf("Error: SQL Error! %s!\n", resultlst.sqlerrmsg.c_str()); return 1; } for(std::vector::iterator it = resultlst.resultlist.begin(); it != resultlst.resultlist.end(); it++) { switch(resultlst.result_type) { case sqlqueryresultlist::sqlresultFULL: printf("%s\t%s:%s\t%s\n", it->symname.c_str(), (full ? it->filepath.c_str() : it->filename.c_str()), it->linenum.c_str(), it->linetext.c_str()); break; case sqlqueryresultlist::sqlresultFILE_LINE: printf("%s:%s\t%s\n", (full ? it->filepath.c_str() : it->filename.c_str()), it->linenum.c_str(), it->linetext.c_str()); break; case sqlqueryresultlist::sqlresultFILE_ONLY: printf("%s\n", it->filepath.c_str()); break; default: break; } } return retVal; } int main(int argc, char *argv[]) { int c; bool bSqlite, bParam, bTerm, bExact, bFull, bDebug, bVersion, bHelp, bError; int countExact = 0; bSqlite = false; bParam = false; bTerm = false; bExact = false; bFull = false; bDebug = false; bVersion = false; bHelp = (argc <= 1); bError = false; tStr sqfn, param = "1", term; while ((c = getopt2(argc, argv, "s:p:t:efudvh")) != -1) { switch(c) { case 'v': bVersion = true; break; case 'h': bHelp = true; break; case 'e': bExact = true; countExact++; bError = bError || (countExact > 1); if (countExact > 1) printf("Error: either -e or -f but not both!\n"); break; case 'f': bExact = false; countExact++; bError = bError || (countExact > 1); if (countExact > 1) printf("Error: either -e or -f but not both!\n"); break; case 's': bSqlite = true; process_argwithopt(optarg, c, bError, sqfn, true); break; case 'p': bParam = true; param = optarg; break; case 't': bTerm = true; term = optarg; break; case 'u': bFull = true; break; case 'd': bDebug = true; break; case '?': bError = true; break; default: break; } } if (bVersion) { printlicense(); return 0; } if (bHelp || bError) { printhelp(extract_filename(argv[0])); return (bError ? 1 : 0); } if (!bSqlite) { printf("Error: -s is required.\n"); bError = true; } if (!bTerm) { printf("Error: -t is required.\n"); bError = true; } if (bError) { printhelp(extract_filename(argv[0])); return 1; } if (bSqlite && bTerm) { bError = process_query(sqfn, term, param, bExact, bFull, bDebug) > 0; } if (bError) { printhelp(extract_filename(argv[0])); } return bError; } codequery-0.18.1/cmakefind/000077500000000000000000000000001300045745200155225ustar00rootroot00000000000000codequery-0.18.1/cmakefind/FindQScintilla.cmake000066400000000000000000000116001300045745200213660ustar00rootroot00000000000000# QScintilla is a port to Qt of Neil Hodgson's Scintilla C++ editor control # available at http://www.riverbankcomputing.com/software/qscintilla/ # # The module defines the following variables: # QSCINTILLA_FOUND - the system has QScintilla # QSCINTILLA_INCLUDE_DIR - where to find qsciscintilla.h # QSCINTILLA_INCLUDE_DIRS - qscintilla includes # QSCINTILLA_LIBRARY - where to find the QScintilla library # QSCINTILLA_LIBRARIES - aditional libraries # QSCINTILLA_MAJOR_VERSION - major version # QSCINTILLA_MINOR_VERSION - minor version # QSCINTILLA_PATCH_VERSION - patch version # QSCINTILLA_VERSION_STRING - version (ex. 2.6.2) # QSCINTILLA_ROOT_DIR - root dir (ex. /usr/local) #============================================================================= # Copyright 2010-2013, Julien Schueller # All rights reserved. # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are met: # # 1. Redistributions of source code must retain the above copyright notice, this # list of conditions and the following disclaimer. # 2. Redistributions in binary form must reproduce the above copyright notice, # this list of conditions and the following disclaimer in the documentation # and/or other materials provided with the distribution. # # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND # ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED # WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE # DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR # ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES # (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; # LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND # ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT # (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS # SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. # The views and conclusions contained in the software and documentation are those # of the authors and should not be interpreted as representing official policies, # either expressed or implied, of the FreeBSD Project. #============================================================================= find_path ( QSCINTILLA_INCLUDE_DIR NAMES qsciscintilla.h HINTS ${QT_INCLUDE_DIR} PATH_SUFFIXES Qsci ) set ( QSCINTILLA_INCLUDE_DIRS ${QSCINTILLA_INCLUDE_DIR} ) # version set ( _VERSION_FILE ${QSCINTILLA_INCLUDE_DIR}/Qsci/qsciglobal.h ) if ( EXISTS ${_VERSION_FILE} ) file ( STRINGS ${_VERSION_FILE} _VERSION_LINE REGEX "define[ ]+QSCINTILLA_VERSION_STR" ) if ( _VERSION_LINE ) string ( REGEX REPLACE ".*define[ ]+QSCINTILLA_VERSION_STR[ ]+\"(.*)\".*" "\\1" QSCINTILLA_VERSION_STRING "${_VERSION_LINE}" ) string ( REGEX REPLACE "([0-9]+)\\.([0-9]+)\\.([0-9]+)" "\\1" QSCINTILLA_MAJOR_VERSION "${QSCINTILLA_VERSION_STRING}" ) string ( REGEX REPLACE "([0-9]+)\\.([0-9]+)\\.([0-9]+)" "\\2" QSCINTILLA_MINOR_VERSION "${QSCINTILLA_VERSION_STRING}" ) string ( REGEX REPLACE "([0-9]+)\\.([0-9]+)\\.([0-9]+)" "\\3" QSCINTILLA_PATCH_VERSION "${QSCINTILLA_VERSION_STRING}" ) endif () endif () # check version set ( _QSCINTILLA_VERSION_MATCH TRUE ) if ( QScintilla_FIND_VERSION AND QSCINTILLA_VERSION_STRING ) if ( QScintilla_FIND_VERSION_EXACT ) if ( NOT QScintilla_FIND_VERSION VERSION_EQUAL QSCINTILLA_VERSION_STRING ) set ( _QSCINTILLA_VERSION_MATCH FALSE ) endif () else () if ( QSCINTILLA_VERSION_STRING VERSION_LESS QScintilla_FIND_VERSION ) set ( _QSCINTILLA_VERSION_MATCH FALSE ) endif () endif () endif () find_library ( QSCINTILLA_LIBRARY NAMES qscintilla qscintilla2 libqscintilla2 HINTS ${QT_LIBRARY_DIR} ) set ( QSCINTILLA_LIBRARIES ${QSCINTILLA_LIBRARY} ) # try to guess root dir from include dir if ( QSCINTILLA_INCLUDE_DIR ) string ( REGEX REPLACE "(.*)/include.*" "\\1" QSCINTILLA_ROOT_DIR ${QSCINTILLA_INCLUDE_DIR} ) # try to guess root dir from library dir elseif ( QSCINTILLA_LIBRARY ) string ( REGEX REPLACE "(.*)/lib[/|32|64].*" "\\1" QSCINTILLA_ROOT_DIR ${QSCINTILLA_LIBRARY} ) endif () # handle the QUIETLY and REQUIRED arguments include ( FindPackageHandleStandardArgs ) if ( CMAKE_VERSION VERSION_LESS 2.8.3 ) find_package_handle_standard_args( QScintilla DEFAULT_MSG QSCINTILLA_LIBRARY QSCINTILLA_INCLUDE_DIR _QSCINTILLA_VERSION_MATCH ) else () find_package_handle_standard_args( QScintilla REQUIRED_VARS QSCINTILLA_LIBRARY QSCINTILLA_INCLUDE_DIR _QSCINTILLA_VERSION_MATCH VERSION_VAR QSCINTILLA_VERSION_STRING ) endif () mark_as_advanced ( QSCINTILLA_LIBRARY QSCINTILLA_LIBRARIES QSCINTILLA_INCLUDE_DIR QSCINTILLA_INCLUDE_DIRS QSCINTILLA_MAJOR_VERSION QSCINTILLA_MINOR_VERSION QSCINTILLA_PATCH_VERSION QSCINTILLA_VERSION_STRING QSCINTILLA_ROOT_DIR ) codequery-0.18.1/cmakefind/FindQt5QScintilla.cmake000066400000000000000000000127031300045745200217650ustar00rootroot00000000000000# QScintilla is a port to Qt of Neil Hodgson's Scintilla C++ editor control # available at http://www.riverbankcomputing.com/software/qscintilla/ # # The module defines the following variables: # QT5QSCINTILLA_FOUND - the system has QScintilla # QT5QSCINTILLA_INCLUDE_DIR - where to find qsciscintilla.h # QT5QSCINTILLA_INCLUDE_DIRS - qscintilla includes # QT5QSCINTILLA_LIBRARY - where to find the QScintilla library # QT5QSCINTILLA_LIBRARIES - aditional libraries # QT5QSCINTILLA_MAJOR_VERSION - major version # QT5QSCINTILLA_MINOR_VERSION - minor version # QT5QSCINTILLA_PATCH_VERSION - patch version # QT5QSCINTILLA_VERSION_STRING - version (ex. 2.6.2) # QT5QSCINTILLA_ROOT_DIR - root dir (ex. /usr/local) #============================================================================= # Copyright 2010-2013, Julien Schueller # All rights reserved. # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are met: # # 1. Redistributions of source code must retain the above copyright notice, this # list of conditions and the following disclaimer. # 2. Redistributions in binary form must reproduce the above copyright notice, # this list of conditions and the following disclaimer in the documentation # and/or other materials provided with the distribution. # # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND # ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED # WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE # DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR # ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES # (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; # LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND # ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT # (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS # SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. # The views and conclusions contained in the software and documentation are those # of the authors and should not be interpreted as representing official policies, # either expressed or implied, of the FreeBSD Project. #============================================================================= find_path ( QT5QSCINTILLA_INCLUDE_DIR NAMES qsciscintilla.h HINTS ${Qt5Widgets_INCLUDE_DIRS} PATH_SUFFIXES qt5 Qsci ) set ( QT5QSCINTILLA_INCLUDE_DIRS ${QT5QSCINTILLA_INCLUDE_DIR} ) # version set ( _VERSION_FILE ${QT5QSCINTILLA_INCLUDE_DIR}/Qsci/qsciglobal.h ) if ( EXISTS ${_VERSION_FILE} ) file ( STRINGS ${_VERSION_FILE} _VERSION_LINE REGEX "define[ ]+QT5QSCINTILLA_VERSION_STR" ) if ( _VERSION_LINE ) string ( REGEX REPLACE ".*define[ ]+QT5QSCINTILLA_VERSION_STR[ ]+\"(.*)\".*" "\\1" QT5QSCINTILLA_VERSION_STRING "${_VERSION_LINE}" ) string ( REGEX REPLACE "([0-9]+)\\.([0-9]+)\\.([0-9]+)" "\\1" QT5QSCINTILLA_MAJOR_VERSION "${QT5QSCINTILLA_VERSION_STRING}" ) string ( REGEX REPLACE "([0-9]+)\\.([0-9]+)\\.([0-9]+)" "\\2" QT5QSCINTILLA_MINOR_VERSION "${QT5QSCINTILLA_VERSION_STRING}" ) string ( REGEX REPLACE "([0-9]+)\\.([0-9]+)\\.([0-9]+)" "\\3" QT5QSCINTILLA_PATCH_VERSION "${QT5QSCINTILLA_VERSION_STRING}" ) endif () endif () # check version set ( _QT5QSCINTILLA_VERSION_MATCH TRUE ) if ( QScintilla_FIND_VERSION AND QT5QSCINTILLA_VERSION_STRING ) if ( QScintilla_FIND_VERSION_EXACT ) if ( NOT QScintilla_FIND_VERSION VERSION_EQUAL QT5QSCINTILLA_VERSION_STRING ) set ( _QT5QSCINTILLA_VERSION_MATCH FALSE ) endif () else () if ( QT5QSCINTILLA_VERSION_STRING VERSION_LESS QScintilla_FIND_VERSION ) set ( _QT5QSCINTILLA_VERSION_MATCH FALSE ) endif () endif () endif () find_library ( QT5QSCINTILLA_LIBRARY NAMES qt5scintilla2 qscintilla2-qt5 HINTS ${Qt5Widgets_LIBRARIES} ) set ( QT5QSCINTILLA_LIBRARIES ${QT5QSCINTILLA_LIBRARY} ) IF( QT5QSCINTILLA_LIBRARY AND QT5QSCINTILLA_INCLUDE_DIR ) SET( QT5QSCINTILLA_FOUND TRUE ) ENDIF( QT5QSCINTILLA_LIBRARY AND QT5QSCINTILLA_INCLUDE_DIR ) IF( QT5QSCINTILLA_FOUND ) MESSAGE( STATUS "Found QScintilla-Qt5 header files in ${QT5QSCINTILLA_INCLUDE_DIR}") MESSAGE( STATUS "Found QScintilla-Qt5 libraries: ${QT5QSCINTILLA_LIBRARY}") ENDIF(QT5QSCINTILLA_FOUND) # try to guess root dir from include dir if ( QT5QSCINTILLA_INCLUDE_DIR ) string ( REGEX REPLACE "(.*)/include.*" "\\1" QT5QSCINTILLA_ROOT_DIR ${QT5QSCINTILLA_INCLUDE_DIR} ) # try to guess root dir from library dir elseif ( QT5QSCINTILLA_LIBRARY ) string ( REGEX REPLACE "(.*)/lib[/|32|64].*" "\\1" QT5QSCINTILLA_ROOT_DIR ${QT5QSCINTILLA_LIBRARY} ) endif () # handle the QUIETLY and REQUIRED arguments include ( FindPackageHandleStandardArgs ) if ( CMAKE_VERSION VERSION_LESS 2.8.3 ) find_package_handle_standard_args( QScintilla DEFAULT_MSG QT5QSCINTILLA_LIBRARY QT5QSCINTILLA_INCLUDE_DIR _QT5QSCINTILLA_VERSION_MATCH ) else () find_package_handle_standard_args( QScintilla REQUIRED_VARS QT5QSCINTILLA_LIBRARY QT5QSCINTILLA_INCLUDE_DIR _QT5QSCINTILLA_VERSION_MATCH VERSION_VAR QT5QSCINTILLA_VERSION_STRING ) endif () mark_as_advanced ( QT5QSCINTILLA_LIBRARY QT5QSCINTILLA_LIBRARIES QT5QSCINTILLA_INCLUDE_DIR QT5QSCINTILLA_INCLUDE_DIRS QT5QSCINTILLA_MAJOR_VERSION QT5QSCINTILLA_MINOR_VERSION QT5QSCINTILLA_PATCH_VERSION QT5QSCINTILLA_VERSION_STRING QT5QSCINTILLA_ROOT_DIR ) codequery-0.18.1/cmakefind/FindSqlite.cmake000066400000000000000000000035741300045745200205770ustar00rootroot00000000000000 # # The following license applies only to this file: # # - find Sqlite 3 # SQLITE_INCLUDE_DIR - Where to find Sqlite 3 header files (directory) # SQLITE_LIBRARIES - Sqlite 3 libraries # SQLITE_LIBRARY_RELEASE - Where the release library is # SQLITE_LIBRARY_DEBUG - Where the debug library is # SQLITE_FOUND - Set to TRUE if we found everything (library, includes and executable) # Copyright (c) 2010 Pau Garcia i Quiles, # # Redistribution and use is allowed according to the terms of the BSD license. # For details see the accompanying COPYING-CMAKE-SCRIPTS file. # # Generated by CModuler, a CMake Module Generator - http://gitorious.org/cmoduler IF( SQLITE_INCLUDE_DIR AND SQLITE_LIBRARY_RELEASE ) SET(SQLITE_FIND_QUIETLY TRUE) ENDIF( SQLITE_INCLUDE_DIR AND SQLITE_LIBRARY_RELEASE ) IF ( UNIX ) FIND_PATH( SQLITE_INCLUDE_DIR sqlite3.h ) FIND_LIBRARY(SQLITE_LIBRARY_RELEASE NAMES sqlite3 ) ELSE ( UNIX ) FIND_PATH( SQLITE_INCLUDE_DIR sqlite3.h "/sqlite3/include") FIND_LIBRARY( SQLITE_LIBRARY_RELEASE NAMES sqlite3 ) ENDIF ( UNIX ) IF( SQLITE_LIBRARY_RELEASE AND SQLITE_INCLUDE_DIR ) SET( SQLITE_FOUND TRUE ) ENDIF( SQLITE_LIBRARY_RELEASE AND SQLITE_INCLUDE_DIR ) IF( SQLITE_LIBRARY_RELEASE ) SET( SQLITE_LIBRARIES ${SQLITE_LIBRARY_RELEASE} ) ENDIF( SQLITE_LIBRARY_RELEASE ) IF( SQLITE_FOUND ) IF( NOT SQLITE_FIND_QUIETLY ) MESSAGE( STATUS "Found Sqlite3 header file in ${SQLITE_INCLUDE_DIR}") MESSAGE( STATUS "Found Sqlite3 libraries: ${SQLITE_LIBRARIES}") ENDIF( NOT SQLITE_FIND_QUIETLY ) ELSE(SQLITE_FOUND) IF( SQLITE_FIND_REQUIRED) MESSAGE( FATAL_ERROR "Could not find Sqlite3" ) ELSE( SQLITE_FIND_REQUIRED) MESSAGE( STATUS "Optional package Sqlite3 was not found" ) ENDIF( SQLITE_FIND_REQUIRED) ENDIF(SQLITE_FOUND) codequery-0.18.1/doc/000077500000000000000000000000001300045745200143465ustar00rootroot00000000000000codequery-0.18.1/doc/HOWTO-LINUX.md000066400000000000000000000103661300045745200164730ustar00rootroot00000000000000 HOWTO GUIDE =========== This HOWTO guide applies to Linux only ## HOW TO USE CODEQUERY WITH C/C++ CODE? 1. Change directory to the base folder of your source code like this: ```bash cd ~/projects/myproject/src ``` 2. Create a cscope.files file with all the C/C++ source files listed in it. Files with [inline assembly code](http://en.wikipedia.org/wiki/Inline_assembler) should be excluded from this list. ```bash find . -iname "*.c" > ./cscope.files find . -iname "*.cpp" >> ./cscope.files find . -iname "*.cxx" >> ./cscope.files find . -iname "*.cc " >> ./cscope.files find . -iname "*.h" >> ./cscope.files find . -iname "*.hpp" >> ./cscope.files find . -iname "*.hxx" >> ./cscope.files find . -iname "*.hh " >> ./cscope.files ``` 3. Create a cscope database like this (add `k`, if you don't want standard include paths like for stdio.h): ```bash cscope -cb ``` 4. Create a ctags database like this. ```bash ctags --fields=+i -n -R -L ./cscope.files ``` 5. Run cqmakedb to create a CodeQuery database out of the cscope and ctags databases, like this: ```bash cqmakedb -s ./myproject.db -c ./cscope.out -t ./tags -p ``` 6. Open myproject.db using the CodeQuery GUI tool by running the following. Wild card search (* and ?) supported if Exact Match is switched off. Or use cqsearch, the CLI-version of CodeQuery (type `cqsearch -h` for more info). ```bash codequery ``` Use `cqmakedb -h` to get help on cqmakedb command line arguments. ## HOW TO USE CODEQUERY WITH JAVA CODE? 1. Change directory to the base folder of your source code like this: ```bash cd ~/projects/myproject/src ``` 2. Create a cscope.files file with all the Java source files listed in it. ```bash find . -iname "*.java" > ./cscope.files ``` 3. Create a cscope database like this: ```bash cscope -cbR ``` 4. Create a ctags database like this: ```bash ctags --fields=+i -n -R -L ./cscope.files ``` 5. Run cqmakedb to create a CodeQuery database out of the cscope and ctags databases, like this: ```bash cqmakedb -s ./myproject.db -c ./cscope.out -t ./tags -p ``` 6. Open myproject.db using the CodeQuery GUI tool by running the following. Wild card search (* and ?) supported if Exact Match is switched off. Or use cqsearch, the CLI-version of CodeQuery (type `cqsearch -h` for more info). ```bash codequery ``` Use `cqmakedb -h` to get help on cqmakedb command line arguments. ## HOW TO USE CODEQUERY WITH PYTHON CODE? 1. Change directory to the base folder of your source code like this: ```bash cd ~/projects/myproject/src ``` 2. Create a cscope.files file with all the Python source files listed in it. ```bash find . -iname "*.py" > ./cscope.files ``` 3. Create a cscope database like this: ```bash pycscope -i ./cscope.files ``` 4. Create a ctags database like this. ```bash ctags --fields=+i -n -R -L ./cscope.files ``` 5. Run cqmakedb to create a CodeQuery database out of the cscope and ctags databases, like this: ```bash cqmakedb -s ./myproject.db -c ./cscope.out -t ./tags -p ``` 6. Open myproject.db using the CodeQuery GUI tool by running the following. Wild card search (* and ?) supported if Exact Match is switched off. Or use cqsearch, the CLI-version of CodeQuery (type `cqsearch -h` for more info). ```bash codequery ``` Use `cqmakedb -h` to get help on cqmakedb command line arguments. ## HOW TO USE CODEQUERY WITH RUBY, GO AND JAVASCRIPT CODE? 1. Change directory to the base folder of your source code like this: ```bash cd ~/projects/myproject/src ``` 2. Create a cscope.files file with all the Ruby, Go or Javascript source files listed in it. ```bash find . -iname "*.rb" > ./cscope.files find . -iname "*.go" > ./cscope.files find . -iname "*.js" > ./cscope.files ``` 3. Create a cscope database like this: ```bash starscope -e cscope ``` 4. Create a ctags database like this. ```bash ctags --fields=+i -n -R -L ./cscope.files ``` 5. Run cqmakedb to create a CodeQuery database out of the cscope and ctags databases, like this: ```bash cqmakedb -s ./myproject.db -c ./cscope.out -t ./tags -p ``` 6. Open myproject.db using the CodeQuery GUI tool by running the following. Wild card search (* and ?) supported if Exact Match is switched off. Or use cqsearch, the CLI-version of CodeQuery (type `cqsearch -h` for more info). ```bash codequery ``` Use `cqmakedb -h` to get help on cqmakedb command line arguments. codequery-0.18.1/doc/INSTALL-LINUX.md000066400000000000000000000037241300045745200167010ustar00rootroot00000000000000HOW TO INSTALL CODEQUERY IN LINUX ================================= This INSTALL guide applies to Linux and Mac only (For Windows, a SETUP EXE package will be provided) ## HOW TO INSTALL IN LINUX? 1. Install CMake (>2.7), sqlite3, Qt4 (>4.7), QScintilla (2.6 or higher), cscope (15.8a or higher), ctags. If you have Ubuntu, Linux Mint, Debian or Fedora installed, most of these should be obtainable through the package managers. Note that the cscope version on the Ubuntu repositories may not be the latest one. It's better to have the latest version of cscope installed. [CMake](http://www.cmake.org/) [sqlite3](http://www.sqlite.org/) [Qt4](http://qt-project.org/) [cscope](http://cscope.sourceforge.net/) [ctags](http://ctags.sourceforge.net/) [pycscope](https://github.com/portante/pycscope) [QScintilla](http://www.riverbankcomputing.com/software/qscintilla/intro) In Ubuntu or Linux Mint, do the following: ```bash sudo apt-get install g++ git cmake sqlite3 libsqlite3-dev qt4-dev-tools libqscintilla2-dev cscope exuberant-ctags rpm ``` In Fedora or Red Hat, do the following: ```bash sudo dnf install gcc-c++ git cmake sqlite sqlite-devel qt-devel qscintilla-devel cscope ctags rpm-build ``` 2. Download the repository as a ZIP file from github or clone git repository: [codequery@github](https://github.com/ruben2020/codequery) ```bash git clone https://github.com/ruben2020/codequery.git ``` 3. Unzip to a directory and change to that directory. ```bash cd ~/workspace/codequery ``` 4. Create a directory called build and change to it. ```bash mkdir build cd build ``` 5. Run cmake, make and make install. ```bash cmake -G "Unix Makefiles" .. make sudo make install ``` If you want to install to an alternative directory instead of the default one, use the following: ```bash cmake -DCMAKE_INSTALL_PREFIX="/home/johndoe/tools/" -G "Unix Makefiles" .. make make install ``` 6. Please read [HOWTO-LINUX](HOWTO-LINUX.md) to learn how to use this software. codequery-0.18.1/doc/emailaddr.png000066400000000000000000000137711300045745200170070ustar00rootroot00000000000000‰PNG  IHDRa)䃘bbKGDÿÿÿ ½§“ pHYs  šœtIMEÝ—C% tEXtCommentCreated with GIMPWaIDATxÚí]{pe–?I¼!7/‘g€ ÈË…^>P@—ðXk‹AdÔŠ….¥@T p(j 0¬:8”‚X¥TTT¨aaAØ"f„ !!d!ÑkB¼ ’ßþÝÛÝ÷{uß›äÞàW•JÒó}ßùÎ9ß9¿sº;¬¤Ì"¢]ã©´ügêÑ5žˆˆJË&í¸J3ÞªM›ƒl.Æë´fäïoѵ*ÎP1Ô¢´©yÂ’S™s ¢Çª«?•Û. ÕR²fS(üaÉ©hC g•Zˆ°'Õ–`ÂX8 ´ƒ¹YËÔD%Q"C,ºž¥|¡„ÉñÊüDž˘ÈêY†™šË  mîk~ª›1KGUBg‘nˆdP´I„šó r¶X‚ñ8KÎdÑÙ)s‘e ƒµ¤'Õ<¾ÈÊ…‘mníÙiÕŠ§™iÕr£–¬ rÚ‡¨ÔŒwJéÞoÕ:êkÃâ¯u#ÑM<âvêde5ž-YÀ¼ÿí–1‰è¨”…ªøkdU6}•:bz¢õnIyµS³o§ÞWdtí8#vô+ÔËÑìlü*×’ªÂÈ èUäh !V»j¼ÌSÄXCÉ2ÚP1"ªN]ys4—\Û}@ȉuòàl3 æ‡_ìòQU^íΓœÊó<^Õ½¥™mÇ;w¢hªÆ4ȳ0; ©eažåæ=Ì 3@-)Ǫ±¿@ÕÚqÂé 7Ïl väÄ.lF*Ö\­% …?c«`ã¢ÐÎŽ`;ÁáB š=6l'pê:U²`ÚÌT‰m4²Çšá˜ÙîšsSÍe©>ÍêOÄ¥õCv –]aáÝGD0æ›r‘T Pޯݰ°%<+ïƒ): 4œBNSM%Ãv€™˜ƒ^½zÁår¡K×$Lxl2Ž?΢óEX¾|9RRR‰””,_¾õõõ¦~òóó‘‘‘^½z!22Ý»wGzz:Ž?Î\<¯×‹/¿ŠîÝ“ï\ŸŒåË—ãBq¥rXlWX¼W]ââbÌi!† †öíÛ£M›6èÞ½;&NœˆÏz7nÜht¢š4öWínšÍ©¨ÂN ŸÌ*)ó`É’%º|h?NáŠæp>œÒ@È ‹?ÊFXV`“‚ÑMh„U®µ •öŽw7}àÇÇ'>ɼ~úôéf|G‘®Ö¦M›Æ¥Ûœ!œl=nÞ¼‰… ÂårqçHDHJJÂW_}¥dÌTñÙ¦0xþà–Mf«êœ¿Ø«jÞ¢W¯^ "|þùç&çÀmYF Œ°Ý¤¶JoÇ“7aÕ¹’êdx›¢‰YwŒæðG…ììläÿ^¯_çÁ¨Q£@DèׯŸéÚ={ö€ˆ‡½{÷â—_~ÁÞ½{"Bnn®~íÐa#ÒÒRx½^œ>‰‰‰ÈÌÌDcc£P¸‹ŠŠtCc<>kÖ,2_[nºÕªU "<ýôÓÂE7Ò56îªU«LÇ3_[Υ˂ÂÂB<ù䓈‰‰Abb"^xáܸqC zàyµZ›7oˆ:uÂç_î ÷–-[—Ë…Ó§OKóFYÐæUWW‡¥K—"55ÑÑшÇ#<‚Ý»wseÂår™d‚å6""p®ðªR_ÖyÖÕÕ᥋õûbcãðûÑã°yë'úuõõõÈÊÊBÿûî‡ÛíF›¨( 4kÖ¬ACC“7<ØŽ%ãç ¯bþüùHL¼×¤‡7oÞÄ[o½…¡C‡"&&n·cÇŽÅ®]»¤:õÂÜ—tþ‰"ž’2.W"++ ƒ 2Íïµ%+ÐÐÐ ³f;¬òëvGKåÞüëF®=P¬v"66í™™‰KWª}6•þdz¤l„E;›1Tfu¢b„­ÇXáx·nÝðÓO?1sæLî ÇwŒ3fÌð¹výúõ²§ŠŠ ÜîhÓÜSSSAD(((0Í¡  €é9[›F7&&ÆtœG7wÿQ%ºZ«¬¬D—.]|ækä­S#\PP€ððp¸\.œ8qBÉËXðò« "LöS~dòñÌ3ÏÇtéJµ#™`É­¬/^“Ýçõz1fÌî5ãÇ7b™fm*¬ù£ÞØTuJd„íÌO6æÊÊJtìØII~1%ý_„cÿî‡ËR•Ù íºKWª¥ýi²0#,ò†¸_NNÎœ/cNÌŽNNNÆ¡C‡PSSƒƒ¢G ",^¼°iÓ&Ý0ïر•••¨««ÃÑ£G‘6hÈm53Ó‡îý÷¾y8}¶ " 6LèQfff‚ˆ0âÁQ¦s±±± "œ½Pnº¾¶¶D„¸¸8!ß4ºcÆŒ1õ­Ñ­­­5Ýg¤«‚‡.\¸ðzè¼>D„5kÖùÏÓ)ã|²ÿóSÔÔÔüméÊ;W,Þ~ûm\¾|^¯GEzz:S§Nž.RÒ)c3Îoíº¿1ç÷Ú’>ž§6æ3çËôsº-c={ö”ʯ6öÎ]ºúŒ][û¹óH¡ î!C°ï@ª««u;10íýZ«¬±ú“ñªIŒðÎ;…p…HɬǬ!Ò_|"Bÿþý>ø ˆGŽñéïâÅ‹ "ôíÛ×g ùùùúÿãÝÃåyÁo¿³I‡ ¬}…‡‡ƒˆpëÖ-Óñ[·nˆôЖնoߎ°°0®±Ï°°0&ÝâË×}芰(Í£¶†Ð»vírl„µ¾úôùˆyyyú¹'žxB¿~Ĉ>÷VWWƒˆÅ„d›tϔۉ É“'ã7ÞÀ7ß|câ‘S™Ø¹s§Ïõ}ûöᡇ'è}_¾.­yÕîã1-- D„¿üÇŸ>ßÿ},å¿U§Xó1êÕ Aƒ@Dظq#W&yü+)óøðϺnZ?Úü²³³¹ó»oÀ@Ÿµg­A¯Þ}¤ò«ÍÝ8vë9zÊgíy³ÑNh­¬¬Ì'bÕúû싽>tD²0#ÌS–ªª*¦`²’m²Ýüúõë¦ÉUUU™8::Z\.—ϼ^¯)„á yI™Û·oGDDÂÂÂðá‡úÌÛ걊÷nݺÕÇÈ°”™'7û÷ïGb⽦¹&÷ì…S§NÙ– –ÜÛþýûѱcGÓ½}úôÁ©S§„‰6Ù£¢¢@D¨¬¬äÂSn·[ÙfyqUUU>ct»Ý "TTTpõØ)ÿŒ<Ðdîäé"Þ|[p‘;?«í()ó˜ä×H§àûK>|Q»èÝ,F¾ž/ª0AÖþ¢¢ÜÒþŒ¹žf3Âqâ„~oii)–,]©î>úˆi<ŒYv–|h‰¯œœ,X°]»vaøˆ‘~Ë«+¼Šœœ<ûü\½¯Ñ£GK+S´1>ûü\tìÔÙtŸÕ³s¾FJÓ WaV¨­b„òÏ8ÕM†—´7ŽÛŽ¡:v»‹ñæj‡W";Ó¤FØÈÐ{ï½í\¹rE?———Çôp„‘QѧÏïÆ ù<ì 2FVÆãËÞ¸]݆ 6pa^ƒV1kÖ,sæöÍ7™t­M…®JÉÎ3ó°{÷n©[¡‘_ýÕt¼OŸÛ´Ož<©Ó˜Xó-//×éú+²¦õåV.¿*)óøŒQ ×·mÛæsÿ–-[|"™îˆpb㸠"¦M›¸ãÿTæw߀R¸¥¤Ì£;#›·~b’£üj×L{À4v;oyäÙoíòŠ§GMn„µ6räHfÎú#<¾ûî; 2Dš˜û䳟ÄÜŸæþ`íº¿ˆÐ¡CGlÚ´ ÅÅÅ8Wx^¯çÎÃÆ1räHåWk+W®Ô½ûî»Âyoýà3âãã‘›› ¯×‹ÜÜ\=±gϺaaa>t­Âñõ×_+Ñ•í꯼ò ˆ)))8|ø0jkkqøða¤¤¤({‰‰‰ "ìݻׄmΙ3D„×_]?váÂ<ðÀèÔ©òó󉤤$ü~ô8¬Zµ åååLÁ2t¸P>´9>þøãØ·ojkkQSSƒ 6˜ *MÉ;wî¬ËD]]S&dr;vÜ#¾xÍ8Æ3çËôû´îÕ×ß!!!Û¶mÃÉÓE¨¬¬Dvv¶žÔ3&æXºsÿýƒ„ù–<¬[·N‡ÈV¬\‹+W®Àëõ"//OOÌ‚ZbN›_ee%w~<\Yû1Êï§;÷àì…r|ºsI~­^ûÿäèc?xø>ö@–ß’•K²xų?"=j86oÞìãMœôÏLOG;6uêTa‰Ìùã ŽážÈèYìôôtæuS§NeòHFW›*]^¦·¤Ìƒk×®¡sçÎ>4¦L™Â¬OfE&¬R8pà€žm/,,T*Qãy#2ùñpæÌ™~É„(™Ìê‹e‰äGãù¢ Œ=š{ݸqãL¼«òF¶©444àᇖòD«z±bù§:?•Çy¯]»†:úÐxtÂ$S‚Z»Weíe0Ë&ñ}:áv»‘ššŠ+V ®®Î/™`5•¾Xro½¯Wï>X±bÎ^5ÉLVVúõ€¨¨(´‰ŠBZZV¯^m2À%e466bî¼h—€¸¸8Ìž=›É‘aÑþ.¼ô#Ö®]‹´´4DEE!&&ãÆó©DrÂ?c_Úü´~Ün7úõ€Õ«Wû<Þ,3H‡Ž|‹É“'#::íÛ·ÇÌ?ÌÑå·}ûDߪ£¿Â¤ÉS¸cU—Ø©Y×t@•W,= ˜ö÷ù|^¹¨ŒÄN?v^Eè7œùÛdØ£êËR¬mýúõºWbw}Œ¿üñG½l,66Ë–-Cîþ£8Wxuuu(((À²eËЯ_?ü×ç+ó>Ø^^ïôÝ»|Ç¿=‡UkÞÖßAa|ÈÎ#¦ÚŒòër¹Ð#9‹-2½D%«|EZÅf5w£æ2T¢ï|‰p"» ÈOÍ·´:ùò²]#nçååN_|* “¨DZ}ZÞ.Pð’~•Æ |*:ÏjawBÇ­´üg""êÑ5ž{N;Ϻ¶´ügæ½Æs¼k¬ôŒÿ‹è†j“ñÚzÜÊÞyÎZ++¿­ô¬´eÿËæ kh•c¿œÊº“u 6~ñÆ.’5Ù\XòèT¦DýµhkÊO„›©bÄ*^–ˆ~kÀÔT0b§•ÓpØ®×ÛðL§ëf'­ú5ŠPÊqØÒüÁvC1ú¢ædº,c¬ú¥2Ÿ9 öÐNõ«ÎP•M#ÞÖÔFÔÉ&dçkÇ­Ö †íä‹ÐþèCsµð¦ô²e!C®ñ¦c¬Ð—GÏzÌ‹®eÑV袴ügfÈË ³Ty¦¦YÃk#Oµ±ÇÅoB¥±dË 9XyÎ[#Ïy„  ¶[4nž®ÛåËŽˆ®åAeNÖ­)šß˜°?˜¦ Gcaa2ÜÍ.NÌرˆªx¼*l žì|·36FÉr œôÁÃÝEøt¨òM%²¸oSá@—…TQlY%X oì¢D?Â&K¦ÉŒˆjDѤv’K¬µQI`ª¬C¨È²?–?]¨¶€yÂv½R¯×®‘¥Ì»“þíT!Ø=&RvÿUBÅÖØD|±fôeòlSñ†kM«ƒ!G¨”–9 ›U½‹Ö,4þr<ñ¦(I µ5pjý3Š­‹Oÿ¥´õp-IEND®B`‚codequery-0.18.1/doc/logotitle.png000066400000000000000000000462171300045745200170700ustar00rootroot00000000000000‰PNG  IHDRø‚ªæÚl OiCCPPhotoshop ICC profilexÚSgTSé=÷ÞôBKˆ€”KoR RB‹€‘&*! Jˆ!¡ÙQÁEEÈ ˆŽŽ€ŒQ, Š Øä!¢Žƒ£ˆŠÊûá{£kÖ¼÷æÍþµ×>ç¬ó³ÏÀ –H3Q5€ ©BàƒÇÄÆáä.@ $p³d!sý#ø~<<+"À¾xÓ ÀM›À0‡ÿêB™\€„Àt‘8K€@zŽB¦@F€˜&S `ËcbãP-`'æÓ€ø™{[”! ‘ eˆDh;¬ÏVŠEX0fKÄ9Ø-0IWfH°·ÀÎ ² 0Qˆ…){`È##x„™FòW<ñ+®ç*x™²<¹$9E[-qWW.(ÎI+6aaš@.Ây™24àóÌ ‘àƒóýxήÎÎ6Ž¶_-ê¿ÿ"bbãþåÏ«p@át~Ñþ,/³€;€mþ¢%îh^  u÷‹f²@µ éÚWópø~<ß5°j>{‘-¨]cöK'XtÀâ÷ò»oÁÔ(€hƒáÏwÿï?ýG %€fI’q^D$.Tʳ?ÇD *°AôÁ,ÀÁÜÁ ü`6„B$ÄÂBB d€r`)¬‚B(†Í°*`/Ô@4ÀQh†“p.ÂU¸=púažÁ(¼ AÈa!ÚˆbŠX#Ž™…ø!ÁH‹$ ɈQ"K‘5H1RŠT UHò=r9‡\Fº‘;È2‚ü†¼G1”²Q=Ô µC¹¨7„F¢ Ðdt1š ›Ðr´=Œ6¡çЫhÚ>CÇ0Àè3Äl0.ÆÃB±8, “c˱"¬ «Æ°V¬»‰õcϱwEÀ 6wB aAHXLXNØH¨ $4Ú 7 „QÂ'"“¨K´&ºùÄb21‡XH,#Ö/{ˆCÄ7$‰C2'¹I±¤TÒÒFÒnR#é,©›4H#“ÉÚdk²9”, +È…ääÃä3ää!ò[ b@q¤øSâ(RÊjJåå4åe˜2AU£šRݨ¡T5ZB­¡¶R¯Q‡¨4uš9̓IK¥­¢•Óhh÷i¯ètºÝ•N—ÐWÒËéGè—èôw †ƒÇˆg(›gw¯˜L¦Ó‹ÇT071ë˜ç™™oUX*¶*|‘Ê •J•&•*/T©ª¦ªÞª UóUËT©^S}®FU3Sã© Ô–«UªPëSSg©;¨‡ªg¨oT?¤~Yý‰YÃLÃOC¤Q ±_ã¼Æ c³x,!k «†u5Ä&±ÍÙ|v*»˜ý»‹=ª©¡9C3J3W³Ró”f?ã˜qøœtN ç(§—ó~ŠÞï)â)¦4L¹1e\kª–—–X«H«Q«Gë½6®í§¦½E»YûAÇJ'\'GgÎçSÙSݧ §M=:õ®.ªk¥¡»Dw¿n§î˜ž¾^€žLo§Þy½çú}/ýTýmú§õG X³ $Û Î<Å5qo</ÇÛñQC]Ã@C¥a•a—á„‘¹Ñ<£ÕFFŒiÆ\ã$ãmÆmÆ£&&!&KMêMîšRM¹¦)¦;L;LÇÍÌÍ¢ÍÖ™5›=1×2ç›ç›×›ß·`ZxZ,¶¨¶¸eI²äZ¦Yn…Z9Y¥XUZ]³F­­%Ö»­»§§¹N“N«žÖgðñ¶É¶©·°åØÛ®¶m¶}agbg·Å®Ã“}º}ý= ‡Ù«Z~s´r:V:ޚΜî?}Åô–é/gXÏÏØ3ã¶Ë)ÄiS›ÓGgg¹sƒóˆ‹‰K‚Ë.—>.›ÆÝȽäJtõq]ázÒõ›³›Âí¨Û¯î6îiî‡ÜŸÌ4Ÿ)žY3sÐÃÈCàQåÑ? Ÿ•0k߬~OCOgµç#/c/‘W­×°·¥wª÷aï>ö>rŸã>ã<7Þ2ÞY_Ì7À·È·ËOÃož_…ßC#ÿdÿzÿѧ€%g‰A[ûøz|!¿Ž?:Ûeö²ÙíAŒ ¹AA‚­‚åÁ­!hÈì­!÷ç˜Î‘Îi…P~èÖÐaæa‹Ã~ '…‡…W†?ŽpˆXÑ1—5wÑÜCsßDúD–DÞ›g1O9¯-J5*>ª.j<Ú7º4º?Æ.fYÌÕXXIlK9.*®6nl¾ßüíó‡ââ ã{˜/È]py¡ÎÂô…§©.,:–@LˆN8”ðA*¨Œ%òw%Ž yÂÂg"/Ñ6шØC\*NòH*Mz’쑼5y$Å3¥,幄'©¼L LÝ›:žšv m2=:½1ƒ’‘qBª!M“¶gêgæfvˬe…²þÅn‹·/•Ék³¬Y- ¶B¦èTZ(×*²geWf¿Í‰Ê9–«ž+Íí̳ÊÛ7œïŸÿíÂá’¶¥†KW-X潬j9²‰Š®Û—Ø(Üxå‡oÊ¿™Ü”´©«Ä¹dÏfÒféæÞ-ž[–ª—æ—n ÙÚ´ ßV´íõöEÛ/—Í(Û»ƒ¶C¹£¿<¸¼e§ÉÎÍ;?T¤TôTúT6îÒݵa×ønÑî{¼ö4ìÕÛ[¼÷ý>ɾÛUUMÕfÕeûIû³÷?®‰ªéø–ûm]­NmqíÇÒý#¶×¹ÔÕÒ=TRÖ+ëGǾþïw- 6 UœÆâ#pDyäé÷ ß÷ :ÚvŒ{¬áÓvg/jBšòšF›Sšû[b[ºOÌ>ÑÖêÞzüGÛœ499â?rýéü§CÏdÏ&žþ¢þË®/~øÕë×Îјѡ—ò—“¿m|¥ýêÀë¯ÛÆÂƾÉx31^ôVûíÁwÜwï£ßOä| (ÿhù±õSЧû“““ÿ˜óüc3-ÛbKGDÿÿÿ ½§“ pHYs  šœtIMEÝ'Hò…œ IDATxÚíw\ÓÇÿÇ_Ÿ$Œ°§‚‚¨(¨  ¸q!îYµZ÷ø©X±Žj­Öºªµî-uÕQ÷¶ZEëþV©{ï*{É I ã~Ф ù$$¦÷|<òP>ã>÷¹»Ï½îÞw÷>†B@¡P( ¥RÁ¡I@¡P( x …B¡P(Tà) …B¡P§P( …BžB¡P( x …B¡P¨ÀS( …B¡O¡P( … <…B¡P(*ð …B¡P¨ÀS( …BžB¡P( x …B¡P(Tà) …B¡P§P( …BžB¡P( x …B¡P¨ÀS( …B¡O¡P( ¥üÀ3v€„0 £ø "Qd2 {0Œ™Ê9 …B¡P(åZà¢.“‰ý OŸÞÄíÛðòå[Äǧ"-- ÔÆÎû˜ÓT/RcIóo …B¡PJTàÅâܸq»vÀ³gïÀåš¡F 7ØÙÙ¡Fº°²JCllÄâLðùTàõE.cÇŽ5pvvD­Z5áîÞ¦¦²³³Á0€‹‹#êÖ­ààV0`8llœÀåòibQ( E"M²#„@&c×®è×o<<¼Ð¶mX[[C&“A.—kü(†#‘Háââ oïºhÒÄþþ~¨R¥²°jÕøø´Àĉc}_™/ …B¡Iàâ¾jÕBlÛv=zô€™™™ò\ÁŸ\.ÿ÷ÿ4± …a0 GÙh’ÉdÉd011«« ¼½½q÷îK´jÕ»w¯„L&¦"O¡P(”¢ ¼\.ÆîÝpòäÿЦM RPò…_¦t¹\©T ¹\¡P€ OQP¤eA‘W¤·¥¥%jÔ¨Y³VcæÌIÉr©ÈS( ÅðIvÏŸßÆêջѽ{w5󻪰B’’‚·o#!‘ä"++-Z4‚™™-MqƒTr¥ ü¿âGAî8zô"¤Ò X»v ¸\s:B¡P>côždGP˜ˆþý‡¢V-o˜™™i˜âår9âââðáCºukƒ~ýºÀË+ s˜›o‚Ýç6k<%% UªÔAÓ¦MÁ盃Ëå² ¼ê/..óæMDhè,:ùŽB¡Ph^–ÃàêÕ³HOÂËËD­Ç2™ ÷îÝGppSìܹÎÎup‹%ÊŠ{ ‘ ''¹¹RDG?Çû÷‘žž‰ÌÌlp¹ðùæ¨V­*ê×o˜™™ÀµÂgŽ££+fÏT*GZZ&^½zÈȸ»»Ëå*Íôª–—ª˜?=ºtéoïÖ´„S( íÁë&// ƒ …³³»Fï]&“áåËW<¸¾þz¦QzŽry¾Óœk×Î"<üo<{öIIi`ìììÀ盃a8ËóǤ33³‘‘ SxxTG‹ ñÕWQ«VX[»UÈÞ¿zœeÈÎNDLÌ{,Y²׮݇««‹²q¥j®ÏËËCƒ5qìØàñ,h)§P(*ðÚ…&==]Ñ©S'51QüÿíÛ8s欬\‹%¤R©QQ±qã\½z|¾jÕª +++B ‘H4&ô©N@ËoŒä!==ÑÑ1ððpÅ°a½0ztllÜ*…™_*áÏ?Ç”)Kàèè¨ÖƒWô裣cpÿþ_¨_¿ -å”rÔP¥P(¥…^³è†ADÄØÚÚC*•jŒ§¥¥ÁßßÖÖÕŠô!ç‡%Æû÷w2ýúCb¢­[·Aƾ°´´TÎÊW}nAqW½ÆÆÆõë׃¹¹56n<„F±fÍ*|¦q¹æèÛw ¾ývÒÒÒ5&8Êår8::`ëÖ´„SÊŒmÛ¶¡sçÎTÜ)”ò,ððòå;899h«\.‡H$‚U‘#!&aýú%èÑcD".Õ<âÉd2eÃBñSˆ¹âœê2UÁ—Ëåpvv‚««+Ö­Û‡Ž»ãο • +ìr²üõñ¦3fär©†s!BLLLpãÆ}q´”SJ¥—999˜7oÌÌÌ0aÂ\ºt 4(”2@ïIv©©éàp8Ëâ!077GZZf‘"}¡¡³‘“#CûöÔÖyœ!®Í,϶”ŒmI™““#$9ºv‚Ù³C0cÆðxs¦9Ã0àñ8puu†@«1dBATT $-åˆím-½N:…-[¶à¯¿þÒ¸ÎÜÜü³*3 ÈÉÉP(„X,†¥¥%,--QµjUðù|ZÞ(åOà šUÿoff†øøˆÅ)07wÖûá^Âر3àëëWW3¥¸+ž§Íí­¢Ç®íÇvŸª|7·êXµj'ž>}…°°U°µ­SA+—|w¶]+ò&33"‘ööŸ·ø$''ãÖ­[xöì>~üˆ„„ˆÅb˜››ÃÊÊ îîî¨U«š4i‚V­Z)+bZ k'""k׮ʼn't^W™^µ<¼ÿ.\À?ÿüƒÛ·o#22R©´Ð0<==Ñ®];£ÿþàóéÆQ”2x333MdBÂår‘‰$ú~Ë7ožÅ¸qߣuëÖj¢TÐü¯*ÎR©éééHOÏ@ff&rsó{®fff°±±µµ•2žl=}ÕIhŽŽ¸ví> ‡6Ãѱ~…Ë<™L†””O°°°Rkx©þrrÒ>Ë‚Žàĉ‹Åßïææ†^½zaðàÁhß¾={:uê÷Y¼«"ï“’’°|ùrìÛ·©©©E +22‘‘‘صk uëÖøæ›o0dÈZ¨(FEïer«Wÿˆ¿þº§\šUp¢Ûƒqûö%ØÛ»Z >ztÆ}ƒV­4Å]U”­á˜˜$&&¢^½ZhÚ´5ª×jUPŹ †A\\,Þ¾û€G_àáÃgxû6...033Õ0]4å‹Dbøû{ãèÑàó«T¨ <:ú!¼¼Z£zõj¬ ¯ØØ8ÄÄ<››ïgQ˜óòò°hÑ",[¶Li 2£GÆĉѼysZk°4v®\¹‚àà`­×Vô÷|÷î&L˜€+W®èì™×©S¶¶¶011Aff&RRRðøñc½™–––øå—_0eÊÚ˜¤”®À8°›7Ÿ@ÍšÞëòþŽ]‡€€^:É}€Þ½Ç I“¦ÿ:±!ËîòEXŽ·o£`bB0dHo Ò V–XXÊòmÓPî`Ã0ÈÎÎA\\6…ÂÉ“ç`cc§uö=!YYÙ6¬'Ö¬©X.^OœØŒ1c~€ƒƒ=«À'%%#>þªTñ¬ôBóóÏ?cÞ¼yZ¯ F‡àã㣬„­¬¬——‡ŒŒ ÄÄÄàéÓ§ˆˆˆ@xx¸Ö ¹ZµjX´hÆŽKkÌž=Ë—/×°üÅ‚RžÊÖ˜1c°{÷nóVVV˜0a† †Æë +'''OžÄÁƒ®óZ'''œ>}­Zµ¢BO)¿wïOŒ1û){𪂃 `ܸÙZ?–ÜÜ4 2|¾rÜIÕž¢×.‰ðîÝ|÷Ýx ÐÖ¶ “ã_× ™œ‹ø!þ†S§.¢JgÈdêÏRµ$'§`ÇŽ%6lz…ɼ… §bëÖ#Ž‡ @€ŸÂÁ¡f¥-À¯_¿FPP4—?vèгgÏF×®] î•Þ»wëׯǾ}ûX¯µ±±AXX†Ž={öÀßß5ú¬+“«W¯¢cÇŽjÇðéÓ§ ù>?~D@@€Fü---±uëV 6ŒÕšQXù˜?>Ö®]«óú©S§bݺuTä)%+ð„¤¥E#0°+üýý5zŠ2™ YYYð󫉵kwj #aaKqôèUxzÖVk$¨ŽÇÆÆÁÞÞaa P£†9ˆT^ŒÂM •q~þ&Nœ>ßBËV¶äß]ïrðèÑ%xx4­½‹\ ò%þùç1†Q¾‹jºš™™àñã`këV){íÛ¶mÄ 4Î7kÖ „§§g‘+GÕÊø믿Æþýûu^_·n]¼yóæ³®LRRRP¥Jµc5jÔÀÇ+Ü»V9ÌQð}ÀÕÕ&&•k”¢¢›2e «¸oß¾wîÜAíÚµ•e·H%çßû,--±oß>Ü¿ÖÖÖZ¯ÏÌÌüì+ggÍ4®|=zôˆUÜOŸ>]lqW-[ööö¸uëV¬X¡õÚË—/#88XùS(FøüŠÎîîU!‹Y'¬q8åLú‚H¥B,Y²ÞÞõXׯK¥R$%%£Y3¬^ù5,Ì¥1Nk•aÈêճÅ »äï÷'„€Ãáàĉ xôèF¹Ï¸¼< bc“Ô† šè==ÝÁç;V.“à $$7nT;njjŠ·oßbܸqÅvm•qãÆ‘žž®u¬5--Ö&,¨®û®âž••Å*î÷îÝCïÞ½K¤lÍœ9“Õ€‚+W® 44”öà)%'ð~~õžž¡áYNÑOOÏ„T*cé½?Ç•+wamm­±ž]*•B,ÃÔTŽåK'Ë‘—LA–µkYâäÉ0dg Ô–ü©özì±pá2H¥Ârq™™)HLLa]GX,†¿0ŒI¥*°K—.ÅöíÛ5Ä=!!žž%7™ap8`ê´Ñð¨ál4³¼nr1lh'øû×W{7E66Öزå7ä¯Å+Ÿ¼yó^)ðry¾ÕC"‘ ;;III°°àÃÓÓ¯RTŠFKPPƹýû÷ÃÃãÔÌ— ‘¿uëªV­ªvîýû÷´F)€‰‰I…(_éééG>Ÿ°°°Rý†ºv튅 j=?tèPjª§_àó'Ú™ÀÅÅA)Ô'Êñx\¤¦¦©ÝsûöeH¥Ð0é+þåpä1¬3ˆ¼t&¶1 ++‚Ÿ~úN¹›êÃ0 LLLpþüudg—ßZâã“`bb¹\Žœœ$&&"=="‘àïï33^¥¨ †Áĉ‘››«v¼mÛ¶:th™Ä‡‚»wïª/Øû£ BxºcÓ¦MÓ8®˜çQÚßЂ вeKÖs'OžÄ³gÏh/žb\KK'xzºC$©‰µB°MLL Ôî9sæ ÜÜÜÔ|È+Ä>!!ö€-§T?""Z6÷DãÆ Ôf¡«¶è_½ŠDbbl¹Í¸ôôLdff"99Y#ÍÀÏÏ ®•¢÷žššŠ-[¶hœ;|øp™Ut ÃÀÝÝkÖ¬Q±ª¼¡5 K:•wÒÓÓ±gÏãeå̈¢ÓTO'ÜQJDàÆuëÖDvv¶Ö¼êd# OŸ¾ƒ…_cæ½L&CRR"†éñ¯›Ò¬t+à‹/ºA,þ¯W¨ºa‹™™ÂÃÏ•ËL“J³‘›+A^^žÖkZ´h\i‚mܽgÏžpuu-óŠîÛo¿UNî{ùò%­Q* ª4!!!eZæmmm±jÕ*Öóׯ_Ç›7oh/žb\/¯Z¬›¸ÈdêN"‘ %%uó¹\//ØÙšÁuFC&ÇÀ/;A ¨Á+6´‹ExðàÊã8¼L&†H”«óšÀÀ¶•¦œ5ß}÷]¹¨à!8~ü8 ))‰Ö(õë×kûòË/˼|͘1Cë2ßþ™öâ)Æx77å2³‚ãéyy¹j³fÓÓ“þY/ÕØÆU ÀÇÇ–Öeõ1pv²BÍšnÊÞ{FFÒÓÓ•Vˆ¨¨…å¯ÒVuñˆ‰ .¾pB”;n©Z:t(Ã0ðóóÙ3g°lÙ2Z£T0ž?Žììlã;w.åkåÊ•¬Ç÷îÝK3b|¯^½òò$ãï2™ B¡..ÿ¹ª|óæ%¬­­4fÎK¥Rddd¢~ý:ÿmS˜ššÀÝÝ©©©&ïÄÄBZf™ÆáÇãj=ïâREçùŠÃ0¬Y·nÝÊ]\{öìYâk¥+j–gÖõNLùqí}Š¤¤$äååÁÖÖ^^^h×®úõëW䲯zÏ“'Oð믿bÛ¶m€ªU«"11QíºÛ·ocÎœ9ÊNFÏž=±fÍxyy)¯!„ ##oÞ¼‰‰ LMMabb333˜››ƒÇã)ËpVVr»j¶ø_ºt ‰\.W—Ë…L&ƒD"D’o=oÕªlll Mƒ©¾}û|¾9d²|—´ª=óºu=`eõŸïs.—™L®ÖƒWü8òòÊÚ½'au­«4op8åV ¼¼jélˆUþùçÖã%é’¶,X³f Ö­[‡˜˜=-8¦˜|8Ö­[GGÃöÙ¸wïöïßßÿß”j|¦M›¦1ùòìÙ³8{ö,¦OŸŽÕ«W+óÇÁÁÁ(ÖˆÕ«Wã»ï¾Óë~OOO¼{÷N¯ÄܹßÒ¤IÒ¸qcâççG6lHªU«NÂÂ~R»ö?¶_Ò©S'L:tè@Ú·oO‰§grðP!ò;„HËæ'>!½zähüªU«J23cIyäÞ½3ZãíããE²³ãHEgÈ!¬ïS¡ßK.—BÙ¿?ár¹Ê÷jÒ¤ Ù¿?IIIQ^›˜˜HþüóO2jÔ(Ö´˜3gŽZ˜E%::šT¯^ |>ŸlݺUëµW¯^%_|ñ…Öò§úëÝ»w‘ÒfþüùjéróæMµëÒÒÒÈ¢E‹4žW¯^=’žž®WzÜ¿Ÿ5ÎkÖ¬)we¦E‹¬qMOO׸VŸ|™1c†ÞÏÖ'¼ 6¹Ü¹»»+ÃYºt) …å­qãÆÏ\¿~½^eÛ¶mÄÊÊJgüëÖ­«¼~Ĉ…¾ï–-[”×8p€4lØ°Ð{úöíK† FöìÙÃO‘HD,X@ÆŽKÜÜÜXÃ055%3gÎ$ñññz•qòáefÆ’fÍ“Æ¥¸7hЀ¸ººôôµ‡>ztž¸»{::víÚ‘6mÚV­Z²hÑLBäwËLà³3ï’† ½µfH£Fõˆ@P."##–8:ڱƛÏ7'iiÑÅ®ôËš€€Ö÷ûôéS…÷~ýú©½Ó™3g´VVŠcr¹œŒ3F#=ÜÜÜHjjj‘óûÆÊ°Zµj¥÷;¤¥¥‘‘#Gê¬ÔúôécpÚtéÒEyÿèÑ£uVâñññÄÜÜ\í™fff$--­Ðô8vìkœýõ×rWn¦M›Æ×gÏži\»iÓ&2nÜ8Ò£G­ù2qâD½ŸýðáC²xñbÒ±cG½O_îÞ½«¼ŸËå’èèhåbÒ¤IÏýþûïÒ@©U«!„-[¶èuý´iÓ4â÷ÕW_i½¾W¯^§O:u4‰D5èõ¶AËd¹ [‡”” ôB¡C‡ö†£šz7·zàñ8×B`nnŽ§O_B&-38!Iž?«õšš5Ý`jZþvÃÊw·ë€Þ½ƒYÏ‹DbDDœ¯ð¦zm&k]~Ê3 ó_`` Nž<ùï| s$$$ gÏžZ‡WTíܹ'NœÐ0e;99áýû÷Í!„àÞ½{hÓ¦ €üÉeÿüóO¡a(âcgg‡ßÿÑÑÑhØ°a±‡‹†Aß¾}qáÂåðÀ®]»tšË]\\pçÎsgráççWèêÚü(†'ÊS¹iÖ¬ë9¶%~“&MÂöíÛqöìYÌž=[o±6üýý1wî\\¾|ûöíc½ÆÐ1ý·oߪ½ÓÅ‹µ®^Päã¦M›”eUÁŠ+pôèQÏ»rå æ΋­ó+RSS_ýµ^ïжm[5ÿ)„:t5kÖÔ¢%5 Î÷‚C^óçÏWîΨïwÅ),ÓårÒÒ"±páLlÞ|ÖÖVj“åþägÏþ_-SLMypv¶ÿ· ÓpŽóüù[ròÊd¥Ãeð¿ë/u.ƒóòª »r)\.ß~ûÖó+VlGNNb…^F£mr—P(¬ïÃ0 ¬6·àáÇ›Ö&¬ýúõc]Þåé鉴´4½ò\19¨yóæÊc7oÞ4hìYq››ž­üûôéӅƇa4lØPÃó\LL ¾ùæ÷j[=# ËÕwÃ0 j×®]¤ÔÒ¥KYu—¿aƱn ¤oxŠ ÙªKJ»u놠  B󙂳gÏjœ4h²³³µæYPP/^Œ­[·âǘ8q"kCÉÙÙ@þÖ½üñ=z„‹/â‡~P{gôïß_cU§Wyøða±ËÁüùó ¾‡£ÞKaÿþ5صk%vî\¥K¿Ç˜1#ØGŽ\€í¿¢ÿ_o<))7.€“S}À--P»¶›Ò÷|Á¥rÉÉi¸{ï˜2èÄˤ>ò§ÎkÚ·oQ®£Aƒæ6¬/ë¹ë×ïbáÂù  n±WTá/ï}úÀÏÏÁÁÁøå—_——‡Õ«WcРAxúô)k|†A“&MX—ñFDD\ß¾}[ùÿQ£Fié3Gõ#ÉÌLÆðá3ðË/Û±tévìÙs¿ƒ©©9ÌÍÍÔ–ÅI¥R|ú”†¹s'¢K—Á¬‘çpøhß¾)ÒÒÒ5ö€Ï_V猭[÷A*-í‰ 1YŒ£:ÞÄ„‡ÀÀnåZy< ,_¾ŽŽö¬çW­ÚŽ®]ûàرMHK‹Aff,²³ã!ÄC.¯¸ûJ—Å:ìb•¶¿›‚;ß-^¼¸Èy@ÁÖ­[5*ê>`Æ …Þ¿gÏ<~üXù÷Œ3ŠÝËd›í­occ̘1jÇF­wÚ0 >Ÿà`Í!«¢lÌòñãÇrW†ìíí :^VVVE.{..š^2¦ãÂÊlTT”š™ßÞÞ¾¾¾zç!„ÕŒ®·~m³Þ<ˆþýû«•[ÕxMŸ‡¶™ IDAT>‡†•••Öø*¾K6vìØaP:«n84{öì"åGõ#ÉÎN…½½#ll¬acc£æLEu{¾¿ö Lœø¦Lù\®¹ÖîÓ§/²²2ÕÜÕ*þ/—Ëqõê-¼| 0¥'629«VíÖéÄ&88PmNAy¥zu<¨½Bˆ¸‡'ÃÙÙõë Y³¶h‹‘#UØ1úׯ_W¨ø2 ƒY³f©«_¿>‹^¾÷………iœ+ø,6BCC•ÿïÛ·¯QÞ“mœQŸeXñññW;Þ¤IƒÓ†mœúÂ… j˹ ŠOŸ>-weˆÍ,®®EÛ1ÒÚÚºÈeÏ¢HÏ0 ¾ÿþ{ ‹“¡åÞ××—õÜ’%Kôz'6ë…lз§í\½zõйsgsŠ¥uú4b=z¤\Š^§N"[úxl¦6U'6ÔzÝr¹¹¹¹˜:u$fÍZ¤SÜÀÑÑ >ˆ‹û¤æõNž½½=¾ÿ~%N_3SqÉ‹¼‹LÃÆ»t^6jTp¹|”w!èØqvìˆÇر³t\$$$#!!ùßҤܿ›¹¹9넧T¸FIÁÁ:uêd”pG…‰'ª'‹Åbœ?]»vÕøž!8vìrrr”ǺtéRbë¾ S±ö¾ >|@ýúõ‘›› ±X ‘H„œœ_NNÄb±ÆäC‡Æ„ 4â¢mîCyìÁ³÷®ø¢Âãñô}¶ºªàµb¢c^^rss!‰  µæµP(ÔjÁ;|ø0~ÿý÷BãÁfênÒ¤‰Qëä7j8_zõê^¾|Y¨X3 ƒC‡)ÿVº*–À+"§h9¨Š½B˜år9ø|sÔ®]C¯ ÁÌÌãÆ DHÈ8;;ª™,BûöìÚŽ±ÀAIiû†ÑØÏßß¿ÄÊ´>“ì<¨q¬W¯^F‹CRRëûi×ò,µjÕª\[¹ZµjUä{‹3Ï&ð…õàµM@{òä‰ÑÒ877×he²¸u²··7‚‚‚4\m/^¼(4 UÏ…&L0–À QWcEFåææá›o‚Çã ÿ±àpÌtŽItìØ µjmEv¶XÍÔ¯ßÖÖ?ÎY_ŸhÛÖ•LE+“1øqÞfܺ¥{Fczz&zö­vÌË«6æÎ Å!¡àñÊWÏžap¹æ;6ééÌ›·ªR|ýúõY>55Ÿ>}2Ø“UYå ›À»¹¹¥b#„`ĈÏæÃ_AA¿Ûîîî%úþº‹Åˆ‹‹S;fccƒï¾ûNg#\LMMáëë‹>}ú°6¦tõÚþüóO´nݺܔ£OŸ>i+Ξ ú˜Ô øÂfÑ3 Ãêï}À€ZM1GGGå¿å¡QFÁúõëѨQ#ÆìŽ;t.+|ÿþ=âãã• Ýâì+¢–S&&ÈÉÉT*!G9^®Ú£W˜d šŒsç,Ñ­Ûh‰om] ³fǸqsáè˜?ÁAUà !°²²ÂÀãñ矛Ñ,ÀD.4bO^™Œƒ_–Æúõ…OtÈÉÑœ]ûæMFŽüGŽ„ã×_WÂݽI¹êÍ3ŒwîüeËÂ*M> þÉ>òĉ7n\…˜GÀærW“¦¾•[ùáÃÖëŸ={¦qÌ5ÌÆFu¦°OOOÌ›7¯Ä¦¦¦prrR®Vå÷ß׺Ĭ,`›w¢ðPŠºLN›Àë3‹¾ ¿˜2e Ú¶m[é6ÍQ,ßlÙ²¥Æ~+V¬À‚ ´Þ»sçNåÿ'MšT,Q³U888c„Aèر)Ú¶õƒO-X[›#%%Um{^^bcc Š×¯# mÍôèñZ·nÌê—^ñãryèÞ}}ªKýØÆQŸáåå¥×3òæê(Ì%Õ“Ñ[ïYuS”’®€‡®õüâÅ‹Ëøœ;wNíïânìS,³o>++‹5¯+ëžö ¯•'Û‰D"ìÝ»Wã½ !xùò¥rW;6‡<ÅxM³‹=¬­«Ã×·=Ž9€îÝÛ±Vwî<Æž=Û ýêÔi†uëæ --MmÙ\Á­g---°cÇ4kÖÛ¶]A–€€À`Pˆ×;p™Œƒ÷…˜8y 7îƒ'O^–HîÞ}MštÂ¥KûËd]9!99 :ôkdff³^ceeñã#<|'bcŸ"99 ©©ïqõêù ñ‘ 8Pë¹E‹UØÖll¬QË Ûr)63¬êìyÚw”†À³YØ„ ¤â¬u¸äСCÈÊÊ*¤pß«à»ï¾+V¼ŠóÝ°‰yQ'®½yó¦RïiOјóæÍÓxo†a”Û×ù“g‹[öôÎ>ß+V,кù²eÛ•§3B„0øòËñ˜6m²³jËæT{ñŠB”‘™o¾™?ÿ/1iÊj\¾‰ôL ²s‘˜ q® D¹<äˆ8ÈÌ’#&.Ûw\EŸ~ߣ¶g¶o;Pâ—„·cæÌ|+Fi"—‹±zõrܽû„õ|›6ÍðêÕ?Ø´i;ºwƒêÕ}áì\ ŽŽ5aaáZ!>m¾´`Æ ÈÍÍ-ó Xñ|EÖ§òSì£m,ô]›Ì6VzíÚµ«d W›%É®=õE×xhHHH™ PAÇ) 6D:uŠ/‰DRä{Ù¾¨q)8>]{ñ½{÷ÖX’ùñãGܸqC£¾P䵧§g±óXQ9°ÛS Õ¾•ÞÉ“›õÚ1J"’)SFkkkRµjUR¥JR¥JâììLœœœˆ££#qpp öööÄÁÁ˜™™)ŸÁãñH½zž¤cÇÖ¤{÷¤S§6¤Y3?Rµª“^»ü™˜ðHݺ5‹t/4¶ªô$\"R©°Tvr‹}HLLx¬qqw¯FŸÊ@Ó¦Mµ¦ùøñãËE»wïN´}NuëÖÕˆwÓ¦MúüÙ³g«…ommÍzÝo¿ýƺ¥±(öˆ#t^¿}ûvÖ|]¸pa©æ_ÁéP`Ƕ²Ü™ÑÞÞ^->ׯ_7(>lïtâĉ"Çgîܹá%''zŸ¶-[Ë‚‚q>|x‰>í»ëܹ³š.þïÿSž[·nqÞÓÐŽ߬õC6¬/‘ÉDz‹üœ9¡„Ï· NNNÊŸ££#±··WŠ;ŸÏ7Šø²ýÌÍÍÉÉ“›I—.íŒî’%3ˆ@_â…töì :ög^P)Ä].—“gÏžéLïçÏŸ—i¼sçNeã“aÆ•xÅ6nÜ8µ°ƒƒƒY¯»~ý:k\ÂÃÃ’†† ü•+WXããêêZªyxâÄ ­åËÅÅÅ -:ÉÚµkÕâÒ¬Y³bç þÝK½¨ï3oÞ<ðRSS ½¯Q£F¬q9zôh©§mÁ8 :´ÄŸijjªñÜÄÄDå»4Hy<77·lþÕ«kZ?/¯Ú$;;NïŠ["’ >ŸOˆƒƒƒ²çnoo¯µÅgŒŸ«kUòèÑ%B!‹O7zø-[6&¯_G¹<·D oVV ©WÏSëó_ÊÛ>èe]ËåròîÝ;e<7nÌz;}ûXã½oß>£Å¹}ûöja¯\¹RkœÙââëëk”ôÐlôÓyONNŽÖ|½xñb©æé_|¡5.ãÆ+õ²•––¦SŠ#ðű|±íMÿéÓ'ƒ¡ÿé†W™÷à TâÏ\´h‘ÆsCBB4âÔµkW㽧¡….1ñNaûôéƒAáI¥BrýúqâåU›XZZ;;;bggGlllJLÜî¥f¾ŽÌÚº*îÏÔÔ„lÙò3‘H„F/,QQw´>·ví$33¶Òˆ»¢BsrÒ> £ø(JKär9ÉÎÎV³0Mœ8Ñ QmРÑâcbb¢vzzºÖk›4iŸS§N+ýd2™F˜_~ùe¡÷U¯^½ÌnŠgxxxh-caaa¥ZÞëׯ¯öüÕ«W)¼*Uª°ÔµÚ*ÌD/—ËÉÑ£Gµ¦íÁƒËTàûõëWâÏ”J¥¬ïž››KÖ¯_¯üûÏ?ÿ4Z™7¸«Û\úöíÍ"æôôwäûïCˆ……±¶¶.a¯UËœ8ñ+‹àJȶmKJ¬AѳgùøñžQ+«;—k}^³f~D H¨T=x¹\N¢££u¦óèÑ£KEär9 …ÄÙÙY£’ÒölmˆsçÎ+¾r¹œ<}úT-Ì=z輇m}¬ÖgµháOrr*—À+¸}û¶Ît.ž|rr²òƒTý%$$hŽ¬¬,ÖøZYY¹\^¬ø¬4bbb Ouâ*ÛoQâ3þ|ð ½O èÌÓŸ~ú©HqR½^ß{år9‹ÅÄÓSûðט1cJ¤Œ)Â[°`A ³îÅz^Áð¿‘#G¿·oß²†õä‰~zCBB´¦«ÉÊÊ*ñ|f³¨µk×®T>|ÐYÖCCCËVàOŸÞ®3‚'Nl1‚)CHŸ“+f‘ÀÀ¦ET''2dHorîÜN­ÂÎ&òÿ}œÔ¨Q½Ä„~äÈþÊáâTC‡öÑúŒÆ}Je’_yy;;;rÿþ}£VŠp.^¼H†aYaRh6lÐ2_£e‘¬`¯yÙ²ezÝ»wï^­é×¥Kƒãó÷ß³†ekk«×ý3gÎÔ™§£F28Nûöí#ÞÞÞdúôéEÊëê˜ÃãJ=zd´2¦£ º¸¸±X\¬g¼~ýZë{\¹rÅ øuìØ‘5œóçÏëÝx*lâ³¾éª8§L7}HII1ê…¡h}ÿ/^µáh°À¯];Og?¾Ù¨‰!Ä‘¤¤Wäðá dúô±¤_¿.¤iÓFÄÛ»6qss%žžÄ××›’Q£ú“•+ ÷î%±D*ÜzÏ/ÏÉøñƒKLä«U«J.\Ø«ŒŸ¡ä契~ýºéƒW4j*+111ÄÖÖVg:÷èÑCi:,êG£¸O$‘¯¾úJë³~øá½ÂëÚµ«Q,Šëj×®­ £ÿþ½›¶Êñôô$QQQZã¤zìûï¿×™úN «Y³f!v'røða­ñ „ÄÄDòã?ª-{ÓÇ¢¡íý<¨3N½{÷&?~,¶Ð_½zUcüßßߟH$£Tø 6Ôú§OŸÖ+þºzß¿üò‹Þqùã? ­#GM’’’t†sæ̵á‡!C†è•¯wïÞe}fTTT© ï8p€õùÆŠ0ô† t ßéÓÛJ4d2ÉÉI ÙÙq$++–deÅ ž… :?|C‘H„ääÉÍÄÑѮĄþÛoÿddD7‘(‰ô쩽r¶²² ii+µÀ+òwäÈ‘…¦s‹-4ÆÇ ³æ¨ ÆÔ©Sµ†Ý¾}{rûömƒzÚ&¹ùøøÌÌL½ß½qãÆëx m ¸»»ëL»îÝ»“£GªU¶™™™äÒ¥Kä믿VZ3Ö¯_O&NœÈ†>fz¹\Nrrrˆ££c¡ùÉ0 éÙ³'™={6Y²d ™={60`qqqѸ6""¢XåkÙ²ez}ËAAAj½X}óá·ß~Sk¤)~óæÍ3ªu à< ¶†Êƒ4"k×®UŽ»×®][­Ü)~ŽŽŽ:¿£‚¬Y³FOß"õÈøñãÉ¢E‹ÈO?ýDBCCIëÖ­5®kÓ¦Þßµ¶ÙüŽŽŽjÃl%)ölÏ_µjUÙ |NN<éС¥Î ¹pao¥¸¸‡dÀ€n%&ò^^µÈýû‰D¢¿s±8™ôê¬3ܘ˜Ç¤²£H¯—/_²~ôl?oooJ6nÜH.]ºDž={F>~üHRSSIbb"yúô)9vìùî»ïˆ···Öp† ¢³‡[Xœû÷ï¯sÌY"‘¨Ý£úŒ3gΨ­2Ù¾}{‘MüyyyÄ××·XeøæÍü‰µ¿ÿþ{¡•Ÿþ™dggkµ H$ŽôŸóbCÞ½{W¬rUpé¡>?G†NöïßO"##5LÃÿûßÿÈÒ¥KI»vì¾7  u.GqÑ6DÄ6¬Âæø§mÛ¶„Ý“"? ’­3>ºfÕò›|¸š°÷îÝ[¯õÇúÄ…mná¾Z’´´4eááázÝ7gÎœBãÆ:×AŸßرc‹ÝkÙ²e‰•£‚¿N:‘Í›7»\éÞ={ ŽÃ0jÈÓ§O²<Ø”xyy‘¼¼¼Bã“’’BÚ¶m[¤tstt$7nÜÐ;ÍŠš?b±ØèõÕ‘#GԞѱcÇ’±rñóçšññÏ+©€ÈÈ»w7Iûö%÷á·hј¼z¥Ÿsœ!Czë kÖ¬ò¹¡šf.\ ¡¡¡¤V­ZÅÊ2kÖ,rïÞ½‹÷H‡ôŠƒƒ™:u*‰5ºH¥R²zõj“€ìììȸq㔳¦UŸ¯êqÐÆƆ’!C†éÓ§“5kÖ³gÏ*×çëïõëד š.vvvdÚ´iÊ¡„â¤ËòåË5æG9r„<þœ>Þ }Ák?~L†ªWúµk×N9Ãt;tèù駟Ȇ ÈÁƒÉ_ýEîܹCž={FÞ¾}K^½zEnܸAŽ?NÂÂÂÈ’%KÈÚµkK$¢¢¢JÅ›óoËF/6lX€©Siß¹†Ã %å=<*íæBa"¶lÙˆ™3—}OïüÍ@L°~ý<Œó ÌÌìµ^7aÂlÛvHëùnÝÚãäÉ£07wÆç!Dm£†GáÑ£Gøøñ#bcc‘””‘H‘HBø|>œœœàîî/// I“&ZÃ+©¸>yò¯_¿Fll,¸\.lmmáéé‰æÍ›ÃÁÁ¡Ä㣠11IIIÈÍÍ…••<==•;Ôi{þÇáïï¯q®¸ñ•H$ˆˆˆÀ›7oðéÓ'H$ØØØ V­ZhÞ¼¹r7½â<‡¡P+++å±ððptïÞ5Üôôt¬X±+V¬0¨.hÛ¶-þþûïrñm¼}û>DLL rrr`nn777´lÙµk×.ô~c•Ã‚qzôèbbb Àãñàââ´hÑ¢ÔÊIòäÉøùùilXU™­2™˜ þ…Ζ•››+ÉÌŒ©ô½D©THž>½F5ªWb½ù=‚H\ÜC­ñX°`ŠÎû«Vu"Ñ„R~üø"…1fÌ|úô ûöíC•*UôºgË–-puuEÇŽqõêUš•|è0##.\ØØØ E‹%6Ü ·À§¥%@*•ê¼ÆÇÇë³Ê,†aÀ嚣M›þ¸ÿ"&LjôgDDÜÃ… §Ô !nnÞàñ¸:ï½{÷1ý¢(=¹wïžòÿAAAÅ6l’’’püøq­cÙš ò«FÕªU±fÍec£ÄÆg)e¢Ó§OWþ=qâÄ}žÞÿøñÃB¯ñó«ÿYf8:ÖæM¿áÔ©­pt´7ê38 ¹\¬öL<=kê¼ïÝ»hˆD ô«¢Pô 11QùÿêÕ«¥WÕ¯_?DFFâòåËÐëžääd̘1¦¦¦èÖ­Ξ=«Ö¸×·§H)½÷>`×®]Êc“&M*ѼÒ[àcc  ÿ¶ŸuÁârÍѧOž<¹Š»-ÜW¯¢ e¨37çÃË«–ÎûÞ¿T*§_…¢OeÈù¯:T¬0V ((÷îÝÓ'OгgO½ïÿ믿лwop8Œ;W®\Ñû¹“'OÃ0XµjÍÜrÒìÛ·¯òïzõêÁÝݽDWè-ð))i:ÏW¯î[¡—.ëc®VÍÇîÝ+aaÁ/v¸yyyÈŸñ&&öðôt×y_\\"¤Rý²(=4hòÿ–––%R7øúúâÌ™3HLLDHHˆA½¿;w¢S§N`X¸p!Î;‡ÈÈHddd 55÷ïßÇÏ?ÿ SSSlÚ´ `ooO{ôå€Í›7ãÉ“'Ê¿CCCKÅl Ó¦Ñc}©¶ìEF"#o“  VÅôtÕ†ˆDÉÏص«ð™ôÉÉ‘43(=9tèÒ^i,Å”Édä—_~!|>¿DVâ(¶š¥”­DGGkäMnnn‰?›c¬†‚‡G5ðùUi3M­ÅÎAíÚÍqöì)¬Y3WÍhÁÁ­XÖ4kÖXÞ¿ˆf…¢'_}õ~ûí·ïñ*zô?üð„B!Ž;¦æ\©¸´jÕ ‘‘‘´÷^†òœѽ{w˜šš–øóõVkkÝ&+G ÍQÌÍ0eÊ<~|~~ º×ÑÑ!!ãY Ž«kÝBgÒ‹D™4(”" piÒ¿Ü¿qqq˜5kìí‹6Y·~ýú8uêþùçðx¼ÏzØ´<”£Þ½{#%%EíøܹsK¥á¥·À{yé^êA'séÎd.—_ßvˆˆ¸„Ôìe÷îpp¨Ë&ÇAõê.:ï73³¢@¡T F…««+–-[†´´4¼|ù‹-BË–-uÞÛ¨Q#Ì;¯^½Â‹/лwï2k¨PÔ¹víšÚß;wFëÖ­K%oôöEýÚÍG]»¶Ã‰‡ÁçW¥…J„Èd"Ü»÷?Œ5 oÞ¼×b1±ÂÞ½«Ð«×Hp8æ¬iš–-;àÅ‹·ZŸ—šúŽŽ5iÂS(•€´´4ÄÄÄ //666pvvVîO@)Ÿõ=[ÝMJÉ—¾Þ/Ä¡}ûnxðà™Ök®_?Ž6múWøJ û÷ïÄÉ“ñæÍ{H¥2xxTGpp+Lœ8U«6ÐY@23ãàííääO¬á׬é†'OnÁÚº:Ml …BùÌàé{¡•Uu ÞG§ÀñÅX9’‹ví¾Ç§B_––®˜0a.ÆŒ E^ž„\. ‹ÿÜýjK?†aq^«¸@ëÖM`iéHšB¡P>CôîÁBúõŸ¤óÚAƒzbÚ´±hРLLx`€Ïw¡‚oiøþý´k÷…NDçÎíD·nch¢Q( øÂ9~üW|ùå$½®uqqF:5acc…ÀÀƘ3g.Mõb‡S§aúô¥HIÑÞ{oÔ¨>"".ÁÒÒ•6ª( … |á½G™LŒ©SÇã×_÷ô Z"<üºVÞòò²ññã ¤¤Ä !!÷qöì5¼yUè½gÎü†ž=ÇÒD¤P(”Ïž!+vO[µj->|ˆGx¸þ[R_ †#fÀË«¥Á÷?]»¥C" …òc°k5†aÀç;ãÀm<¸MÁD,Î5ø?¿úX¾ü'ðx|*î …BÞplmë`ïÞ#غõg˜››Ó”,øúzãܹƒ°·÷¢‰A¡P(Tà‹í‚cÆ©IDAT—kŽðîÝMLž< NNº\+R}I2lظví\]ýhbP( ÅðYôÚËÅ>áÞ½«8uê^¾ŒÂ‹o—¿¤®}û¸pá LMhªëIbâ;¸ºÖÕyMݺµ°lÙLôé3<Ÿ&…B¡PŒ+ð€ºû=‘( ‰‰ ¹¹p¹f¨ZµMqƒ>®®šiæèhvíšcĈ¾èÔ©/¬­«Ñ u …B)9×Wü)ú!&`È‘°µµ‚««3|}ë¡uë6prr…••¸\ê-B¡P(e,ð”¢"G1§JP( å3„*Í" …B¡Põ P( …BžB¡P( x …B¡P(Tà) …B¡P§P( … <…B¡P(*ð …B¡P¨ÀS( …B¡O¡P( … <…B¡P(TàiP( …BžB¡P( x …B¡P(Tà) …B¡P§P( …BžB¡P(*ð …B¡P¨ÀS( …B¡O¡P( … <…B¡P(*ð …B¡|îü?49l”˜óèIEND®B`‚codequery-0.18.1/doc/logotitle_small.png000066400000000000000000000215171300045745200202540ustar00rootroot00000000000000‰PNG  IHDRÈ4Ïwü OiCCPPhotoshop ICC profilexÚSgTSé=÷ÞôBKˆ€”KoR RB‹€‘&*! Jˆ!¡ÙQÁEEÈ ˆŽŽ€ŒQ, Š Øä!¢Žƒ£ˆŠÊûá{£kÖ¼÷æÍþµ×>ç¬ó³ÏÀ –H3Q5€ ©BàƒÇÄÆáä.@ $p³d!sý#ø~<<+"À¾xÓ ÀM›À0‡ÿêB™\€„Àt‘8K€@zŽB¦@F€˜&S `ËcbãP-`'æÓ€ø™{[”! ‘ eˆDh;¬ÏVŠEX0fKÄ9Ø-0IWfH°·ÀÎ ² 0Qˆ…){`È##x„™FòW<ñ+®ç*x™²<¹$9E[-qWW.(ÎI+6aaš@.Ây™24àóÌ ‘àƒóýxήÎÎ6Ž¶_-ê¿ÿ"bbãþåÏ«p@át~Ñþ,/³€;€mþ¢%îh^  u÷‹f²@µ éÚWópø~<ß5°j>{‘-¨]cöK'XtÀâ÷ò»oÁÔ(€hƒáÏwÿï?ýG %€fI’q^D$.Tʳ?ÇD *°AôÁ,ÀÁÜÁ ü`6„B$ÄÂBB d€r`)¬‚B(†Í°*`/Ô@4ÀQh†“p.ÂU¸=púažÁ(¼ AÈa!ÚˆbŠX#Ž™…ø!ÁH‹$ ɈQ"K‘5H1RŠT UHò=r9‡\Fº‘;È2‚ü†¼G1”²Q=Ô µC¹¨7„F¢ Ðdt1š ›Ðr´=Œ6¡çЫhÚ>CÇ0Àè3Äl0.ÆÃB±8, “c˱"¬ «Æ°V¬»‰õcϱwEÀ 6wB aAHXLXNØH¨ $4Ú 7 „QÂ'"“¨K´&ºùÄb21‡XH,#Ö/{ˆCÄ7$‰C2'¹I±¤TÒÒFÒnR#é,©›4H#“ÉÚdk²9”, +È…ääÃä3ää!ò[ b@q¤øSâ(RÊjJåå4åe˜2AU£šRݨ¡T5ZB­¡¶R¯Q‡¨4uš9̓IK¥­¢•Óhh÷i¯ètºÝ•N—ÐWÒËéGè—èôw †ƒÇˆg(›gw¯˜L¦Ó‹ÇT071ë˜ç™™oUX*¶*|‘Ê •J•&•*/T©ª¦ªÞª UóUËT©^S}®FU3Sã© Ô–«UªPëSSg©;¨‡ªg¨oT?¤~Yý‰YÃLÃOC¤Q ±_ã¼Æ c³x,!k «†u5Ä&±ÍÙ|v*»˜ý»‹=ª©¡9C3J3W³Ró”f?ã˜qøœtN ç(§—ó~ŠÞï)â)¦4L¹1e\kª–—–X«H«Q«Gë½6®í§¦½E»YûAÇJ'\'GgÎçSÙSݧ §M=:õ®.ªk¥¡»Dw¿n§î˜ž¾^€žLo§Þy½çú}/ýTýmú§õG X³ $Û Î<Å5qo</ÇÛñQC]Ã@C¥a•a—á„‘¹Ñ<£ÕFFŒiÆ\ã$ãmÆmÆ£&&!&KMêMîšRM¹¦)¦;L;LÇÍÌÍ¢ÍÖ™5›=1×2ç›ç›×›ß·`ZxZ,¶¨¶¸eI²äZ¦Yn…Z9Y¥XUZ]³F­­%Ö»­»§§¹N“N«žÖgðñ¶É¶©·°åØÛ®¶m¶}agbg·Å®Ã“}º}ý= ‡Ù«Z~s´r:V:ޚΜî?}Åô–é/gXÏÏØ3ã¶Ë)ÄiS›ÓGgg¹sƒóˆ‹‰K‚Ë.—>.›ÆÝȽäJtõq]ázÒõ›³›Âí¨Û¯î6îiî‡ÜŸÌ4Ÿ)žY3sÐÃÈCàQåÑ? Ÿ•0k߬~OCOgµç#/c/‘W­×°·¥wª÷aï>ö>rŸã>ã<7Þ2ÞY_Ì7À·È·ËOÃož_…ßC#ÿdÿzÿѧ€%g‰A[ûøz|!¿Ž?:Ûeö²ÙíAŒ ¹AA‚­‚åÁ­!hÈì­!÷ç˜Î‘Îi…P~èÖÐaæa‹Ã~ '…‡…W†?ŽpˆXÑ1—5wÑÜCsßDúD–DÞ›g1O9¯-J5*>ª.j<Ú7º4º?Æ.fYÌÕXXIlK9.*®6nl¾ßüíó‡ââ ã{˜/È]py¡ÎÂô…§©.,:–@LˆN8”ðA*¨Œ%òw%Ž yÂÂg"/Ñ6шØC\*NòH*Mz’쑼5y$Å3¥,幄'©¼L LÝ›:žšv m2=:½1ƒ’‘qBª!M“¶gêgæfvˬe…²þÅn‹·/•Ék³¬Y- ¶B¦èTZ(×*²geWf¿Í‰Ê9–«ž+Íí̳ÊÛ7œïŸÿíÂá’¶¥†KW-X潬j9²‰Š®Û—Ø(Üxå‡oÊ¿™Ü”´©«Ä¹dÏfÒféæÞ-ž[–ª—æ—n ÙÚ´ ßV´íõöEÛ/—Í(Û»ƒ¶C¹£¿<¸¼e§ÉÎÍ;?T¤TôTúT6îÒݵa×ønÑî{¼ö4ìÕÛ[¼÷ý>ɾÛUUMÕfÕeûIû³÷?®‰ªéø–ûm]­NmqíÇÒý#¶×¹ÔÕÒ=TRÖ+ëGǾþïw- 6 UœÆâ#pDyäé÷ ß÷ :ÚvŒ{¬áÓvg/jBšòšF›Sšû[b[ºOÌ>ÑÖêÞzüGÛœ499â?rýéü§CÏdÏ&žþ¢þË®/~øÕë×Îјѡ—ò—“¿m|¥ýêÀë¯ÛÆÂƾÉx31^ôVûíÁwÜwï£ßOä| (ÿhù±õSЧû“““ÿ˜óüc3-ÛbKGDÿÿÿ ½§“ pHYs  šœtIMEÝ &*`%ÍIDATxÚí]iXS×Ö~B PAA' âˆUÁòÔ¡h°jk[‡Ç‘[ZZçÛÚZ¬¬Uk{½NuöªµZ§:|(Weg !!d<™Ö÷C85Bµ÷Þó>O~°ÏÞç¬ì½ß½Ö~÷:GD8Ô>×8páÀ#A8pàÂG8‚pà🠭 ‹æâìÙ³ð÷Ào¼õJŒT«Õàñx°··‡P(äFë%ˆN§ÁÑ£qàÀÈd4i"EII úö÷ÒŒ‹›¡Ð~~~èÒ¥+¢¢Þ€ƒƒ˜=/Ÿ &“;wþŒ´´ HšA pÂ;¹ðõõxeFÊåZ å¸yóø !!»ñÝw«àèèÄ ‡—»¹ÿ:±X™¬îî¬Z•Œ™3çØô 7o^Á—¡Õ–5º‘..bèõjTT¨ðñïgb̘÷¸ÑãðÂÁ{:kÑ¢/‘Ÿ_ £Ñ??|ñER û **dغu3Nú?+ààà³Ù …¢-Z4ÅàÁ0fÌH¥.àóG Ø¿/þD„ÄÄ/0|øèÿÉÓjµ±˜ 5_ª¹uë, ”ÊrtîܵZ†ÑaçÎ͘4i*ÒÓ3!¹¢U+oH¥RˆÅbxx¸C¯7cݺŸ­[7€a´bì!£ðÆ}Á0 ôz=Žûý¥uTEEŠŠŠPTTµZýJËb±àúõëصk† †¥K—¾ç0 ƒ{÷î!''ÈÉÉÁÝ»wa0¸=ˆÁ`Ÿo€<¸_­Á’%IÈÍ̓““3ŒF#Š‹Ç#¸5w…££ù…PÈ+ ;À`0`Á‚¥ÈɹŠ%K–£qTe ˆ2YÙ í™L†mÛ¶áÈ‘#(,,„R©¬ ù\àç燾}û"66-Z´x)ƒ•µk×bÆ `Ý»woÔûß½{k×®EZZŠŠŠàââ‚ŠŠ (•J8;;£]»vèÝ»7âããáìì "z%¢Í+%ˆ³³”Jf³7o^³º6oÞL”ÂÎÎ:: ӧǢG·°ã€ÉÌÙ3W1ÿëÙ‰¼q㸸H1gNbƒŒ5txô¨f³D>ßî…uÌ?þñÌš5 J¥ãÇǤI“>ŸÛ·ocÿþý˜;w.æÌ™ƒbÉ’%ðöö†½½ý ³)88‹/†ÑhÄúõëáààÐh÷ž;w.–/_Ž–-[bÁ‚èׯA¥H"ÇÆ‘””„£G"99«W¯Æûï¿ÿßïBè)$%}EC‡¥!C†RLL?¶ü·ßöÐèÑïÒ‡~Hǧ™3¦Q]"2]´þÐe²˜3(6ö-òöö!ooo‹%”‘‘N Aqq! <€¼¼¼ÈÓ³M›6‰^¦L™BhÈ!¤ÕjmÖÓétK3†Ìf3½h,Y²„Pjjj£Üoìر¬ýµ¡´´”zõêÅ~ß… Ò;ªÅ<:…B.WÀl6á?JXÀ0üòËQØÛÛA«Õ"Àß ?ÌFÀl©Î:³<±sû×èÚ%Z­NN̘1§û%ŠŠŠa±X`±Ú¶õoôcâĉøá‡0mÚ4ìÛ·"‘Èf]GGGìÞ½‰‰=£N§{9ÊJeX#‘Hº8bíڵظq#&L˜€-[¶ÔZßÍÍ ‡Æ€*E8xðàÿÖ&=88 £ƒÁ`àÕ*‘‘µZ ½žŸO1¢„¢g¸wø|`úgïÁÕµ x<rsï##ãüs«VkPTT„òòrh4jtêÔ©Q;cË–-X¿~=ÂÂÂðÝwßչݼy󇂂¼Ì4šUPQQùóçÃËË )))uj#‘H°}ûvøúúB«ÕbÑ¢E¯L´x%‘HœÑ´©z=ÐjÕÈÏχB¡„Á`€Xl‡n݃³¹.KÂÃÛ"0Ð A«Õ"-íÌs«Ó©!“É¡×ëݺum´ŽP(ظq#ˆ+V¬€]ýö7sçÎ…Édz©i¨|¾mÛ6 …B¹\­V‹þýû#""ÂjÊÏÏÇõë×qêÔ)>>Víôz=>úè#x{{cðàÁpww‡J¥ÂÕ«W‘ššŠôôt›žä‹/¾ÀÝ»w‡.]ºàƘ1cV®\‰£G¢Y³f€âââÊEGô\{‡ÀÀ@ˆD"èt:èõzö sÞ¼y(--E=pøðavá°X,¸yó&þþ÷¿C¡P`äÈ‘èÙ³§Õó‹ŠŠ‹AƒaРA€½{÷¢OŸ>X¸p!æÎ >Ÿ…BE‹á‡~ôìÙ)))X¼x1{¯Ö­[cÀ€¸qãÖ¯_øì³ÏÊÚãåå…•+WâĉHII©îI‰ˆT*9ݺ•A{÷n£¨¨^D:´¡²²"""Ú´i=uëÖ•ºuëFÇ ¢¬êÒ®Vu–¢£{²·Pjjrƒd·iÓ& …ô¯mm)Ïl6ÓèÑ£ ÅÆÆ6šD8lØ0rss#ƒÁPíÚþýûI$‘——Éd2+[éwÞ©Qb.))¡AƒÚ¶m›Õµ;vP³fÍèÂ… Vå«V­";;;zýõ×Ù²¬¬,@ÎÎÎÕê×·oߦ€€@ååålùÒ¥K EEEY•WaÙ²e€ÆGF£‘-7™LÔ¹sgŠŠŠ²ªÏ0 9’ÐéÓ§Ù~Òh4tñâEVvŽ‰‰¡sçÎÑŽ;(22’®\¹BDD………NhÍš5V÷¶X,ôùçŸSŸ>}H¥RU³DDë×ÿ@îîDÁÁÁØŽ?ÈV:sæ$õéó:…††RDD7J?³‘ÈréÙ1ÿ›NŸú‰\›º<1g4é rÉ×ׇƒƒ=5„fÏþ˜®_Ïn‚„……5 9öìÙC<RRRlÖ©:C™8q"[VXXHvvvtôèQ›í/^LhûöíVåÔ¹sgR©T¤R©H©T’J¥¢+W®‹‹ …B:xðñ¸fgg³ëرcÏõÝ»wÇêÕ«Àê0ìy T*qëÖ-ó¶l¡C‡H$(//‡L&ƒ»»;Ž?©TjS «éÀ°jR@›6m•JÇ~ø|>ø|>;‰Äb1¼¼¼PXXˆ]»vaòäÉõ–¶U* l¦œØÙÙÕ¨ŽU¥ã<ùËËËq÷î]@\\|}}Ù1}ò;Ø’£«”([ðôôĈ#°téR$''cïÞ½€]»vÁ××AAA¶SMÌf31 C:Ž¶lYǺާcü¯¾šAMš¸§§'¹»»Sûö´vÍפQ'¢"Ê!•ò-_>‹Z´pcïcëãêêL))‹ëåÖû•\] ·§#GöÒ½{7I«U5($ÊÌÌ$—F ³JJJ(""‚Pzzíé5¡¡¡äããC×®]#"¢ððprrr¢óçÏÛlSãïٳ牽Ù4@}úô©³‰‰‰ìXdgg?W €²²²j ±†jBUáôéÓ€žH#*¦nݺ:|øp½ì¨ÚïÈåòZëéõz@^^^”‘‘ADDmÚ´¡õë×מjÂçó! áè舆Â×× ”dý.ÈüùË0vì;`&“ %%rLö$ÒpsëW××!uŽÀôéÉ(.–±«Hÿþ} Ú×p8§DBÂ\Œ ™¬¸º¸ß¿ …b±ûöíB¿~Cáç×"QÃÞ.ìСbbb999ìAX}Î+‚‚‚`2™àèèVâ}–Öÿ¤ÔÚ²eK¨ÕjdeeÕëùÍ›7üñÇìJü,ÄÇdzv¾óÎ;õzž^¯ÇÂ… Ñ¿øûû×èÙt:†±">éëvïÞýgdôÌ(ÂÁÁ3gÎDaa!Ž?Žk×®!??ãǯõÆVP(äÔ³gve!2=µ¡5Ò7ß$Qpp‡gzˆ6m|iÅŠÅd±h©W¯µÖõññ¤}ûv’Éd°Éæ[·®“ŸŸweýVž˜–MÞÞïïççGׯ_¯sÛ„„jݺ5™Lû+99™··÷3W¿wß}—ý{ݺÇ< €JKKkl“””DhëÖ?=ü©S§ñx …âQϼp!Äb@íÛ¼ìÍôôtrs{¶mÛ–vîÜYk}­VK&L 4jÔ(6›·°°üýý }òÉ'5¶]¶l 6¼ªÊ˜­"iÿþý©¢¢ÂªÍÝ»w)((ˆÐ·ß~ku­sç΀$ %%%USê~úé'Ú¿5;8ÀÚSëä4›Í4cÆŒeæ*”••±d]±bEµëUvN™2¥Zè%‰*Ç·=¥¥¥Y]ÏÍÍ¥>ú¨F‚téÒ¥N!"š:u*;çòòòêG?þx@R©è ‚ÔÚYjµŠd²GTX˜G……yTVVBš,s éáZÚ°a 9: k%J«Vžtá‰jíÓÒŽ“@`G¨iÓ¦/,Ź¤¤„†JH P`` }÷Ýw”Mz½¾Ò›Ý¢ÄÄDvß’@ÅÅÅO-"9äèèÈJšO¦ÂÿóŸÿ$///º|ùrµç:tˆm×¢E Š§ÔÔT=z4õïߟÞ}÷ÝÊÅÈ<Èž—”••±çöööäîîNo¿ý6EFF’““EGGÃ0Õž§R©($$„í‘HDC† ±’šóòòhÁ‚Ô¼ys ¡ÌÌÌZûpÖ¬Y¬7ˆ¥5kÖPRRÒĉ+£úüóÏ­ˆðÓO?YÙF#FŒ rpp¨&mWIÞ(..Ž.\¸Àzq[8{ö, ^½z=Û;=]påJºÕd%Ò6úÌɹDm‰ÏçÕJ”¯¿žMzýŸ:ú¹siäà`_¹JŠéáÃÜú.@ff&Mž<™<==I,“@ G|>Ÿ„B!µk׎¾þúëµþ'=ÌøñãÉÕÕ•¤R)õíÛ—ºvíJ'N¬q²VáêÕ«CM›6¥&MšP«V­(9ùñ!ë‚ ¨eË–Ô¯_?š6måääX½£2}útòôô$’J¥äããC+W®¬ñ9 ÃPdd$µnÝšfÏžMƒ&WW×ÇcâĉìæöY°X,4þ|òðð ©TJb±˜ÂÃÃ);;›t:uïÞæÌ™C‹/¦K—.Yµ½víEGG“³³35iÒ„\\\èõ×_¯FÊÌÌL=z4ÅÇÇÓ—_~I 4dÈgnòóòòÈËË‹6lØP‚,[¶€í''ñ ›|f³–¦Oÿ˜\\¤µ’äÍ7#éþý;DD”‘q™š6mRyH(¤}ûv¼´gär9åääÐÅ‹éêÕ«µ’Â=zD>|i6SYYÙ3•¨«íüü|š={6³ã ‘HhéÒ¥”‘‘Q£2UŠŠŠjÞÙÙñéË/燆¥ØÌœ9“kœô÷ïߧ5kÖÐk¯½öÄÓbbbhóæͤV«kõ U$''Ó°aÃj}[Ô&AÂÃØÎø쳿½ƒµÚ úä“É6 "ð‰ˆ!¹¼”úöíÍ–ý7ËHO?ý´Z~ÒÓ]£ÑЬ<Š££#5oÞœÞÿ}úõ×_I­V“Åb¡µk×Ò Aƒþ²ßY.—“½½=­[·®n ÙÓíÚµf;aÓ¦^ªñ¿þº‹<<ª0¶oïW9XFzÿý?•°Aƒr³¼Édõ :DaaaäääD %RH'NœøË~ߎ;’··7ݹs§Nõ«å3øø´ÂíÛª¥¼ ÄÄŒ@zz0fÍšƒß~;­–‡‡RR–W, мù“?Êýÿц¢*ý½®8p ˆK—.áèÑ£ÈÊÊÃ0‰DÇرcõ•ÆÄÅ‹Ѷm[tíÚmÚ´©ó ¤6oþ3Õ$0° ]¾œþÒY®Ó©éøñC´cÇÊʺôÔi8«±üñTÎpx¡¨F²²RêÑ#œ%‰TêD¾¾Þôý÷ß¼2#õzeg_ >I|>Ÿ}·$+ë<7‚^(ÕӾݰfÍjŒõîÜɃJ¥†J¥ÆíÛ·_Ù/éµk×ùùOýHB:vìÎÅH^(jÜd„…uÇÉ“¿ã›oVàÒ¥ËÈÏχ››Û+û™É'Ó°ýý}0uêDÌœ9=/Õ~ÝýiTTÈQXXg´hÑê•9þL z aaáh×.ˆ9 ‚ü`4Àçóag'àFŒGþ*àþË-A8pàÂG8‚pàÀ„Ž 8üGãÿª½$ œÒÂIEND®B`‚codequery-0.18.1/doc/screenshot.png000066400000000000000000003042231300045745200172350ustar00rootroot00000000000000‰PNG  IHDRGᔈßÄsRGB®ÎégAMA± üa pHYsÂÂ(J€ÿ¥IDATx^ìýwœž>Žïýã÷½çNðž¤çÞó9ž`BP2,A,ˆd0!A#‚JŽ’„5¢bBÉArÎAŒHdÎÏûWOuWOuMõLÏììììîûy½žÝîÊUÝSïzºª«³®¼òJúç?ÿIÿûßéÿ÷é/ù ýÿßÿÇd2™L&“YŒùßôßÿíðW¿þ5ýú‚ è‚ /¤‹.¾˜~ó›ßÐï~÷;úý%—Ð%ÿ#ˆÿàïO¿¼äPs7ø{áÿûßÿN¦†HÓN‘–¤Í/šª|Š¿ûÃ߃†Ÿô7Σëâ†C9û[ú­h—߈ö¹è¢ éBÑ^¿þõ¯èW¿Š´£½óF™ö¯¸F¿×èq.º˜.eù-Ê¥ÊUöU~‹:Hª¶Ô=¯T×Ò£%Œ*<Ê…ûNò·¢n(§/=Ü'νbÞνf»>h3÷Þívá…y÷7Ò–eЯ±H×Yþ—yFʉ{ËÉ×9Vî‰P/³º·@YvQg”ýâ‹D/¿Å ÔoRœ_|1Úí¤]G¯¾¯ÕW«÷ÿøGºôÒKéoû]~ùåôÏr½( Âèÿý¿ÿGýë_å ö‡?üL|ðA¡áÉ“' Œ'NœH?ž0;È÷ß?.=È÷Þ{ÏÊ#GŽXyøða+:dåÁƒ­{/l쌰C…ý‚mƒ=”¶ÔgoºŒØYÉcá¿γµG…m<ªÑ´»*¬?]äk³õe0yc‡ÊÍ6–mãã¤)ʉ2»c‚C‡”m·ÛtÐ(ÚÆ  >¾1þ턼QYÞrŒöÁ§èÔ©Ótút„gÎœ‰¦ò?…ð§´ðÊ_ káÙ³g%Ï=GçÎ9üî»ïèÎ;ï¤óçϧO>ù¤Õ=?ø܃w[Ý o¯W‹¾ýö[:lýùÏ–â ÿ1Iô¯NS–.Œ†N7n¤±cÇÒ#<’}ôQæy÷îÝ©G>öêÕËcïÞ½©‡ÓÙ³gO+Í|lDyLêåÍúé|øá‡}ìÖ­›d×®]顇’ìÒ¥‹äƒ>H÷ß¿ä}÷ÝG÷Þ{¯ä=÷Ü#™““#Ù©S'wß}·;v”ìСƒdûöí©]»v’wÝu—$~ˆàwÜáñ¶Ûn£Ûo¿]þ¿õÖ[©M›6ÔºukÉV­ZQË–-=¶hÑ‚š5k&Ù´iSºå–[$7n,yóÍ7S£F¨aÆtÓM7Qƒ ¨^½zëÖ­KuêÔ¡ÚµkS­ZµèÆo¤š5kR5$o¸áª^½:U«VªV­JUªT¡ììlÉJ•*y¬X±"U¨PÊ—//Y®\9*[¶,•)SF²téÒ’×_½äu×]G¥J•¢’%KJ^{íµ’%J” k®¹&ŠW_}5]uÕU1ƒ ^qÅ’ÿþ÷¿£ø¯ýKbñÿø‡x¡³´6â·Èd2™Ì‚¦ê—>ûŸÿú7]-lI©Òe¨\ÅJTå†T§^}jܤ µ6õŽ;…½öµ°¯­„mm%þ·¦6°·°»°¿wÜN·ßy;ÝÙövþ6^Øá[…ým%ìnËæÔ¼E3a›QóæM…ým"ì/l¯csa{› ›Ü²¥HW¤y»´í°ó‚žÍ‡oC·ŠüÛ´n)ÊÐRØ÷"N içQ¦[…í¿­Í­‚¢œ­„ýo!òo!l¿øߦµp¿ívjÛö.o\1FŒ;´qH§NwSŽŸ€wß1‰´o'â‰2Üv+Ý*òi!ÊsC16¨S›jT¯FU²+SveØöŠTѵë°ï°óºÝWcŒ 0>À8ãŒÔã‰o¬%ÇuêÔ•cŽ n¢›7¡fÍE]D=îlÛž:åÜKvéJÝ{ˆ±eß~Ô¯_ê׿? 8 D=ö 2ÄáàÁò|À€Ô¯o_êק/õáû÷@ ¢Añð 8ï/â# 'A"Þc ¦aÆÓÈ#iô¨Ñ4fôzBðàƒ²^Œ›7m¢Mb|½aÃIŒµ7 ·›6Ӧ͛ióæ-´eËVÚºum·á?Îna6máÏëÄÜ‚¸[¤Pìׯ¯kÛ¶mu‰´¶ n“ˆ‡üׯ£uk×ÒšÕ«iÕªU´rå*Z%ŽW¯YKk× ¿õ"ŒÈi#o¤±u+ò@~›$!RŸîÜ–Þß´ŽÞ}e‚äþW'Ð×<"ùsyBœŸz|žÎž<÷ú .ql'Â}m<}õ9:óê³tú•géÔ+ÏÐÉ—Ÿ¡ã’ÏÑñWÆÓ±WŸ§÷E> ò=üê tPp¿pß÷Êóôîäñ´kÒsthù"jS«º|èñü /Ðö;h”¸n˜‰‚@ªñÀPÊRÂhĈ4mÚ4«ˆGSP(‘¡„ Ä „NŸ>}$ûõë'n>Ü€ýåM âÆ5©üLª¸:‘fö?ªLŠ¦83iŠ4P‰2Uo´MJ(A$=ðÀ>Ô¹sgI%tAÚD‘FJµmÛ6JA)Qd #SÍ›7÷DQÑéÇEõë×E MA¢¨råÊ^çFé‚ÈEJ¥J…DŠ‰ "v#Íd2™ÌôRõËâ¨ú T[ؽ›…l%D„Q›[aWñ€B§9µÀ¹°·-aw!n‡ºÍG2Ä„1Hqt‹°Á°½ŽÝm$ìoa—[;ÝæV<ìö6^ðÎ;ÛJqv»(Ãm"½6­!†š ›®Ò‹”§U‹B ¡$D„Q‹f-©Y“Ô¬©R-[‹1Âm2½» Ž0ÎÀ˜CŒ=ã“NÔY0G¤»å¸¤uĘD„¿âL´Ek‘o3Qö† êSkRõªU¨²E`ØuaÓaו7EÆA"ÉOHt£k8©¾GßBG­oï®”Óù^êòP7êѳõÁ¸cD1nĘR‰#¬’:t¨Hƒ!r„€pBL Âh@ˆ!ˆ¢Aâ?Žá?ÐZR4‰¸Hg„O=áG› „4q$)…Ž9J¹‚F$yìŠ#ˆˆ%ŽžFR ñqÔ·o)Ž fÁ“À§èðKOÓÁ£‚Ç&ƒÏÐBÌœryFˆœ³Qîðóñi:-âŸzé)Á'éƒI‚sé¸NávTø#/ùD9P¦w_|švOxŠÞ<°x>µ¬Y]® ‚|í$,D]°ÒGBx¬‡øÐÄf < € „0{äüP‰#™Ž oÖHÎê@cÎBq–H2¾ðG\ägŠ#!Œüâh-­]‡ò¹âÈ-“Ê_G¹íÚÐ{ëVÑÎçÆJîÜ#¸÷ù±´Op¿à!ÁÃ/Œ¥£ÆÒ1Áã/ŽÂf‚æô¤qt6ŠcéÌD??xñ :õâ:5Að…Ñôà‰çGÑñçGÓûãG Ž¦÷ž#ø„ÌëˆÈçð ãè€à~q¾W–ë zçÙ'hÇ3cèà‚¹Ôâ†lùªÅð#häãÓ(!ŒÞyg7]vÙ_©\Ýæ”…—™ žxâ «ø‰E›02E„„n:ˆ ˆˆÌT=Žrn$äå|ãÆóˆs“g#_2DÞ:Qž ¢¼6Ž9RÖG‰9%ÔÔ¬—.”ÐV˜MÂLf‘”@2Ũ‹"%ŒÔlDQ,adEAKè0S¤–Ð)Q¤ #]éÂHÍA¡“Ò…‘¾| »|³D‰,Ÿ‹%Š ˆ’)JT™‚HÑ@±h7ÒL&“ÉL/U¿ìôãž8º¾4•­P‰²«U§…ík(ìcóÍ…¸i!lhj|sCº©A=jP¿.5¸©5ÀCEØÑ[„h ŽAÔæ6a“!ŒÚ(aÔB¦ƒ™ˆ)²š {,V#!4nö6ZŠ£6V°ï°ó‚ÂÞßzÛ­ÂÆþ#>„ƒŽÈjÒäY¾æH£©(‡`Ó&M©Iã¦ts#”B Kñnã1¦h‹‡¯XZç.«ÓQt7Æ#˜]ÂCZ1¹3gÈ_Ô±™ÈëæF7Q]1.À’ºl9c$DP9aÛ5›®l¼²ùA" TcŒ#”@r–Ú9Kì¤8j,êؼ•hÛ;é®öwSÎ=÷:â3Gîê µRãRG$ ñ#p?&œ!ÂR:A,¡“nBA ÁMÎ*õÃ’»¾Î1Ä”5|Øpz|¤×B Ø/Ä‘¨ ftÖ®ÂCpµ!"Î26ÇM ÌØÑ"…–µ©Ù%ˆWPÁ­ ãÌð¬ß!Þ»ÆØï°céÜá&ÓqE‘× Á£Ä}˜Š«„Üz,ÅCž"uBXíß¿ÆÝÞ”¯ZFÛr‡ÓÁà“Ãi·àÁ½O §ý.<=BòØ3#éø3#è¤àâøô³Çu}Ä—7ÎO‰0c»>ìsûP7:ñä:ž;„Þ<2n°à:œ;”=9Œ!?‘ÏÁ}‚ï>5‚v ¢\(ßöqÃhß¼YÔ¬jEQ‡4JŒûÇŒþG¯Oyƒcýÿ»¦ ea§]»vIacŠŸX FX^!€P‰"%ˆ 2 J trss驧ž¢§Ÿ~šž}öYzî¹çhüøñòX"^>óÌ3>"ÏDˆrÚˆ—ß@Ô‚B " ¢ b B ¢PIª­•@Â{HjI $ÕÍ™ÂÈEXB$Š0S¤/¡Óß+‚ R´-¡Ó—ÏÍ%;S$Š” 2ß)‚ Jµ(²‰ “º(² #SôÄ¢Ý03™L&³à¨úh›8ªH•«V£šÂö5ö±‰Íš5ö³‘Fujc¹WMª]§Õ†½¬ß€ê [ÚP&Í…8©Ua‹åR:G5¢¨Ä“ðWïI$„†´Ï7Â^CÁ¦C ytm=f®·iÓ›…ð¹YÄÅìU#Y®[nç"ÿ¦"fMDÚk7 ›ßèjÔPØ}!œÙ£Vbìp»œ=Âò:¼„Y$,³Sãø/…‘ðÇŒÆmÚPKÔ‚Nˆ9´CíÅX j!„¶½\YØuç!'hIag’¤@âH ¤š7Rºõ„Pm,ÚQˆ#!îîjßQŠ£»ôžà‘}èàpd_Ú÷x™ÏÞQiÈk·à.Áâ|» ʆrî›=n©XFnú-‚±»Ò#˜Ã…RaÇ7Sü(æJA8 ( ÄÍ /¼@/¾ø"Mš4‰^zé¥@Â?YNœ8ÑGä–&L$Ê®øüóÏKa!†ú¡¡Q_ÔõW" Oð?NÌ a™.Ô;GJé³E¦0²Í™ïéÂ3Eñ–Ðé¢È\BgÛlA "s¶H¯(Ñåsªó´½S”É¢4ÅO,Ú2“Éd2 –ªŸ}ºè×ÿ)lÄUÂÆ”¼îz*S¾UªR•nƒòzõëQc!< >nº©>Õ‚¨f ÌjT6Q Üa#a/…ý¬ßð&jÒ\ )†šR!€äÒ;Aˆ¬¦BdÁÝHÕÊ)ž„ —ö\Úu‡LÎ*„k,ÊÒPØó›„-wبØP †tKc!’„­or³°ùn¦F7‰r×oD oñcˆæbÌàˆ¯[ÝY)oéžû0VŽE0ÁãŒ9ÄxC.§ÃL×M ¨~ÝÚTó†êT5»²œ5*[Fˆ iÛ›®$”â‰$5ƒ¤f BŠú4u—ÕÝyW{º[Œ¥îã*Œ±œM³ü›eÁÍNx¾7õîÕ‡úöéKýð¾‘+–䌑$–×¹ï¿Ë%uœ9á  9 :dˆàP¹l«‚¸_01{Ölš5k–ÇÙ³gû8gÎçΙKóæÍ æ[óè­·Þ¢ùóçÓ[óß’ÇÛ·o£{îé,ýóæÍnNüÇùœ9³£ÄF, ,òz yhéàÿöíÛéñ›kѾshM¿‡iàzÁ }»ÑæþÝhKÿ®´Mp{ÿ‡h×€®ôŽàÞÝhß ntpÐÃtø1°½çrÌ=÷Y…œê|ìÿ èÿíë÷ íÜ öïBï /‘çN‘׎ÝhûÀ‡i«à–þÐFÁ ‚ëwO}••.A”cu5É~øá‡r‹ò|GXr†™¨3ˆˆ ˆ —É“'Ó«¯¾J¯½ö½þúë4eÊ”PDØ0Dº±ˆ¼å+¯¼Å—_~ÙbK~˜qR" í€Ù3üp0¥‹$$´1~°xI‰#ÌA ÙfŒôÙ"%Œô%t¶ ÐqêÂ(h¶H-¡37[cÍ¡ƒJt¦(ÞÒ¹°¢(/‚¨ fŠí™Éd2™OÕWkâèêkèÚR×Qérå©bålª&ì^í:µ©aÃ’õ„ ¸±¦°…U³åîlUªV¡ªÕ…@€v³V½ºB 5 ›oiD·4vWªF…0¢¥¡\:'D–\þQ„˜BìHä<ÌÔ©ÞCoiÒDŠ´›on(ìx}Qžz–׶\ˆ2,ókP_œ7ÂE¦†B(5ù6hH êÝ$Ê-ì½øßP¥[n@ fµ°ÜÏb­0[%DÆÞÃXq.wçÃx£e 9+u³€xרö5é†êb,P¹’3c$EQ)ºN[‚ÿñDR¬åvU„@­V­:U¿¡Õª]‡ˆ:Ýq‡÷¦î¼‹Úaö¨sgùàù°Kð½t¯û~7ˆñÖý÷?@]„PêÚíazôQ¬~r6ëÓB©õÄŽuú93Jqd $¹LOŠ'ˆ*¦r74=lŠðæ›oFqêÔi4ušàÔ©á&ݧÒ4á‡MÒ¦OŸNÓgÌ gÎœépÖL!¶p(Êô ­\-¸kÊdº©ÔUr–èÉ's½•_ ¶`Ç÷‘B‰£ÿüçzçô駟ÈóXøñÇè£Î¹g$—Ð!CSAÀ¼ñÆÎÍ n—8O–Þ̓¶›UeJ„Jˆ)‘„zª™$¨QˆC,µS3HJ aY"6jP³GXZ§Þ7RÛi‰"%ŒÌí¹•(RÂ(–(’;áhï™[s«%tA¢(Ñ™¢X¢H #%ˆtQ¤ ¢LEÉ#»!f2™Lf&Ñë·E?ÿÏþ‹®¼êj*QR èË”¥r®e ›W£f ª[·Ž°•u„}¬AÕ«ag6 âË û'ò°‡°ÂVÞ ìg-VŠ•†õåÌ<Õb¢®°µõ…íÅ;Lx¿" ‚«;FÛm„m(ÁMÞòw¤)X}”§–(W-a»#¬+„\ýºu…xyÕ­'ÎE¾µ…©UG°®I7 ÁÔ¨‘³uxcäçeQËú0³ä+ÆBÄÉåt¢>uk×¢š7ˆ1A•ÊT±|9*SZØuˆ"מ+êv^H`<‘„±Ee!P«ˆ¶­Výªyc-Ñ–Bø q×¼%Þéºîã&츇íÆ; vèàl!g½Û·ï@ïîDÄ€üÞûîc°.ôÐCÝèÑGœWEztB©§3£öéÝ×Yrß[rÿ«c¬ê#Æt½ñj –8ß½{·¨GÂF ¾ü²ó0Ý|àÊí2ŒÃH8<Èwö«ÉÛô7¦È÷‚ð@Ëë^Ý™px“ ˆ‡cAˆŒ/¾øBÇ'ê«¥&Fù#®ÊãÍ7#Ä{HÃëT¦wçL£å]shùCh…à*Á5Ý:Ѻni½àfÁ­w¤í‚o?Ò‘ÞyônzWp¯Ëý’è@w‡£:vò•A•ãñwÓ¾G:ÐÞ‡;лÝÚÓnÁwº¶£]‚;ßç[»u m‚[D^›»ÝM¾›Ö?‚²teêL«W¾ýê‹T¿Ä¿…8:(õ‰³Ÿ³Ä>€J½ñÆë4jÔH:{ö4}óÍWBobémúå—óÒ_ǹsgÅ€½häçå¹ZF‘€̬(a4eÄô_YY”VîM/ UjN5êÔ§$'õͦ¬ì¾4Ñ⧨ïD„UùÉ<ûЋJU‡ .ÜLBlᦅ@ÂM¥€¸Ù °„í€4µÄS°øQ©Ù#LóböO40k¤Ä‘¹„.ìlo .Š@Ûf JéKè’]>§„‘êø”02g‰ÀLE©DŠ6Ìd2™ÌÌc¤ï¾œþ!ìÂÂÆ\]B ꯃ÷²å¨¢°sU«U¥šB Õ Œ*Wt6([šÊ aP6ö«)„½¬^㺱VMªU[ØTñâê,¿võFakëñ‘tÓM åòv ç&6zh@ `£Ýåí`mØèÚ Vu8iB¤a«¦ \ÚW£ºWF<ܼÑeÍ"ÿ è„]¿nøvP!ª0pÆmõDž²L˜qãgv©)5U âI¸Kaä.+ÄìÞ5Âr:#G•TvÿM‘¤f“t*¤–ÛùR5ц5¨¶(÷M Eùš6©µã"Œ‘îc&¹›¶RoƒY.g|„m˱ë_Û¶í¨}! :åÐ}IàÛ”Q·®Ýèánbüð£B0u§îrf©‡L‘ïiöêÕƒz ÷îxãæ‡ÏYXNWJÔcÃ{î¹W¦qˆâ>(þ‹ãÛî¸G €0¼£í}QãôGyXäÙ•&‹q'îƒeË–Š1%ÄÞCôP×®ruÞEê&ˆ4ÔGjqŒÝñí*µ˜éÿÚAËëÑGâñQ1†…zÿíbÚðÔhšXáJš,ørÅ+èÕ WÐÁ7+ü›¦Wú7ͪô/šWé´°ò?hq•ÒrÁÕ‚k×{üm¨êpp£›|ePåx¬aZ—ýZWùrZ Vú;­\!¸LpI¥ËE—˼æ ήüošQùJšVéJšRùjz]ðUÁW*]M+ô¤Ê¿ÿ•\~8fÌh=ÊÙpmäÈòC¾ø l(qÔ½û#â"¿-ÔènÊɹ›è&ð·Éu±Ÿ|ò± £ã½÷ÉNÀtÄDÄDÄóÝ+JÒv”3[$ENV6õŸ<—æΦ¹Sqrÿ*Bõ£—,~ Vc;ü—L¿ßK±5¶=DR{ëžÛ„U,êS˜­ÂŒ“H€˜AÂBÔ³GX^‡ €åuG˜=Â.fpcç:ˆ#5sKÅúf‘MéOÀ0ïÅEDŠJ¦(ROtAdEê‰R(Ò‘EA‚HE6dRDAÂH:‰Òf|™L&“™™Ôûo؃ÿû ºJØ¡׊A¼°_eÄ`½BÅŠT¥ vQsÄ@9!ŒJ—ƒûëJÑõØ|va±$L-·BªŠ•Åy¥Êî{4¦b“š˜aªU[Ú`ØbÌLթ㈟šÒW‚ÆYÆ.m±¢ˆ_i‹t1kSE0y€U„®Šwu0ÛR¥ª8¯BÙ•1Ó%ÊQI”'[¸ChÁ$í½²ù˜õÇR¼Õ©ëˆ¥úÎÒ{¬4ÁŒU=QÆZXJ'Äb•l!+Ûï.§+U6ݱã% ».Ý\‘¤ %]$éBI%0¶p–ØU–IÍ9[zcÖKŒ{ÄØc!l!7‹ã!,ýÃöè5i‚íÎ[R«ÖmäûUwº³IîΡ{:c Þ}tß½3BÄv‘3KQWPˆ ùÑüwEG—.‡ýßç.å{€Þ~ûmY/Œ{붗c;õN9„c÷? þÃa1VT¼_þ¿Gˆ¯1Þ/´hÑBùŠFçÎ`gêŒå„÷t–ï#!>Æü ŽmÔý; Qw/òuQǼ_Œo'RKEëÇŽ ç¯û;½(8ñú¿Óäëÿ½zÝÿ£×¯û½Yúo4½ôÿÑìÒ¥ùeÿ—”û_Z"¸Bp•àkËÿ jPÏ—¿N¸ª_—V—ý+­.s­\)¸´ô¥´Xp‘8~KpN™¿Ò¬ÒÿK3Êü¦–ý;M)ýwz¥Ì?èeÁ—'•þ-ëó0UüÍÿìßO#GŒ Ãñ‰ g—i|# ƒ %Ž  „Æ q!;ОwfßFÿùy«HPÜݺÈ0:V¬X&Õ7Ècý=#5kôÚ3R%£Ç¥t'3Q/ ÚÄ’âäBUéO“-~žHšÜŸªˆüÚ#‡/Q¿ì,Êî÷’á¡MéTâ3K˜=ÂÔ#Ä ÄfËÔ& ˜ºÃ ØÅNí`§v¯S3GXV§6b0Å‘EJA™ï)Qê¢H #]éKèl›-Øv KÅò¹DgŠLA”Ÿ¢ÈD,Š˜L&³øQïÇ/¿üò½#ÌáÝ£Â^aFv ‚,SFØ8!ŠJº3$× Qp-ì[)aï`û°)f?°­u|3LÂ>Â]ØÉrrÀ/„’°­xŸ¶6·zuGA€UÖ>ÊÿŠ®Ý-´%± Í)W„Â]RÄ-/âˆÿåÊÂVcU‡ë.Ò‚-G9¤]wm;þËr¡LBˆ¨qƘ‘ªÍ„0SÛv—¨¤+Œ`ǯ”+?„—熭7“¤‹$Œ/ÊÊY$Ì $ʦv®ƒxç‘œíj$Ù¨¡÷!‡Ù·úõëɱÐÍBHAD5k†.œàÊï< !¡Ô¡½1 bðm' ˆ{ä»Kø÷˜î»ÇBx‚÷}œYg&› nX®¦Ò–Ù½ «‚ð¹ó.9þŸ}öY(",f¹LBh='ÆšÁ Ìw˜_ðÓÂ!þûï¿Š+ãæà]-Qï{ñé‡xu¤Çe¿¦õãFЄë.âèr!Ž.§É¥/§W_¢äÍ2—"evÙÿ£ùåþ´Dp¹àJÁÕ•02ó7ÏŠka®Bi©àÁ…B|½%Üf‹ÿ³ÊüM—âèrz½ÌåôJÙÒË‚/•ù§Gÿâ¨Uüíÿ'7Ì2d0 ~ÌÙPï‰>}š~}ÁáÄѸqØžz¸hè;„0Ú*ÅøÁ‰EbÀz… £cæÌéââß)! Ô®tê]£×†ÝNÿ•u³F!J9;b¼B«jËß²ªÐ€WœÝ8L? Ô³ª  —]!•Û3DÊ¿#åÂ=·£È¯åZTnNÄŸ<7—:ˆ8r•_.µçíǹk\{-]Çå–³OBÈ´óü*Ñ£Ï(q4–º”Í¢2÷”ï\Aai.ŽÔ·Ô¦ øÁ™KêÔº èô÷ŠÀxKèl[s‡ÙlÁ&ŠÀ¼Ì¡CLÅL‘D™ Šl†–Éd2™…‰Z¿.ì–Öýë_ÂÞ\q%])ììllZ©R®=“¶ ö "Jü‡€ìœ;ð/%XRÄx@<•ŽÂvB¬À–B0)Ñ#…”°§ÊŽ*–Äáw¹éF=ˆ%n2›<LJJ„”¾Þo·¯wÏ¥°ó (gs6¼_¥v¥“›/Èö€]‡ íQ)ÚÌ´ëA"ÉJ²¬nùdQJ· ²1+V­:Õã̼a<ƒ7̼ÉÙ7ÌÄaœ#Æ8‘Y¹zÔKE6£³I­„PÂŽ}BÐÜŽ÷— j\ÑÔN›öíœÍ²±½¹þ>ˆ1Ü–-[å¸e„‰bì†1Üt¾#u'>œ Š1žHƒþS§N…"ÂvìˆÏ½˜¼›žyö9ÑUiþ‚…¢\Gÿ»ï†€rľ»†{÷ÝXÍ„ÏÌà{œøäÌ}’/qÔýÿ.¦µOŽ¢ ®  •® I‚/ ¾Zù š’}Mœ.8[ð-Á‚‹ª^A˪þ›VTû7­ªö/f¹p>èfg‰é¾ªÚ?ieÕÒŠªÿ¢¥‚‹«ü› Ϋüoš#ò˜%8=ûJz³Ê•4Eðµ*WÑËÙWÑdÁ‰‚Ë>Jÿk¹aÆÀÎöìýú9ï¡õ«_ÅGsçÎðær©\UéÛ¯×{âhåòñb \AnØ ïÁ}éÒž0s„Ížy´"eUìA/a„YÌÀ@@ü`[§îG–W¤z‹^XUˆŽŽô¤8~Òç÷$Ýý_B¸ç2œ)”:æÒËüîŠÈÓ™y²‹#ï|òª"ZÿɺPr–ã9Kó²¨Ý³¤Ðy§8¿}¸|§ê¥qݨ\V+êãî\§‹#µ¬âí q„)Rˆ#<À ;Ô©etJ™ËèôÙ¢  ‚–СsPÂ(–(җЙ³Eå5Qd¾S¤:2Õ™'#ŠâÍåEÙD‘.r’¡ÝÈ2™L&³ð1Ò·cö 3Hÿ¶öèJ!‚0øW‚èJÏFýËùsØ.Ø1&)Tx7Žkã ¤q±$ì¤& Ôfj³/N|ØKA¸AˆBHÂÍ Ü•›JñÁŽ]VâDCØ¡›$ÝÿáR³A®½ú—M/Ž;æ¤Á…÷š®ÀÌ”+ 0CåØDçܳ‡*½!¯¸"š*?çܱ©’"/åç0"\UØ+¯Œ!bÜÿÞ â"ŽÊGQË+’nò"IŠ2wÌ¡f‘06Áq1~Á’?¬|w³ªÊqŽ#’œ™&lFq‘z— ã'ìØHã*Œ¯¤`jÚLÐÙb§[à½&9&ÃÒ!nî—ì”ó€dNç£8þù‰TµzMZ´h©ßïž.tϽIÞ{_W8ï,ü@óø7Ì}÷w£ûx˜î|àÁG<¾8ñeêõ¯?ÓúŸ¦—o®F¯¾&8EpÚ-‚MªÑ,Á9M«Ò<Á‚‹[T¥¥-ªÐÊ•ieËÊ´Zp­­²åÿuâ?å/¸Fi€H\ؼ*Íwó›%8Sä?½iuQ–ê4¥quzlv#­xb(Uýã%ôÎ;ï8lôˆ|zè¿ÿû¿íâÈù`–CàÑGâæ9¹;v¡ÃÇÎÚ´iIk×®¦îÝ»ItÁ¿¦gŸ}JÎ"Í;‹Ú·o+ãb#s§:ý# ˆ£È²ºh%Žr#"'2+ô²GU¼ì?’ræG>Š“i@Ä™,ŽetsÆyç“ûcG¼þô’û’Î1í„8j7FÖïO½ñƺ]Ä»mÈj-þ·ìï¼s„vÀ6Ø/}aI¦ðð¾‘ÚÊâëTÕ’:}ÆHF¦(2…‘>[„ºm š)Jô½¢dE‘Fz§‡Ž0Qä‡>Ã@iÄ ¦Z)Ú *“Éd2 ?}ý½f?âÙ—ýátª0ι߆EÛ¼èø&õøy¡ž7¨‹8üwf‚”›n§#ñuÛ­l¹¢JÏ&’L¡¤RD$E–ÚÉ1ˆ‹`<⼋Yþ'Ç/â¿#–œ±Œœa‚PãˆHª!ÇEÎre*uy¨»9;= DŽÃN9zÌéÜÅÇÎ÷@¬@Ð@¤t“¼ï~ˆ”G<>ð࣮XÁÿG…`y…n¨Y‡–.])òëŇºö”ìÚ­—GåfRÓí‘>ô°Á—_™B½®þmzy½q[#zSpêígÞÑf Î|«íM´¸}CZ*¸¢}ZÙ±­¹»­;5  !¸>À ñ‘Ò—»ù ¿ùw5¤yw6¢Y.§Ýј¦ßÙ˜fåÜFËž{Šþãån‚x­ãpÅ@q¤ #%Ž4¨KS¦¼&mÀò¹¿þõ29£‚ŽÍ™3S ²«H?ˆÛnuÃïÀ»A•¨×ó‘Ù£qœÝêœ÷†"ï9378wÄŒ·ƒ|—Hœ»»ÕÉë0£3)ZÄDïVçlÆ –ÇÍš5‰úâ¼Ý²,O@ôˆ´±\næľTYWî;ÑÛ€AmÂ0ú.î®Ñ®0r¾wôÔ#dܬrѨ矗³gØʳFØÊ‚ÅÃÔNuXRq„]EðZN§f”(2—ÐÅEA³EɼW„FÍé¢H £X¢(h–(¢Èo¤úŒ]´P&“ÉdMÚì€äåXrgqb¬°[eÒ/ÍøÿpiºQ·¥ÊÆê6Y§n‡MêáLŸˆHý3I†Hr‰q ˆ1K”XT³Jj6IIêÁ±\v罟T7P,©Õ: ša ãB„Ãî /¾L=z  û…ˆ¹OpèÒ"Fgˆˆ]î-‹âÃö•|õµ7¨v›hÅʵôH÷~ôhþQìÞs€(ÇÀPìÙ{d¯>EqÊÓ©ßõÿ¤-o¼L3…à˜Ùù6šÝ¹ ͽ§ ½%¸à¾6´XpÉýmhÅmhÕ­iM—Ö´î¡Ö´¡k+ÉÍ][Ѓ[»µ Í’­i}×Ö´¶kZó`Z)y+-}àV‘÷­´ðÞ[iøÀ´à‘δ&w$=3p=zSG¹ÚcqzºÈ'ŽLa¤ÄQ¹r¥iãÆuò8Ÿ}ö‰¸ZÓe—ý…vìØBûÛÿJwlåm{ïèµ×^£çzTrD„¢&άÍdêäùAÔDft:üWĽ}{Ìêô£IJðøâa'ºIR Að8Û…kþÙ}i’p‡Ÿäí"~íÚÉMÚqDЋ}*ûãVîM¦O§QmÅqÛQÞ6Þx×èå'¦r"LÙ.c¼Y#soÌ©%uFøZ3fðrŸÚ„AŸ1 ZB§„QXQ¤/¡KV©Î'Q¤w|`QdëhM긢­£·Di3œL&“É,&´Ø……aì~6&69Úla¢´ÙX›-ÃDE_$E>&«‹$9›‘C(™"ÉJ?)¡¤DÆWJ(9Kðð]G(©±Æw?â3Œß¦N›Nó,¦™³æÒ¬Ùóhöœ·|œ3WýŸ/9wÞóÞZèã[óùˆtÁFn¡Ã‡ßóÎ,\Å…‹–&ÄE‹—Y9¬âÕ´ÝjÚ2yù9Úñ²Ã‚»ßyÕáÞן‘Ü/xÀåÁxhʳV< ¸ÏåÞן¥Ý¯§Ý¯Œ§wßVœ2‰–NOãz÷ ›®þ-^¼XNÜàÉïD ½ƒã(qdŠ"EàÕW_7ì?iÿþ½ò<ÿùÏè“O>7ÇMtß}¥Þ³Q³GØÎ[Ÿ=Â, f[°6¶šA2©ÏÖqƒˆ%o>Nè-g‚0ãå'ˆ²€(—Iˆ P}1XQ #Ô 1”Í*K÷t6bÀ¬–Ô©]ê0k„-¼¡R±…7öŽÇ¬‘ú¶¶íÆŒ„‘¾„D‘>[¤ #Û.tA¢H-¡S¢Œ'ŠR5S„Ž/H©N3Eh5”L&“Édf0mö,Úì«ÍÛìµIÝÞëã]$éBI%Ì1†)’0.QBI‰%5†‰5›¤ÆBa|¤‹$P¥0®R³IºHÂ8 ã156Ã8 ï“ã=üPF³Í‚ÚÃl½]‚Ú,SãµÕVí6b÷ÁXÄVé±ØöŸ¦›ÿaãËÿñjòK©É?/£¦ÿºŒšýû¯ÔìÊÿ£æWþZ\%xõß©å5§Ö×\N­KüÃå?© þ{¼6rÜR°•Å l!â7¿æÔìêË©éU§&"Ÿ[ÿûÿèæý/5üç_é&Q°]ÉÐàƵiÅŠR›Ø4OBâøâ‹Ïèûï¿sÏ‚ñõ×_Ñš5«è—_œì°;›Hê{GHØÖ3HºHÒiŠ•`±Ñ1Ž ;¼™ ;h„pC9!ÜL¾öÚk’(³IÔïSaf¬K‘f‹>r#´ZN‡w°;Ö6b9FXN‡w ŒÔr:]Åš-²‰"]ÙDž¨Ž@Ÿ-R¢LT™ÂHD ú!ãGmþèAÕ!èEõNÔ;jE[Çž,mƆÉd2™ÌÂD›}K–6»kÚf›ý6$À `Š$5ID$©±Æ=j ¤–Û'‰$%â‰$Œ×ð iýúõò=$Å7F›8(b·;“[¶lñqëÖ­Qܶm›•øîR,îر#%ÄÇoSÅ;w¦œÐ"6½&,Ž’fKð® –•©%v6‘„Xþai0±ˆüA”Å$Df»lDùAÔåùQP)¶šQwQWÔyäÈ‘ÞR:}ÆHÿ®ÑÝîÖÝêC¯úR:Ûl¦nñãSÂ?JÛlQÐf ÙQ„§'ª£ÀS]éÂ(™åsº(2…‘êY1™L&“™Úì]²´ÙaÓVÛì¹I}< ÔØ!ŒHm"IHºHR³H >‹$’Ô˜ ã+Û,¨¨/µSc9<ìÆCoŒñ@õ^9Æ~xÇ­Â-Âñ:Ƈ ^»ñn:ˆ±#(¿·Ô¡ƒ|Ðb\©¯m€99ø˜mg1Å« 63‰‡øAÄ86ˆxeD'fÑtbåTb¼l™ÙhÓ1‰0mâ;³A@$`E‰$̪@$a£ìd§ÞG‚ÐÀ“a‰´lD>A„XCYLâ])E”×F,D}P/õ-#¼_4tèPïc¯ú;F¸Ø¸ápSâ¦Å ®fŒðÃP/˜³Eø‘é³Eê‡âÇï{EAï‰"Õ™$²|Nï´tQ¤wt`ªhë´“¡Í0™L&“Yi³ƒÉÐf—AÓ†Ûì¼I›Hó*’‚f’â‰$µÔÔg‘”HR7èã2} ã75–S" ¿•H¸O‰$Œ•H² $%’’H )@%’Lq¤hG M)ÆHaE’M ©H¡ÅQ1È×1‚¥bØ… KÇðˆ$ˆ,/ÃLÞÁP²3,¹ÃŒD†ð Kˆ‘‡4 Êaå "ʤ1„ºA¢¾”3EhìŽ6Â…ÄÍ7'ndõŽ‘Føa˜ÂH-¡SÂH-¡ÓEQØ%tº(Òß+ÒE‘FèDÀdD‘zÒcvl,Š˜L&“ÉÌ<Úìb2´Ùiдé6»o2–HRBI„Ijl£’M$½o©)’0^S T³HJ$ $Û,R¼Y$Œ+u‘d $]$eêš%,ó,ŽÌŒ•@Š%’°´ ïÝ@$a¹ÄDÄ’AÔňHGé*bÖ*Q(Dˆ²ê„ÈQBH‰!ÔuEQˆ"´ .nÜp˜ÒÄ͉›X}Ë7¾Ú|?µ”?"µŒNý°ôw‹@]©#]ái‡š1 FêÝ"ÕI(q„§,jÆH #EÕé #RTÂHGŠªCS]Xš*hëxóB[Ïd2™Lfq¢Í>æ…6ûm³ó6êãS)ª1‡FŠº0RTImtqboÃ5¦2’¾Ìã25FSIáÔ2;%’ð ÜH Æ„ Ä‘HJJa ê³GJÙf‘”0ÂXT-±ƒ Ò©–؉¤ QdŠ “ñ‘)z¡)Œu†ž8ÂÇŽpq–zB6%Ôg!’ð® ––A<`FbbIÍ*Ah¨Ù%]„„¡*ºX‘~‘¿4:Q6E”D¹AˆuQ/EÔõFýÑ.¸Ð¸p#)Q„TŸ-‚0“üÔŒ‘š5R3Fø!˜žñ# Fø‘š3FøcZX-¥ FŠúŒ‘.ŒMq¤ $])ªLul¦@ŠE[giëh“¥­#g2™L&“i6ÉÒfÏmvßF}ü`Š"E]éã])*¤Ï éã  ¤ÆRW™3H`@¸MáÔ˜N‰#5{ªwÔ R˜Ù#%ŽÌ™#] ÅFúŒ‘M ™bHg02EP,&+B¦F‰Eè!ùØdÄQ<ª$E%”Ôl„D†J4)ᤎõp&•`1©ŒIär˜DùPNÐ,?ˆz¡‘ÕEÀÅQS]du“à†ÂÍ…›7$nRÜ´¸y•(RËèÔŒ~AÂH½c¤ÏÙÞ1² #<éPÂH‰#üà•8Ò;5cdŠ#] ©ŽF $])ªÎJub¦8ŠE[ÇhëTóJ[çÍd2™L&3B›ýÌ+mvÞ6°QWèÂHQHúxEF6q¤fŽ•8õÙ#Œ§Ô ’m‰HŸaœ†ñšš=Â8ã¹ 4{„±"ÆŒŠC-«3gô™#]éÔ’E¦8Ò…N]éÔI] ¦ðuÑDS)šš$F‰#% ‚h  ™p¨ÒR3JJ0%K=xeE9TÃÙY]u±ÔET7RËjjQ‰ uc)U®TºEj¦j75žèÂÄ?›8ÂT¬>k„\8•8•8ñ·Íé³G±’¢.’ô'4ªSÒÅ’ê¼âQïðmc^hë™L&“ÉdƧͮæ…6»oØhŠ!Pè¢ÈÃÄFjLdÎj,…q•ca¼¥Æ^6q¤’Gji.ŽÌ¥u 9sdÎé³FŠº8 ZRgDæL‘I}¦H@ŠAÂG;ahŽËuÁ‹¦æm:Ôµ‚ž8úÕ¯~E§N²Š¥K—Ê}Ùƒ¸nݺ¤”–é†zº6®]»6&׬YããêÕ«=®ZµÊÊ•+WJâcRŠË—/§eË–I¢í—,Y"¿Æ»hÑ" .ô¸`Áš?¾o½õÍ›7Orîܹ4gÎØ/´}$×üðm¬ïFÅúT¬ï=¯Y¶O×iÛ.=,Õ¶êL&“Éd2‹6m〰´?tÚÆ/ ã˜c}\¤—̱”c©1—>Sc35VÓÇoÏ©±ÆyæØãA}|¨1Ž1¦TTãL5öTÄxÔǨ:Õ4Ç·úØFsÌlÒ6ÎKÛ>YÚô‚"Ú̦{ ‡ ‹ë.¯»Y™Ž2¦‚AåÌ”ëÀd2™L&“Édf?üä»(qZÅ‘Œˆ£ÏâpºpWîXîF˜åÃ…`QKß \Tœ“Éd2™L&“Y„$ŽÀÐâhß{ŸÅ!Ù EÀ$å^z­Œu,8é.*Ýo‡sœ®N¥Ë §EQ~;¨f”¼2‰2ªpˆT®¨2«4£â‰4… ’~¢>#Ï«cåž2ºùYP¯£ëdo &“Éd2™L&³hñÃOS Žöý<§S+1¨î½*–»v¼ ƒpcPët#n”鶣¢üÞ¦Þe,åpý_¸5‹ZM²ù™eö§>^•îÿ¶/C”{`ëq£Ó‰Ô‰Éd2™L&“É,ZüèÓïó.Ž¼ÿEÎpÙ«c¹kÇ«GH¡1Á6Ü)DÜ¿d¸ûò3˪Ç1ýb—y„D¼xnØ¥ý+HU¶¤~”{`ëqÍtÚÉd2™L&“É,ü賈£CǾˆÃÔZ ²ûˆAv°»yœE¥ìÔ¦ˆ“Û ÒŽ^ôÜ̼ŒsWD8áõ2šçN¼Ö“]¿Ðñ"\6 BŠêlOßVÞèüb„ñÕ‰Éd2™L&“É,Zü8âèðñ/ãp¦p÷]Ëݳf•soÉ×m3µxy¤H‘´[OÖýr´¾Í™É1ý'Þ¦—'V™õúšõ×Î}eiGÝ|òF3¿wkëaœã ¶`2™L&“Éd2‹?ùü‡¼‹£÷N~]„8›ÚdU¢~ël~ÅÜL&“Éd2™ÌâÃO¿ø1ïâèý¾.BœM· Aнͯ¸‘Û‚Éd2™L&“Y|øÙ—)GÇN}S„è‚ëm~ÅÜL&“Éd2™ÌâäÅÑÀ=qtüô·L&“Éd2™L&“Y¨ùùW?yâzG×?âuqtâÌ·L&“Éd2™L&“Y¨ù…!ŽtdG*_}Çd2™L&“Éd2™…š6qF‰£Ó§Oû€›6m’‘­ØÁd2™L&“Éd2™…žÐ7Ð9¦ö²Š£H*qôÅ_0™L&“Éd2™Lf¡§GJóÄG*‹#&“Éd2™L&“YÔhŠ#Ð*Žô ‹#&“Éd2™L&“Y”hG`LqÔ¿GL&“Éd2™L&³HQ‰#è]ÿXÅ)"Ò•W^iM”Éd2™L&“Éd2 uq¤èG]t‘<80¢œ@GL&“Éd2™L&³(Ñ&Ž@‹8òog‡ý¿¯ºê*k¢L&“Éd2™L&“YØJá£G=ö˜[¶l¡«¯¾Úš(“Éd2™L&“Éd6ÆG_|±GC† ñ8xð`)ŽJ”(aM”Éd2™L&“Éd2 ㊣ßüæ7töìY>|¸ä°aÃ$·nÛF×–,iM”Éd23™/¿ü²¤Í™yäëUðäkÀd2‹ ㊣ßþö·R=þøã4räHÛ·o§R×]gM4ˆ¹¹¹Ô³gOêÚµkZ‰<‘·­LL&³øƒ<ÀæÇÌ<òõ*xò5`2™Å…G7nŒ!Ž~÷[:wî3Úã¨Ñ£hÇŽTºtik¢6Ž‚êÉ'Ÿ”i?>­DžÈe°•Éd/ò@¯p‘¯WÁ“¯“É,.Tâ¨_¿~vqô»ßýNŠ‹±cŸ 'žˆpÇÛoS™2e¬‰Úؽ{wúè£è§Ÿ~¢¯¾ú*­DžÈe°•Éd/ò@¯p‘¯WÁ“¯“É,.ÔÅ‘¢_ýþ÷tîC!ŽÆpìXz{çÛT®\9k¢6byfqtѲ筇iÛ«Í­Ü ¾Òœ¶¸ÜürsÚ$¸q²àKÍiƒàºI×LlN«_lN«W¾Ðœ–?/ü§võå…¼Q[Ù˜Lfñ"ô ùz<ù0™ÌâB%ŽúöíëHž8ú½G~ø¡|g—;NrçÎ ‹£Ÿþ™¾üòK[_iFkÆ•òq58¶­\ùD)Z1¦-\6º-UŠ–.~¼-YŠŒ(Eó‡—¤yÃJÒÜ¡%iö’4spIšñXIZülS_^țœÉy W¸È׫àÉ×€ÉdêâHHÑâèIG)æ‡8 FK!Œ!Œ Q¤„Ñ[E‚s Œ„(š)DÑtÁiKÒ§“G¨[AlÁd2SÃ0°ð@¯p‘¯WÁ³¸^ƒýÑò•ëhƬùL&³¿cüžm¿s“¦8R)¦8ÊËÌ‘î¦ÄD¸~ü ´sFÝ4ž>>º–¾ýü$ýüÃ×ôË/ç%Çß|v’ÎYKק S:Ñü1ÕålÑ´A%iꀒôFÿ’4ÿ©¦¾¼Âˆ£‚Ü4‚Éd¦†a6`áÁvá"_¯‚gq½'?øˆ>üä YwƒQxßñ‘cg¬¿s“¶wŽ¬âèɧž”G$%/Ž>ÿüsGž0z¢mžÜ„NïC?ÿô­[•øøùÇïèØ®¹´ø™[èM!Œ¦aôz¿kinn_^aÄQAnÁd2SÃ0°ð`»p‘¯WÁ³8‹#ƒQ4:qt‰.Žriܸq‚c¥8*[®¬5Qmâh‹Gj ¸ÙcBì|ãV!<~úáÚ:ï1!ŠJÒk}¯¥Wú\K³Ç%.Žà'϶“É,<Äï8Öï=Ì@o¬èë¥-fÞÉ׫àY\¯‹#£è Yqµ•÷%—\â‰#ÌAa[ï·ß~›Ê–MLá‰î§Ÿ~êqóËͼw‹°áÂêgªÓÑ-é›OË¥tÿùÏ/nu¢?,±ûê“ã´wÝDš1¼½*DÑ˽¯¥É½®¥™O4ñ兼È#ˆ(ý]%&“YøïaHØÞ7ß|È~ø~üñGúî»ïäyaèV¦âz™äë•‹ëo†ÅƒQt—™#»8r—Ó©ïA•)þ;GAâH߉nÝ„†´ê™iÃË·Òî…éðÆ tbÏ<:sp%{o=²NXIÇvÍ£½k'Ж¹iñø6BU§ÙcÐd!Œ&õ¼–&ö¸–¦I^ÙüÒÊ#¨B…´Óæ—Ìk~é.oa'·wrTõQÿTŠ£Ùó—FqëŽwhÒ›k¨çðôÞ±Sôí·ßÁvÝ{y½^àœËhÁÒ•´|ÕÚB30O StÍ2æ7“æ{ŃQt¨8 Ü­NGXNq4fÌhÚ±cGBUâè“O>ñ¸á¥¦Þ.tK/Eû– £m¡]oõ¡¥OÞHo(M ÆdÓ±5há¸Ú4lmš7ºÍžMo ¼ž¦«B«_ïB\K›ç•ÂèE!Œ&”=/× |ç݃´ïà{täè1Z»~c°8BÙõ¾Z²Øi„K–ùq]㥙¢<Óö›±^ƒv4CÕC¯OŠê‹ù.ŽåPÎ"÷ØÄ‘\ÊÎÎ¥#î)ƒÁÈ’GQ»Õ)q$ß5’³FchôèäÅÑÇìqý¤¦RÉï(Eï.*7XøÏþC¿œÿ™¾ùü9´šŽî˜N7N|™ŽlŸN'÷­ />zŸÎÿü£ û“ˆ³qÎPšÐýZz^£ñ\KSFÞâË+¬8B8}Æ)¯Ü1¬¼èØï¢išÛ´»üç&§ÝUž†íÇ;†QùòÃh‡%L*éågñ Å4•3c˜Çúr{'IUïõ÷{Ov ÷öîýtüäš³dÕƒ¼N=§ÐÙ³ç‚ÛŠr׎ÚU9ÐNà/)†)W>”=/×kϾÃtðÈûtôØ 1Ð=E›6o‰-Žò³Ýó#ýxi¦(Ï´ýf©O~´§Á|GBeeeSn®G¹B ˜kÈ G FJ‘qF6d»Õ“³FFcÆqäΕ.]Úš¨6q´vbSç»EîÇ\W>wÛ9CˆžÜjÄÇùŸ~ [fÒ›#ÐóB=÷ðµôL·ôڈƾ¼GúŒ“ÿé•Ÿz8;·ÑÐòåiè6›Ÿà¶¡T>ËôŸJm³ÚÒT7’Wù¡ÛÜðÊÍ·òm©­¶íÔH¼¶S£ý=÷¨üÔ±Η§ gº –JÛ¢ÜõºùÓ–áeÙÜx*n¬t\ÿ¡mái£H}‡¥½e¼m$Âl kägºË²%r]ô²ºe)í-ÕnQi©ønÁHº}åôÒÒïéè2¤Zí;t”Ž<-g¾úújÛíªwÇ3´bý~:òÞ{Á=—;GT  #vÒŒvYò¿t7vÞ¹;ËäÖY†‡Ÿjœ¶mÛF¥J•²&j£M-ߘÞ¢hîÐ’4gHIÚ½tÜ»˜V½t'½õDmšöXYš9òZøl+Z6©#-™Ø‘æ=ÝŠ¦ ©N“z—¦×× Y¹­éÀÖÙ´~ÎãôT×ô¤F¹]JÐKƒ“GwäÈ‘(êŸÍßÊå}©L™¾´ÜæÀ‰m²¨ÍD÷\c­ ÛÐD3Œy¬»IN¤6Ye¨ïrçÜË/*œÅ çfžz8éo)£Ìÿ-áIÇ /I[o»å}ËxqËÜ{o$žž†y¬ç'Ý‘¶›7Â(ÆŠ§Âëa4‹öî;,ºÝ‚òVç6ű¹ëy Æû½'2Ð{ÿø ê2pº|ê½kïIêÜëMjØn<-^½OæóÞÑ÷ƒz`ÔÎøúÜó cuîõÙ„ >ê§ÂÚ⥯ŽÍxªÜó47ßÝ©™^P¸˜ÈõZ²|µ\BwJ1|ï ï }¥móózEÕÛOÕÞQ³>zý¬í§…çëØÌ'VxEÓÍ&Óö› *Ÿr×ýÍc½}${= Æ[V§ç—â½s$Òõü!¨x&‰ÁHÉÌYÅÑoû[:+ÄÑðáÃhØ°¡4dÈÉ­[·RÉ’%­‰ÚhKŸkLs„0š-„ÑÌÁ%i×’‘r™Üß~Ngo ý_¦­ó†ÐÚ7¦å“ï¥e“u£õ³Ñ;«&Ò±½«è›/?¢ŸEœµ³GJQ4öÁôÄ%èÅA }yÅ,ªŒ‡¶ŸÍ=˜©5„È2›ŸË¨o-ü2g¸Ì<ÖFGÅÓˤågKßtÃyVkšhs·æ¥ˆ^:î[gQë‰F:õx¶cüׯST>HÆÏM?(=V÷bÒÞµv ÊÛÞ`P›»Q–x¿÷DzoïÚMïŸøêßù,5¸ë99ÈkÿÈëôÃ?Iÿ'OôýË¡zK€ôA[¬AŸÎ&0Ìp67Ww·›ñlâÈç¯1(í<0‘ëµbõ:úàÔiù®,fŠ ˆàŽÝÑâ^¯x啳:š8Bx%vÕy¬ö ãn;Æ[>±ŽM7[˜LÛo&¨|Ê]÷:Öä’aÞ9Â=‘/0—Õñ2;#OHvY]”8úÍo~CgÎœ¡Áƒ{ôØ Ú¼y3•(Qš¨6q´ä™Æ4Kˆ¢•¤éƒJÒâg›ÒÇ'w{KéœÍ¾¥ï¿þ”¾ùâœäw_"?úª/·;sl7½6âO¾¿½009qzðàÁ”qiŸÒ¢ãlM4· ­Ýó¥}¨tViê³ÔõÃyé>´T…•þ*î9Ðl=ÁõÓè8¶c3Í ­)ËþàRêSÚLߟ§¬Kë ®{¤ÜÒ]¦PF3m½lZÛÄMǬ‹î.—î³Ôï®û«x¶c#]¯½µ—&êàÖá¹.V·¢ÝÞQíö’™–­þ‚¾2ÔÛ(W¤Ü4ñ;N•8Ú´e}ôÉ4ú…åtÓ]ã©QûçiîÒÝÞ÷ZÐ?ôl˜Բ& Ú4‘#E”>Ðóü L"ixKãÜx&¸¬Î6¨TǺ¨—YºûÓõaÊž,¹^ë6lò„Üá†ë¤óz™õöuA½ðß>û¹†1–Õi×Üç®Ò±æã†ñÒ XV§Å:É´ýf‚ʧÜuÇ»×’¬¯b¾mÈ,ŽŒ”"q´aÃêÓ§'@O]|ñŲ#4h 8€  ?„´iÓ&ºúê«­‰Ú¨Ä‘z² .zº±FÓ–¤7”¤Ù× Ù£n¤=«'Ð'§öÑw_}L¿üò³[¥~9ž¾~žÜG[—M  ýn ñ½«Ó!ŠFÝW‚¿·ÐЗò+ŽöïߟR.é-o¢ÓöØêÇoIo1,M½—D•î½Ä÷…VNé.Ãké”îMKà†ÿ*=óØŒ“ÕŠ^pÓŽÊÏÛêÓ-wÿ ­¼p¥[µòç녌㮷MÜtà¦ü}\B½Å\µcõxǪýåxZieÐÛ*¡ëâ²Ø´·­ÝliyFê§Þ¶²êé ¦RmÛ¾Cô!GèØÉiÌ Ë(wÒJúêëïè1øþøãOÄ@ü£z‘Áµäºõ¨Ð®/,6oîQ/š[׊¾pî@ÑW/—íØH'Ô’¹Pe÷‡ ËD¯×Þ½ûèÈ‘÷èø‰tæìYúï¢}òI¸ë¥—U×ÊxË$§MT]Aß54ÒRq}mƒp*¬Ïr˜ægkoµ!ƒ ëK?ìoFs7üãÞkIÖW1íâH.¥Ë!¹’ŽÅƒ‘R$*Žz÷î-’Iž8ºè¢‹ä D‘#Œœ©%L7]uÕUÖDmTÂCº;ÿ©Æ4ÕFSú•¤ÍsÒ¾u“iö iƨz´ü•.´}É“ôîú×å{Eûw¯{6-|’LìB“Õ¡‰ëЖ%ÏÓ’×ûKa4R£÷” çú7ôåo°ÂöÞ½{ „ã[fQËñv¿¤¹¨']}OZdñË—üÂ0F™’âø–”•Êôò‰ÜÞé#~Ç©GŠèCðä/”ãX÷­½ÂÊ<(SÍd®W<©ë•×ß ‹#£è Ñeuº0²Š#µÞDDºòÊ+­‰ÚhGórÓýKÒëB½Ö÷ZÚ±hŒ\F÷ñ©½´gÍKôÖsmiBÏëËÒ‹}*Ñ„ÞéÙGËÐSÝ„ z¢ m^<žN¿ÿýøý7´zöO ë\‚žé—¼8Ú³gOð9j‘Õ‚ž³úå zˆqZå—Où…a`™’ãs-²¨Åsv¿Ì!·w:‰ßq*ÄQ¢´¥S(YHÅQ¢´¥Ã´³¸^ƒ]VÇ`0RŠdÅQàÌ‘RM*¦›’GúÒ—Ùco–¢è•>×Ò˽¯¥yOµ¤³ï¿-ß'Rüñû¯éãÓéä¡ÍtâÐ&úèƒýôÃw_ùÂ|pämziX .DÑÐœkhH§kè©> |y…G_ý5íÞ½›ÉdbâwœWqÄÌòõ*x×kÀâˆÁ(:Hæ#ž8ŸS§NyX""ÛµÑ&ŽfŽi$…Ñä^×Ò¤ž×ÒÄ×Òì'[ÓÑ=ˤŠ‡ïE˜ƒ»–Óä­ål‘FƒŸì¸8êÞ½;â÷‹ß1~϶ß9ȃíÂE¾^Ïâ,Ž>üä YwƒQxßqÊ6dPâHF½zõJZéï¼9²¡œ-šÐýZzÞFÏ>\‚žîZ‚žr?æ:Vð©GÊÑ ýkÑóýjÓØ®åä»EXBQä͹¢hPG‡Gz^aĈÜâ‰3Â2™ÌÂGü~ñ;¶ý¾y°]¸È׫àY\¯ÁÇF|ø9“É,ÄïÙö;7©ÄôŽ.¢–ÕÁS £T‰£)#Ò B)QôL7G=)„Ñ8£JÐ÷»EúNtêÝ"Kè Šta”qÄd2‹>y°]¸È׫àÉ×€ÉdêâH $з¬'©˜9Â’ý¥éOßM¯ ½‰^rMÒ€&=Ö€&j@/ NØ€^ЀÆ÷o@ÏõsøLßôtŸôTïôdïú’¹½êÓ8°§Ÿ/ŽìàË y³8b2™ ô ùz<ù0™Ìâ ™#«8R *qT›„yA›Édò@¯p‘¯WÁ“¯“É,.4gŽ@Ÿ8JÕVÞ¹ÙòŒ÷‚6“É,>ä^á"_¯‚'_&“Y\}£4Ò@ÐCÐEQUðq¤«®ºÊšh j³ƒ0/h3™ÌâCè.òõ*xò5`2™Å…Ð7Ð9Jó( 䉣‹/¾Xž 8 àqÓ¦MtÍ5×Xe2™ÌL&z6wff’¯WÁ“¯“É,.„¾ÎÑutôtQÖo~ó:sæ 2„,ùØcÑ–-[¨dÉ’ÖD™L&“Éd2™L&³°ú:zGiè è!袬ßýîwtöìYù¾ŽÎmÛ¶QéÒ¥­‰2™L&“Éd2™Lfa#ô tŽ©} ‡ ‹².¹äúðÃå†:wîÜIåË—·&Êd2™L&“Éd2™…Ð7Ð9¦ö‚.ÊúÃþ@}ô=÷Üs>¾óÎ;T¹rek¢L&“Éd2™L&“YØ}cjè!袬?ýéOò;A/½ôMš4Éã»ï¾KÕ«W·&Êd2™L&“Éd2™…Ð7Ð9ºî‚‚.ÊúË_þBŸ~ú)½þúëôꫯzÜ·oÕ¬YÓš(“Éd2™L&“Éd6Bß@çèº:zº(ëÒK/¥Ï>ûŒ¦N*ùæ›oÒo¼A¤Úµk[e2™L&“Éd2™ÌÂFèèè襠‡ ‹².»ì2y2cÆ š>}ºä´iÓèСCT·n]k¢AÌÍÍ¥ž={Z?ÔšŸDžÈÛV&/_Es,¦Yo-L+‘'ò¶•‰Éd2 ; ‹ `[›l«˜LfQ&ô tôŽÒ>ÐAÐCÐEYýë_åÉÌ™3¥‡âáÇ©^½zÖDm1r$=ùä“tîÜ9:þ|Z‰<‘7Ê`+›Îy —Кõ›è˯¾²¦•ŸDžÈe°•Éd2 + ‹ `[Ÿl«˜LfQ&ô tŽ®{ ƒ ‡ ‹¤8úüóÏiöìÙ4kÖ,é "Rýúõ­‰Úؽ{w¹ËÃO?ýD_‰Ž5DžÈe°•Mçìù‹Dœ¯é矦o¾ù&­DžÈe°•Éd2 + ‹ `[Ÿl«˜LfQ&ô tŽÒ<Ð?ÐAÐC)GX2€'Nº!ØóÖôíÕæVn_iN[\n~¹9mÜ8Yð¥æ´ApÝ$‡k&6§Õ/6§U‚+_hNËŸþS»úòBÞ(ƒ­l:±dauC°cÇZ»vmh®Y³ÆÇÕ«W{\¹r¥Ç+VЦM›|y!o”ÁV6&“É,¬,,6€mÛ*&“Y¼ZÁCg2âO›¾üòK[_iFkÆ•òq58¶­\ùD)Z1¦-\6º-UŠ–.~¼-YŠŒ(Eó‡—¤yÃJÒÜ¡%iö’4spIšñXIZülS_^È;Yƒ#²xñâ(.\¸0Š ,ðñ­·Þò8wî\hdpùòå¾¼Øà0™Ì¢ÈÂbØV±­b2™Å›J™Ú'Påeæ(žÁ 26K5c³HelÞ‚¡œc# ÍLah¦ NX’>¿'ž±‰gh@´ã²eË|y…18û¢å+×ÑŒYó™L&³À‰þý’­¿R,,6€mUêlXP›[0™L¦b¢›ÝØfŽ¬â¤ò“Gº›280402aŸÀ½ðnÚ ’4u@Iz£IšÿTS_^©28ñ M"Æ\²d‰/¯0çäчŸ|A ƒ‘ @täØk¥˜Œ XñDiZ™[‰–=Q.m6 Y[µlÌõ´gQ?úñÛÏè羡½Ë§#Kk[U›[0™L¦b"›Ý€¶™#ô‡âHu”ÉŠ#¤¥ƒãah:ºñ9Ú>µ£|ˆ·…0ºg÷ÒþóÙ_~t˜ö®-g‹Ö½Úö¯y–ÖO¹/£lU,a” [U›[0™L¦b"›Ý€¶™#ô‹è£}âHWO˜ q´Eõôf‹4a´ô‰ŠtpM.ýðÍ'ôÖˆë¼'p³ô'pÂØà ÜëýJÒk}¯¥Wú\K³Ç¥ÖàÄ36º¡ùî»ïèÝwß•îÊÐèÆFí™ÎâˆÁ`$#Žl6`ÕS•éìÁ%²ÏÿÏ/¿È´!80óá{híäÛóÕ„-çÇG×ÊrÙ0^Úªm–eÕñáû[d9÷­yNžŸ>´®ÀmÜ–.]êÍ0ùe«P„³ V˜L&3D_¦ouq¤ëôÑVq„€ê;G‰Š#(·O?ýÔãæ—›ICƒ'…rY‚&Š°^{éØÊtlûúåüÏÒÍvgñ¤ëµ'p×Ê'p¯ Córïkir¯kiæM|y!ïTÓÐè¢OÝðñÁ#GŽÈsehtc£¾¶‹4õ¼¯ ÅQVV–{Ä`0áFųkž­!ÐÑßÿBß}õ!Ü3ö,FG6O¦/ΔvàËÒªI·ç› k«>=±MÖû½ÍiÑã×Óüáîʼ[¤Ä›äu´Ý‹2ì¹÷·¸­Âw:ôxÈôtQ”*[…z@ìéïT1™LfA0ìƒ'P‰#õ}#èô‘1Ř*qäÍ Q¤¿[´ìÉèðÆ ôË/ç¥Qf ½ÎyRèDõîU÷ Üdal&õ¼–&ö¸–¦I½Á 26 ¾,ñaÄñß¾}Ò_ÝؼñÆ,Ž F‘@²â(²bà:Ú»ô1ú釯„0:G;çõ¤…£Êyïì¬x¡}~îì[ïY˜o6 ¬­úÄG_œÝOG6M¤ƒëž£kŸ•Äº}‚{W‹c!Œ>=½O†=÷þ¶·Ux‚zâÄ Ú°a­_¿žŽ=J?üðC”(J…­B=0 ±ùyîA*Œ ê¿-L^™ª´g´“vl7ÃâÏd&*Ž:äG`”8‚bRâ)qôÉ'ŸxÜðRSo Ýw¶háa|ÆU¥÷¶¼,—QÀ*à \äI¡0ŠÂ Ê'p06½có¢06½–¦ŽºÅ—W^ ¾ÿdhtQ„6ÒÅ£sàÀé® 26 ÒÓóbqÄ`0 #Š#½_ÖmÀŠÜ*ôÁ»se¿yb×,ZðxYçÝ",¥ì¼[´uv/úåüOôÓßÒÌáUóÅ„µUJ%‚³G·¸­‚8Ú³gg³¶mÛ&gŽta”*[…z`@‚1Äço§ î<Âv4~© Ò¯0œÞ6 Šª æ[ØD¦ž å5ÚeU áoÛü’d˜22™if^ÅQàÌ‘F`²3Gü±Çõ“šJC#g‹„(† Kso Sû{âBÇùŸ äŽ%OÓ„î×ÒóÂØŒäZš2ò_^©2802˜ BzAÔÅŽÁcǎɆU†œ2eJR‡ÅƒÁÈ4„Gz¿¬Û€•ÏÖ¡Þß$Ózû­¾Þû¥úoKžkN_öì[—Mê5 “ ÖV}|ßØÝž»-}ª}ðî:ÿÓRL$ŠmB=뛧*A“‡4òå…¼“58«W¯öšdĈ ƒ²À@ÁؼöÚk4oÞ<_^I‹£#¹”C9ÙÎM‘³èåzÇ*H¶vãdSî/—rsà–C ƒÁˆôÑ4FŲóG–¥Ã›^’;Ô}t|;-[+j'ºƒ[Þ}é/²?>ª¾7 ó‚; “ ¯œê¨’G§ßÛ–²r†±U ÞRT³J š9Ò°O°óº8JÖV¡žÐܪŒÅîbp¼U Duî†o;ÕuŸÚVî·~¼U¾=w3žïظ«°[!ÚNõÊ•¶terÓœÚ6rì0 oHKå¡Ò4ÿ[ëå/«¯>:u÷ ´|yŪ ™žž§/[™óñZ¨´˜Ì8ô÷)máGú† qÅ&;sdœåã;_†fñ“µèä^ÑÙÿüƒkFÃÖ%ÏÒS]KГÂØäv)A/ N­ÁÑG^ÅÚÆ&åâH žE9âæÐŽ…øÁ¡p‡j’ñ" ÀÅ`0€it‚ú‡dÄ‘n°ÃÛª‰­éó³„@:OgŽl Õ¯äÐü'o¦Eã[Ó¾õ/Ë~øá»/iúèFRAl<÷p Gl¤À„)'fµ>:–¸8:%ÄQªÊÆVá›{X6ÛcqA›ˆw‘”Ê‹8B}°jâÈò¾T¦L_ZŽc¦»:ënúÇ ‹ó¬64Ñæ.Ï'Ry‹0ÊO§Ow×#zÞAÿõ¸±ÜÕ¹Í=nZqê&”^wÓ?VXœÇ¼î9“‚º}²ùƒaûVPŸ9R)ÔÌQ²âH/èÒç;/ÛºëÊ=YŽ¾=Ë3€‰`Ëâg¥¡û` zâôâ †¾¼òbpV®\é±µUÁe²¸¥7 >`2é¹›þ±Ââ<Ôµ`2ÃöÉ殶ouq¤´U)O%ŽQ^ÅÑ’gG}·hÎã7Ðñ=Ά ‰`ó¢g=c3úþôÂÀÔESüÄ"ÒÃA¼ìªpÎœ9¾¼Âœ¤Ä‘Fîl’éÎâˆÁ`ÄA¼~!qd³S]G+_Ρû–ÓO?|+ûP৾£¯??#ˆ¥sÇwÓ´±­½Y˜TØ€°åüðýÄÅÑB¥ªœal•GXR§6\aÇÏœ9#©Þ1RKèpŒtMq”Œ­B=¾ýö[:xð \Ú‡J—îCKq¬îb<Á=_Ú§4e!œÞ;_J}JgQë ®»î¯ÒñÂN¢@…•i·ž]u.þ·î³ÔMù”¦>KÝ0ž›‘·‘VTùƒþGÅGYµüÌpzø¨zj~zâìúhqÔq¦\ uÎd¦ˆè‹Âô­ ô tŽ.ŽÀÀ™#ÌËÌ‘®â=ÝØÙ…È}ÙÖYW~-M’Mï®}‰~üÞ¿•÷„×¹K(®¥§»^ë-Mçš1ÂÐŒº¯=~o ? ¡/¯¼œ+VHC£7nhÌ—X_ #,iÀ¶©ð×EÑäÉ“%Ñ®z^a NÒâHAòý#‹;ÀâˆÁ`$Š°âHï—ƒl€únÑ«ýJÓÔµiÊÐ4±wizsäMtòàFÑOþ$óDûí—ŸÐÔ±·ÓØ.%Sb–ß,JÞ–6[…0°?_}õ•H;°Cx1Y?ü‡Ú²e‹GýÏ‹­B=0 Ù¿?í_Ò[ z{Ó\"®-ìXºU+'œ^?DZlõ‚æ…Vn;„mE/˜iùÎ_ V^X‘Nï%^=ZòVùÊ8fùƒþëé©óZyéHêá4Zë Få²>Z™s-Üs&3ELT¥mY÷Éåü§{»MéW’^Ó¾þÆ઴sùsôËùŸ]³B4þÑRr½6–PHQä>ã>ƒ±)ŒÍˆ{JÐsýúò Û(6ƒ³lÙ2¯î6Q¤ #]á¿2H6a”Vq$ÉMfçä8î,Ž F F%bÔNtrÃm‡·©£›Ññ|Î>:u¦æÞE£î¿6Ï6 l9ÏÝêæ'…8J—­Â9¾±‡Ãbã¬x€-‚àÁG`ñ~fš0[!q„%wØê{éÒ¥ÒvA¨åU!ìÞ½{™‰r|KÊj9ÞîÇd2&ú¢0}+¨‹#Õ§ÆGJE¥BÍËmìíBôšö…sEìB4¹_zgÍË¢vž>ûp)¹»–%@©'p06x§ŒÍ°Î%è™~©786a¤‹"µ,ñÕ:o¸ £I“&¥N¥,Ž F¢HFųú÷€°ÃÛÓîf/i ‘–ØíXý:=ѵ\žm@Ør&+ŽÒe« ‚6lØ íGˆ»cÇÏf­_¿^Š Ø'ˆ£“'OÊc$5s”¬­B=«'˜ñù\‹È̬¬ôœ% “ÉLŽè‹Âô­`Â3G* ¦ÿ“Gú×ì±7{†F=)œˆoVh[³NèUŽ6ÎCß|ù1=Õ­¤·^[‰¢Qx'Œ Ípah†æ\CC:]COõiàË+/gÉ’%Q¢HFJ)"^jÅq(RD›êy±8b0…aÅ‘Þ/‡±¶è`& ªOG÷®£ó?ÿ$ßGZ1c¸·džm@Øržyo«oö* NÚ–6[…s„ƒØÁÌf‚`¯ÔG`O:åù)q»…{˜YÂò;¸çÅV¡_ý5íÞ½›Éd2 ”è‹Âô­ ô tNhq¤R²3Gº˜9¦‘ó¤PÛΟu—ÐïYžN~˜Æu¹6j½6„ Í°Î×xÆf°à“½SopLQ¤ #,IPÄr%Œ‚Døâ‹/f¤8b0ŒD‘Œ8 kÌÞäÃ1a& nL›O 5sŸ¤§{ݘ¶œ¶Í¢¾ýRn+îç‚ßð³Óf«ÔÇ^ÕîtØ”v Ëìp®³G°QØåï©]ë6/¶ª{÷îR€AhíÚµ‹Éd2 „èƒÐ¡O²õU&uq¤´O¨™£dÄ:T}ýߌÑ"O …±‰<)t?g<)„QT³EFê ŒÍelÌíÕÀ—òNÖà,^¼8æl‘.ŒÔLQa”¬Á<"—Éd23Ž¶þJ1¿lÀ¨ÊÐÈû®O™ [Îׇ֡™¹·ÑŒÜ[iú¸[iÚØ[iê·Ò›‚SÆÜJ¯¾•^u+½úø­ôŠàË#o¥gz×)V¶jäÈ‘4nÜ89K…§¶L&“YD„¾}’­¯2 }“¶euèPõõoŽlhYWî>)4 bÜÙ"×Ð êèGÏ y'kpðÄMÝØäÅÐäÅà`Â`0™„°âHï—3Ñ°­J­‡.ŸÖ¢NL&“YD„¾ÈÖGÙ¨Ï%$Ž’9ÒÀ” å.DÊÐDíDC£=)T/±ÂØÀЀX–C£›ü28ÊÐèÆF74±ŒihY1Œ‚Þ9ùàƒèìÙ³ô駟Êþ^'úõ_ç—_~)_ØÇNh@2â(mÛªÔÙ*&“É,ŒLX)”Œ8ÂÔ–þrÔŒ§ï¦W†ÞD/¹‰&i@“k@5 ' l@/ h@ãû7 çú9|¦ozºOzªwz²w}ÉÜ^õiØÓÏGvðå…¼“58kÖ¬¡ H¾õÖ[’øZ¸N| Om¥·W,b¸ž‹#ƒ‘N¤SÀ¶ÊÎdl“ÉdFBߨeuªD_ [èGÊS©¨D—Õä‹™‰¼ˆ5{þ"a𿦟þÙgÒA䉼Q[ÙY1ŒT!]⨰ضUñÖV1™Lfa¤mæ„-Œš9RO˜’Gùbf"/bÍ[´”Ö¬ß$â9OÆÒI䉼Q[ÙíâhåàÛ9‹Üs?ŽäfSVV6åê_{ ¤™hyÏ`0ò©GèkÏ;Gü±Ü2ZWXlÛªø k«˜L&³0RGÐ=JÁ¦ùÄÑìÙ³=q&*ŽÀ‚z1y&ò"ÖÜ…Kä1,H'‘'ò¶•Ig°8ʦìl›q…‹#ƒa •âhÇŽr;j¤dÆ+,6€mUl†µUL&“Y©Ä‘Ò<Ð?ÐA°iVq¤R2∙ÆG99B ™jdQeåä$!TX1E©GÓ¦M£åË—K„ô0{dÆc2™L&3“©‹#¥}Å‘>{Äâ¨àKåÁÿq¦p„rål’_¨,ÊÁL’Ko)ž+K¦¡ÇÁ±öH.e«øz~š{vn®/Oƒ‘yˆ'Ž°Ü &Ž²‰£§žzJ $Ì a‰‹#&“Éd6šâHi ØDGÊØâÈ>žÞXÉÎÉ/Ž"ˆ@‘™'奥i¦µ(ÇãÄè§dÞsb0éD,qñaT²dÉ(dGxWæÕW_¥-[¶È4‘žÞw1™L&“™é -Ž°í§.X㉣ˆ ‚nQb%ZÐx3Gž»Æ=ÏÂÈ·TÏ7kä™hù:0Óc0™† q¤„Ñßþö7*_¾<Ý~ûí>dGx_ßÐaqÄd2™ÌÂJ%Žta(Ží#¿¨™#Iá JqT¯ž/± ò`>µ°·§ó!ßÇZ5$÷Í!skoƒQÔƒ³}ûvš9s&½ð Qœ0a‚÷_çôéÓiçÎ,Ž ƒ‘¯((qäi—ðó‰£ùóçÓ|WA=±8*8‹£lÊö¾Y¤ÃN,Ž †£S§NÑwß}çQ}ÓFèã?†åcúðÃèÌ™³tüø zç=òËá,Ž ƒ‘Ÿ€–ˆ'Žðý=õ>]ƒäUAÿ¨ÿðó‹#x€¾™£º¾Ä‚(Ž´†feé,Í+’Ô1KåädV휓“DÝX1E08ãÇ÷‰¢¯¾ÆE”Ï?ÿB£ÓB ¤£ï§Ã‡Òî={iý†Íôî»ûèÙçžeqÄ`0Œ|´D,qñÛU²dÉ(”¬8:zô¨31¤~>q´@#P‰££Guó ŽŽäR¶.ˆÄynÊÔQñG¹Gð_šG(WÎ&ùë¶(G‰RAo)žË«zkaåõSi¨üÌø #Ó¡Ä JĨ|IŸ}ö9}òɧÂ@§C‡Þ£ý A´Ÿ¶lÝAk×n”3G,Ž ƒ‘߀ GJýío£òåËÓí·ßîHyG ,ð?G]v}!2_ „Ñü¹såÿDÅÑÏ?Ÿ§ïø)ÂywSVå'h¯î–2¾E³*Óè}6¿XL6^z[9ÂÇÓ;1Ù¹B"éBGG´ŠÌ<)?,-M3­E9n3>ƒÁÈtèâè›o¾†ä+O}øáÇtèð{´oßAÚ½{/½ýönÚ¼y;­Y³víÚ%ŽFMo¼1•ÞÞù}øÑ'ôÍ·ß[û0&“Éd2Ãðüù_èì¹­âH £Ë/¿œ4h@½{÷¦1cÆÐðáÃ=”Š™#£… J?G]z©#ŽæÌ‘œ $ÅQ:Q ÚˆÂü$ÄÑwßÿ¨quéJ£÷inûhT¥,ê0W 7Wˆ¨Jcè]¾2š;†*¹3÷îèÊîì…žVtX_>{#î*_¼½ê<3OEt‹5Ñ‚FÕ?ò.’Æ=ÏÂÈ'x|³F.e&f|ƒ‘éH¥8z\ˆ£)o¼)Âí¢s"î×ß|gíØL&“É Cˆ£ÓgÎZÅìVË–-©gÏž4iÒ$š={6-^¼˜V¯^M‹-’þÉŠ£÷ßß›1‚0ò‹£¿ü…¾†rÁÌY´`ÖlZ0"i.½ÀÖ®• vq:bƒkO @ uœç…™ÛQù9bÊJn8qî‰y~7Í•ñŒ°R )ÑãøyùEùq¤–Ò-Šˆ$Ÿ¿7jÙ›Zv‡c›8ÂHøûvÁóÅ×ÁâˆÁ(l`qÄd2™ÌLe,q¤fŽ‚˜—™#ˆ#%Š¢ÅÑŸÿ,ÄÑg´`ÚtZ0c&-„HIŠ£Zµ¢´1X¹tgr""H9JàD —X禟&²d^*}ÃÏ/_áÔ™Š^"‡Cá§D“:±Ä‘sŽ(Z¶åsf|ƒ‘é`qÄd2™ÌLå/¿üB§NŸ±Š#Ðê¿Î¼Š#Ì@)ÂÏGú}! ±è©´hê4Z8c-œ5‹Ž%*Ž~ú™¾ýî‡@îU™²:ÌóŽ+Úçýw¸Âå]'ֹ駖ë‰ãw!Ž:ÒéîpN×/*^f2”8’3BúìŽîï¼C$—É091gŽŒ8>Qå¦ò²:£P"•âhäã£èõ)oÐŽ·wÒ¹sÑW_kíØL&“É ÃóB}p*ýâèرcr‰žN¤åˆ£?þÑG¯¿.Ò›´hÚtZ4c¦GõjÞhMÔ¤UÍ%^N¯½>…¶m›Îœ=G_|ùµµc2™L&3 !ŽŽŸø íâèøñãRéŒGK^y•–£·dê4Z¢–ÕÝpƒ5Q“ ‹£Ý£¨R¥QôŽÍÉâˆÁ`¤ ¦8Ê˲:GL&“ÉL% R-[¶ÌGC}JK_–¾ñ&->–ÍžMÇG?ü$ןÇæ)·ö®D#ß±ù3AG #U°Í%»¬nĈ‘ôêk¯ÓÖm;èô™sôù_Yû0&“Éd2ÃðüùótìøIi«¶oßN3gΤ^x!Š&Lðþëœ.tËÎ;G'Nœ åË—{\±b…YÎ;GGB¡-óMZ>M£Y³hù¼ytâ½£ ‰£ïøQ®?gæ,Ž Fª`GÉ.«qôêë´eëv:uú,}öù—Ö>ŒÉd2™Ì0üYˆ£÷¶ ÂèÔ©SÂN}ç¶ ÄlÒÇ*lÒÇôá‡Ñ™3géøñôÎ;{h–Ð.Ɉ#"EØÀˆ8úÃè«Ï>£ÓgЊY³iÅܹ´â­ùtòý÷ÚÅQêhGØF;Ëÿ±V Gr³)+ám¶óº5·[&ÅKøþ’ž¾bô7˜ † ¦8Ê˲:GL&“ÉL%uq[¥‹¢¯¾úš¾øòKúüó/èƒN 1t’Ž¾œ>J»÷ì¥õ6 ›µÏ³U‰ˆ£“'OJA¤¸jÕ*]ýQˆ£Ïi¥F+çΣUB­Z¸N;–8Ú·o3E GÙ”í}³H‡)!Žò?¤3/£èÀ6s”첺ž"ܸqãäLÓÖ­[iÏž=Ö>ŒÉd2™ÌD¨Û*ð¾øâKï»|G§C‡Þ£ýɇx[¶î µk7Ê™£dÅÑêÕ«}Œˆ£? qôùç´jÎŒÉd2™Ì°ü駟¢lU2,OF­Y³Æ£!Ž¾ÂhFk-¡5K—ÑÇS½š5­‰š´æÉ"–8Ê=‚ÿ9âLáåÊÙ$¿xð-GóÖº9a °²dzkaäR¶Šïå+¾{¸È¹€/}}9ž%¬„žêl,áƒ@ÌÎ>n¸E‘ô}bÒZ/£èÂ48yYV7vìXš1cíÝ»Wîêƒi ƒÁÈ+Ra«GØ‚híÚµ‘—'Ž¾× a´vñbZ+„ÑÚå+èƒ'Xb‹#èM`°¯‹‚¡â¸ãX ÊÏFZBx8qlñ#'"6ìáÌs_˨w™ô÷¯"mâÄw„’@TÚ¶z1E©x°8b0 F~Á´UÉ,ODaã‡uëÖù%ŽÖ-\Dë–,¥uË–Óº•+éÔÉ“,Ž ñÄQD™¢À ’âÀ=ÏÂÈ'|³+.e&öøzTqÂÉôý³6õð`KScJ Yâ{iÖ‹Á(º`qÄ`0ŒL‡M%º³j¢âhýúõ>F‹£E‹YeâŠ#!äR:,³‰ŸøPËîpl œ a$ü}"Á"^Øâëç qÂ¥D!çý+õßN› ¬ƒQtÁâˆÁ`0™ÓVå÷²ºÓ§OÓ† b‰£/iýâ%´~é2Z¿|­_µŠÅ‘}°4p‡ÄâÅG8uf†¬¢~a–•iç'þ´B,m‹:WˆÎIßÓc>Ñ6MÄËΡOüNÚ^Ù£Ò¶Õ‹Á(ºÈ?q4“:‰ß“>›ÈD¬üü@"¬Ðû… ¾£À·RÀìãÌvq¡íýý>ƒÁ`l3Gù¹¬âhãÆR )úÅÑ—_Ò†%KiÃòå´aÅJÚ°z5>ù‹#‰TßÄâ…GÒÀé³ º¿kü`(}âÁLÃÇ'ªÜ4@9ˆ±Å×Â:†6V>.|éÇ +aw‡q÷°œpΆNú>ok½Œ¢‹TŠ£ÊY§öOë⨲å·òÁ†šõÎ ô~!¨ï(âÂH¯·Ó—GD¿]ü‚a‹a›1ŒŒƒMåç²:%ŽtF‰£K—ÑÆ+h“F›Ö®¥Ó°8r ã›X¼¢Ýž©Ed9žB1 1Ð :~|7Â_?wîC:pà°\ž°k×Ú¾}'mÜ´•V­^—¯âÈ¿6/HEÿ\˜á¡¨g›¿@ç. ‚nXĹgÜä¹Í@(8FE7†Ö'fN^ÊÙ`º‘ÑÊ! SX?u„HGñ  ¶6 ÓÖ Fñ >ÜŠy°‰‚³¤îúøãOäìÑÑ£ïÓáÃïÑ¡ÃGèàÁC´ÿAÚ»w?mݺ¦L™gæȨûñN_è&æ¹Þ_tÿ¬áüq|vÆZ-Æ oÄ_·aê8*l@š¶ü…Ó¦Np'}OPEþ±ì'ƒÁ`ä?lâ(Ñ–'*Ž¶lÙâ£_}õmY±’¶¬ZM[Ö¬¥-ëÖg 8Ò Y¼sÒZ:én°(c£§OdYWb~`ð\Ã¥Œ<‹#ƒ‘*ÀàÀ˜@ Á€„%„ÑòåËãˆ£à™£ˆ»í\ë ¼–'QýpTœ òxñ\ÊD£ó †=Ÿ¨4ó· ËÌ‘œ5³•IË`0Så÷²º³gÏÒÖ­[}ŒG[W®¢­«WÓÖµkiëºut¶8ˆ#jyž´iÚøšOçÂú¹ð•+b X1ŒT_‡!øôÓOéóÏ?÷}¸ú¯³L_ ÛP`âÈE¾÷ÏýptQå±–Ý×#l"íá«£_ZúRšiÃ?8?ƒÁHLq”ÌæA‰Š£íÛ·ËÍ£ÄÑ6!Ž¶­^CÛ×®£mëÖÓ¹S§©Þ 7X5™ñâÈ5 ¾'n`p¤16Ž!Ri;~^:Q(–Ÿ¥|0TÊÐËðNG #UÈ£fMä“¿œ$òÏk™Ó9àHg^ FÑAFŠ#9Û¶ î?l3H*m[½lH$,ƒ‘¹`qÄ`0ŒLGºÅ¿óÎ;>~÷Ýw®8úË_è;¡”ÞÙ¾]ãúèÜ9ª_«–5Q“,ŽR‹xâ("ˆ0f×E! $Ä{žmîå›1q)3±Ç×£:ˆN¦ïŸ‰ ¬‡[ššóÞ_ˆŽï¥X/  Ë`d0X1 #ÓQâ“ÕG—^*ÅÑž];wyüøé~íÚÖDM²8J-âŠ#!äR:,³‰ŸøÐ_¸5…Î…0þ¾¿E¼8°Å×Ïâ„K‰8B2ÎûWþ¯ÌpÚ¬X`½,H$,ƒ‘Á`qÄ`0ŒLGºÅÑÇLï¾û®qtÙeòä]¡˜÷îÙC‹Lê×­kMÔ$‹£Ô"¾8©33d𠳬L;‡8ñ§bi[Ô¹B¼pNúžó ‘°i žoë]ÀIÛ+{TÚ¶zÙHX#sÁâˆÁ`0™Ž‚G°e:#â诎8Ú+“NDª_¯ž5Q“,ŽR‹PâHΈè3º¿3["—‚Åún‡-ŽOT¹i€RÉØâka1+¾ôã„•°»CÔù—»9ᜠœô}ÞÖz ‘° F†‚ŃÁ`02&ŽþJß‹“}ÂQç'EFéƒê wfÅfxD–ã)ŽkÌ`¤ ù'Ž¢?›ÈóƒÔlå]øú÷|ïSsÆÛl÷A˜h{ÿŠƒÁ(8¤[áJûöíóñûï¿×Ä‘8Ù¿¿ˆ„ȶDM²8J-X…fv¼w®½ÆT8äwE©G•³þNíŸÖÅQåäúSëo7¾þ=åÂH¯·#~"¢Çß.~A„°Å°Í FÆ¡ Ä‘©}¢ÄÑÁƒ}DÁX XŃZ6h»–Åt€Ä` Å‘•¼ ðõï©…ÓFMÀÉ%ÁÑïqZgë ®ò<ƒÇ`0yCºÅò0µO!Gj@ìÐéËmnpŽ¼+’›m<­åûÉ'bHœ8‘–Æ/ÿ[@¶²8b0©C*ő׶C™}›­Ÿ4EL1èßõrôc[Xkš–üe8å¯Coc·î¹zžFJfñ #y°8JŽQˆzÒh}âC1\òI ƒg$„aQ†@–0~:\C£ÅñÊX-Æ oÄÕÀâˆÁ`¤ ù;s¬û…)LÌs}@_LúwÄWùëÇQaÒ´å(lœ6u‚;é{‚* ð· ,ƒÁH2R:tÈÇÏ>û,sÄ‘4d–Î[º(ÊXè†Æ0:‘úcùÉm^Py¼x.e¢Ñù)°8b0©BþŠ£à™£ˆ»í\ëÏ‹Yÿ {>Qiæo6–™#9kf+“–Á`0 éGÐ9¦öA…K¹À÷ÄÌ †ãŽ>b,ü¢ÁñóÒ‰2 ~0(Ê Kw==»4Ë]öà¸ÁâH¤i}Âçä‘^q$?¯ù2Œ°ÈúqTØ 4#ˆä/%xÌøþôe›éuÖÏ £‘âèÈ‘#>f–8œ_ÎTJã(‚rÓŒƒæn{a×yñUKG"–Ÿc¼¥{¬ª•G\å.èÞWC,q„òEMä›#Ê^0‚ËÉÆÏk¾ #,R)Ž:Uvû0oC­_tú&ó÷ý{÷ î%&’N‘ìß?”8°¥”?àóÓëD§/7 ÐËâÀ`0iGAˆ#SûD‰£÷Þ{ÏG ³ÄQ~Ãb  ±ÄQîü× £z ë/¿4~ÊXz†Ï ã †ÇZXŸqVùÅ‹/Ž±#’Ï7øÑÒóhü~NºÆ“dß@‚Á`$‚TŠ#ÿG`¿¤óçÏK¿„ß|ZÓz_ň@Ù÷”Á`0 éGHËÔ>,Ž¢9Æ3¶8‚VО zƒŒ òëî8ÖE‹òsÄHäá¡‘–'‘'¶øêXˆ•ˆ|’©‹ªHúÑKa‚òRL¥Ã`0EFŠ#ÙD:|†ÑÏ0$äC´´]ƒÁFFŠ££GúˆH,Ž ñÄ‘þÔ5"”ŒòKq¢fc”»YGç<Û\ïï›Éq)3±Ç•¶>qôã?Ò±cÇ|Ô#Ç#‹£Ô"”8’3BºhÐýwˆäµX»/ÙâøD•›(•MPˆ+mœF–ùÅÞA0g¢L[ ¦¨­g Fh°8b0 F¦£ Ä‘©} ‡Xe(¸= FªÀâˆÁ`0™GŒ˜àöd0©‹#ƒÁ`d:2R?~ÜGdV4Ä‘¾¼Ë\ú•™`qÄ`0R…ôŠ#ô±ÚYÁÔo¨’ý¸¶L8_Ê\˜‘˜ MïíÉ U÷¸gròc¹wí­–«ÇYvÁÈL¤[!ž©}¢Äщ'|dqTp`qÄ`0R…ô‹#­•ƒ·To¨’}ú¢Ü|.saFíµ3i~#™ëŸ÷{ƀ➑LµðÛÞð +ä!þóVg#¿QâÈÔ> q: ålû¦Žg°d‡ÆO‡Ûiq¼r–GKG„Ñ;·¨: ØÛÓ-_Túüõ £l #?ÊÄ`0R‰TŠ£¿7éãŠ#ñ»o7Ó™9B¿ç´ ?E_ß`ô7ª/ Óoú΃ŽM$b7œ8žw`Ùl Â+¢qÂÛ£~"MÝ~xeC^ÆC6?ÒeCõ2äi¤om [½˪µ±ó÷]'kÛéi;q¢Ó BºÚ[¯»ÖÖvðu0‹tŠ£zBß@ç˜ÚzÈGŸ}ö™\*¡óðáÙ#Žd‡`ùQKw£‚›g½1;ôªSŠå'ODG#:É€ô‚ÊãÅs)ÎO!Xe‹ºÙâÀO/WX—!ò£L #•H¥8ʪÜÉG×ÓÈ]jYÞhÇf¿ÔÚúM_š@@Qá4˜ù+Xós g ¼N_Àn6&–²„²=nþQm'N,ùK$\¿e•~æõÊ3l[h網F…×”¬<äi[1ëžÊöÖýâC°ùÓb02 iGõêÑ¡C‡húôé>í=ä‰#dÔ¨QGM;vìÈ|qäÂyÒ¢“ÐótÇÞÑh~¾üõƌ㠪<¡:èb‰#LëGuù4*'0½`—!ò£L #•H¥8rÞ9 )ŽÐz}C"ýxTß”‡NCBù¹çêÄ@TŸž¯â(Èöè0ãÄ)C"m³~1Ê*ý´<‚òL¨-¢ëû>ÑLÛùâÄ·õÌÛAêÚ[÷ s\&£ ‘nq´}ûvzüñÇ}ÚçܹsŽ8ºÌG#GŽô‘2~Yt6Ž?:Õy¨NHïh´t|X ? ôUç%ÝõôôÎ'³<ÑeŽK9ëìõNuàþô`lÐùJªÆpÓð­›öâàX +ë©ÒÐÛÈÿóV¦ uÒö8Zùük´ý~Áeg0Š REûÙúÂ"ý¦>Oómy˜ùéHÀnè}|BÙ=_šþ8N¥÷MZ9cùy0ëmž›H‡ Uý¾<ÊÓŸ~t}ã×Ë_Ö zÇÊ? $l½éhïõ0Î7Î=Î`$Ò)Žê q´mÛ61b„Oû ïB$Ž§“PeÙ‘Hƒi‚4wÛËÎYKG"–ŸÓÑI÷ìÊ zšTÙ¡)wA§ðþ¸b‹#dcÙᥧ»ãXï°•ŸS?³-"Á‚Þ“Š„Ëk™<á#ÛPk;ÑqT”hc¢åXv£x •â(¡eu.äïÓ7à4ú ~Sw÷ÍBûóð D:0 Îï^¥#ƒDå§õïía]hîÉmÈ ·‘S»íe?¢Û=aÚÂEPýâ”52àW°ä Äi ëy@Y¾þ±òÐï…X¶>,y§´½cÕ0Α‡µŒÌ@ºÅÑÖ˜âè²Â"ŽòfÇRpˆ'Ž¤aqnD”X:B·3 îy¶ù„Ë4Æ Ó³[ãËó—)f-/F9¼ð.­eg0ŠR?sk+ï∼ö-E¨oŠê›™ˆ>¶ŒÌ‹£ŒD樸âHutØÞÓ3Dš¿ê©”Þ)šuĹFÂß÷DÉ_‡-¾:Oe™âĉ2ÀAqt˜ù0Å,Žòyí[RÙ7!-ãáµ?Ì?È™BÝž0 rv¯ #ÑVqT7®8ºŒÅ‘Dæ žã‹#œ:3*¶%nÒO‰)T<³Ž‘stžþ´ŒÙ$‰àøÎijË;NdyAÌ5ÚÌ|ŒâGù¼ö-Ü71 ‹#FL„Gr&E"¨ûÃÏ}jsÝ´%ŽOŒ¸i€Ö¥ii*STWˆ±7d´–Á(`qÄ`0ŒLGzÅQ]Úºu+ >\ $EG nÏ!ÅPz—Ž0…,Ž ƒ‘éH§8ªãŠ£aÆIB$,Ž2Üž‰A®§ö½ƒÄ`0X1 #Ó‘NqT»NÚ²e <˜†€C†Hž9s† ‹Xe ¸=ãA[n'ɳF FX1 #Ó‘NqT«V-Ú¸iõïߟ àñôéÓt饗²8ÊDp{2ŒTŃÁ`02éG5jÔ õë×S=\ö¤ž={Ò©S§è/ù ‹£øÐ_äOÏKý,Ž FªZqÔ‰jg]I½rq¤6tÁrܘ»g#5[V'`_ô2»N6øwe0ŒÂtŠ£jÕªÑêÕ«épù =øàƒtòäIúÓŸþÄâ(>X1ŒÂ G&ÐG>àGÈ>‚*%ï9†µ/±ÊlËŽóßN1 F*‘NqT©R%Z¶lµk׎ÚÝu—üß¾}{:vü8ýá`qaWê`oOÇ8=©ôë',òVëJ<Ý ´àéi?ƒ‹#±ú¡p}úÛÔÌÎèùå½\böà ƒ‘yH§8*[¶,-\¸š7oFÍ› 6oNÍ[´ £GÒïIaG®aXù~ ú}G8çñ •ÿ%~ÇnØÜàÉÇÿ èrDòå—‚Å‘0ÈÖ'‚ðCž6¿XpËœ\1Eôh Ál“ó˜ƒÁHù"ŽÆ÷¢Šyéo‘EúŒ8iøâ©XÜ8¹î²33Ž«â«pz¿¤ Xó³ÍÌä§}‰Qæ :#5³…~šwód0ŽtŠ£R¥JÑÜ9s¨^½ºT·nùÝ£zõêÑáÇ鷿ýmaGÂè½n äy¬Ë#å3€õéš“—röÏÈåF.Œ_bˆ%Žrr,O,e=r¤bù9i&SF YG½Ý‘^¬ëÇü FÂH½8ýÜõ½hfŽŽM¢tÂùÅB˜4ŒþCô{¡ â¨ãÚ#ßyÐ1NõüôôÓe_´²¨°uÖÊ?•&ƒÁ`d(Ò)ŽJ\s Íœ9ƒªW«JU«VÄÿªtðàAºèâ‹ ÙÌ‘Ï0Ä:75ˆw!Ýc£Ë/1ÄGº TÈeꉧ^~½œól³mdÙµ§¥ ÌÄŒ/à•mœHþö²ÈóÀü F¢ˆ5sÔ²eKºë®»¨wïÞ4eʹµiü™£,º¾×"GÉeuaú@ó·éc£Ã…ìc=èi湉XáÍc[~F_—6ûTfÀ8G\Ÿc0ŒÌFzgŽ®’3GÙ•*RÅ å©lÙ2týu×9âè׿..â@˜È`Ûëëxe„4wÛ ³Î²2-‰X~‰!®8RÆ/îzPó÷UÝëi8uþ>ñዯÌXÊ*[YÜóÀü F¢28J uïÞ]‰;vxÂýz°8ºRˆªëìß»ü;a"∕†€/ž ôŒÑ—X+¼ágÍÎ滟ˆ ç+õöÅ^fÀ8G*2ŽY(1Œ G:ÅQ‰%hæÌ™Tã†êT­j6Uª(R™Ò…M˜Æ*yÄG8u lÄ@kþº1”Æ]Å 6¨˜ò§¥Ÿ+˜ñ8O?µð¡òwž¶zÆ_ÖGgËŸÁ`$ epÎ;GŸ}ö™¯ï†‚ ‚‘Ð…hGciÆŒ´w¯m+o{ÿR‘F€~-c‡þ@ ]«!0 #‘NqtÝu¥hîÜ9tSýºT§ötCµ*T©ByÚ¿¿HŠ#gP­žº9L× DêŒz(q$  ^7Ýß²þ"LNÌ™##ŽOÔ¨6t…Úëè@@Èü]ç¤oì¶gÍŸÁ`$ ep>þøciX`Ht~óÍ7ôÝwßÉÿº;Œ ÄRáGHKëC$SgäC¡ ì— †"åBð,<ƒÁÈ|¤Sá=£… P‹fMè–›R½:7RõªÙt`ÿ~º€gŽR‰ÔunOƒ‘*(ƒƒY#eD¨p‹#ƒÁ`¤SUªT‘–.]Jmï¸Ú´jN·4j@un¬A  φ Å Üž #UP}µ)€@ õßÆðâˆÁ`0ŒäNqTµJZ¹ruîÔÚµ½Z5oB ëסCÒ…²8ÊHp{2ŒTAœ „åtê¿,Ž ƒ‘ßH§8ª^½:­Y½šºÜ/u¾»=ÝÞ¦%5¹¹>t.*<ß9*^àöd0©‚286á†,Ž ƒ‘ßH§8ªQ£­[·–îÚ…î¿7‡îºãVjÞäf:|ø]t‹£Œ·'ƒÁH”ÁáH–‹#ƒÁ`äÒ)Žn¼ñFÚ°~õx´=ôÀ½Ôá®;äÒº#B]|ÑE,Ž2Üž #ÓÀâˆÁ`0ù…tŠ£ZµjÑÆ ë©WG¨[—ûéîöm©MËfB¦‹/fqúîIéÙI íÉd2™™Æ<‰#µu?>øý³ØPÛgû¿ËÆ`0ŒÂŽ´‹£¨wÏîôðCP§ŽíèÖVÍ…mbqéG6àÂ:tˆ,X@/¾ø"åæ:f!e§&Ô¤:®,•©“†é²5©üwú{Öß½6ëT9‹þÞ¤<îÓäï”õ÷&Ôǧ°³Uöꫧš‰¥¾}ú"ôI¿üò‹ÛCÅúΠ‘†ìW}^õè”Á`0…&Žº>H9BÝÖº9½Çâ(,2Cá#¸i6oÞ,'ø¢=žà2‹ûPí¬+©ýÓ6?æŒ>µéÊöíµ6B{Õ¦>^˜¢Ø~zò³~‰¥¾}ú¢o¿ý6AqÔw†ëW1kä›-ÂLšÁ`0ŠÒ)Žj+qÔKG-¤8úMlq´-ƒÄ‘k<a)†ó¥sØD¹ÄÂ=¿ÄO°*¾Ý Α|²ss£Å‘VŽH¾±üòŽŸ~úIÞ¸qðÔvß¾}ri 3Ó¸ˆz]¹§ZŽrÓ¸¨]}/Zß ãº]ß«µÌºžz-rý|´Å§±È Ë/ˆú´¤ñªœ²Î8†›ÆÒ®yftÛ E½®÷Ú7~[Ù®G¢×8U×/ƽ¡î%­ ‘0ÑqÛÍüRöIÿ9<Îëï²²rD/húÆH\§_Ô‘~, õ¿‘4-3EúL„’7«Ä`0ŒÂ†GñfŽFŒáã¶m™&Ž„¡Ô ¡gdÕya%V¬O¼”³#Àt#®•#jÝ|_Þ'´Œài-nÜ ÌLã.Y1‹*ŽÜåwŸÙŽ²ÚÍô»ytâ`°)Ï­agR;qo©0»FV÷dE¹KäïÆϪ8’vá|×HªèÅå—ôÚåTå2ê‰0Zû¤ŽFÛ¸ùøómG3}qt&r?ĺƩ¸~±î Z^;êi¹eF߃YlôE¿ü²Ð/jDü@È@¾ó cœª4ánöñšúrG ƒQhQ0ËêuÞ9êp—ý£áÇK6LrëÖ­T¯^=k¢&Ó6säY¾xç¤P±ˆ'÷ ¥Ï ëO#%ô´£óÁ‹ÁŽŠå—wüç?ÿ‘„Hñ"43Ãxp,UÎêD ¬îYTyìA¿»à‚Nb`ÛiAÄÍn•ÇÒAu~~uʪLcªs—Aù[Â#ßN âù4ÒØʪlF9Ýv’³ ÆjáRI³mâ º _ãè|¾~aî K/-·ÌÙãÉþGöG¾Y#—^¬>[;vûäè4ÆìÃù½#ƒÁ(*H»8ŠÚ­®©³[ÚÊûÌ™34lèP:t 2˜L[¶l¡:uêX5YhÅ‘ µ£Y¾8ƒ݈kéø y,?Fñ@÷Yˆe@áïIu”Q¸oõzêˆßæÉÃÌ3Þ¹‰‚îwôòź7üùxb(à^0˦ z>€™o@]= üz|”/ÎoˆÁ`0…éG7Ö¬Ië×­£G»=DÜ›Cíî¼Z4¹™ qtÑERÖ¥—^J§OŸ¦úS¿¾}¨w¯^Ô£GwZ'"Õ¨QÚ¨ÉÌG€ctÕh9ÀÕsÓš»mC†œçé)è $bú1ŠÂÜgÎ@5âæ0/÷¤ÿ·`¤é†)Ü÷­^Oà Γž'ïÜYór¿~¶òª|U8#ŒD*ŒæTf_xÁÀ›ÇVýìeˆ¤e.P&•ŽY(1 F¡E:ÅôÍÚµk¨ëƒ÷Ó=9èŽ[[Q“›o¢Ã‡ÒEzâè”E=©û£P·®]éÁ U«VQÕ*U¬‰šÌqT`#¿è½+<ß·…ÅèúùfŠü3I©|¿“Á`0éG:ÅQµjÕhµÐ9÷ÝÓ‰:¶»“Ú´lFÔ¥CÒ…^@YùË_èÔ©èч»Q(¨Î9Ô±C{Zºt)U¬XÑš¨ÉÌG(hO%µ§œù d2Ò…DïµXáù¾Í;¸ß‰ ÛB.7*b(2K…<ÓÕÞ ƒÁȤSeggÓŠåË©cû¶tÇm­©Ù-¨^íštðÀºð)Žþ, s’º%Žþô':qâ8u¸ëjÝ¢5º©>Õ¼¡:M›6®¼ò k¢&Y1 ƒÁ`0ŒdNqtÍÕWӌөZ•lª\©¢Fe©ôõ×E‹£ömo§VÍ›Êé¥Õ«Ò´©SéŠ+X1 ƒÁ`0ŒüC:Å&¦ S¡|9*W¶ •.}=]w]©€™£–Íèæ›êÓ5ªÓt9st¥5Q“,Ž ƒÁ`0 F2H§8ºâŠÓ›o¾Ae…0*Sº´Ü€îú믧}û±!ÑwŽ:u¸‹n¿µ5½åfªW§6Íœ9CN;Ù5™ÙâHß͉wvbd ü‚åo´Àü ¨ï;7™Ü~ŵßA]µë•/×&?Ú³8ÿ»WÕvêIAþžƒÒä­ÚóïãÎ #‘Ö™£+0sô&•ÇÌQ9ÁòåÅq:€­¼/ºˆ²þ"w«;I÷v¾›ÚßuµiÕ‚ni܈æÊÝêJZ5ÉâˆÁH‹r#÷!¾îÏßi±C¦,m“ñíW\û£®ùrmò¡móý~ÊK9óûþI =}âM5ô¼ýùe0EéGØpnÆôéT¥JɪU«Qµê7ÐÁC‡èâ‹ã|…y€Í@jK·µiM .[ÝÙ5ÉâˆÁÈ ø¾ D8ò!Û¯¸ö;f]ó£îùݶ™–f~”GGøöĬQþÍèyC¤ò”:ƒQlNqTª$v«›CuêÔ‘¬[¯Õop9r„~÷»ßQÖ¥—^J§N¢îH]ºËâˆÁÈð}ˆXâH ¼³ss3´íŠk¿cÖ5?ê^\Û–Á`0Š.Ò)ŽêÕ«G[·n¥¡C‡ÒÐ!Ch8x09s†.»ì²Â$ŽlË–&iKqüƒ'×.Òý•Uå'|ñÅn×=òån'NNN¶pÇ.~y"OQ͸Œ¢îSÜÞr±Dïi¶øÉß÷ßoG¯3ê‰ß[þ|+r׳°ö;˜ÝQ÷Ÿ~ ÄH#7³BŽ_T}¼Ó0éŸg½ˆú¹:ÆÿH¼Hû(8á|u ›¿YnƒÁ`ä+Ò)ŽêÖ­K[¶l¡ÇDƒ¤ЀèôéÓt饗q䯨A ˜Õ FGrau£*  2zÒP†ñÓá\=ŽW®Àòhéˆ0Nx#.£ ‘ûTÁ‰ãy'|OëÈߟ·û¾àáÔ[ÐË1~_)E1éw_å¯ÇIÃËq|ÂIø)úÊâÇ+¿ï<èØüôºacå7¯ ƒ‘ßH§8ªS§mÞ´‰úõëK}úô¦Þ½zQÏž=dþþóŸ ‰8’e|5HwÃÐÃÍgÔbR<™uìb,?y1øAé•Ç‹çR&£#‘ûÔ…œÐfA÷Pà=­!(KøÐ÷}FA•¢E•9G‰\Ϙ×(í_ýNè4ôsíXÆ×Ú/(=[ùÃæN‡á—Pþ ƒÁH'Ò)ŽjתE7l Ý¥GîFݺ>D]º¾û2lúy<¿°íé´½'TP.kf~:le ›?ƒÁ`0Ò‰tŠ£5n Õ«WÑ=9wS‡vméÎ;n£6­[ÑÑ£Géw¿ÿ}aÚÁ1lÎSb×hJƒ©Ü´æn{1ÚyAWKG"–Ÿc¨¥{vå=Á *Ø(wA§ðþ¸Œ"‚0÷©v?iÌË=¹,ù»a¿ï F;YŤYÿTÃÒžI^£Œíwß*ŽB¥¡ŸG§/…¢JÓ–^ˆöÌÊõÈCŠf•––º†ÍßlƒÁ`ä+Ò)ŽªW«F+W,§vmï [[·¤æÍšPãF éðáÃô›ßü¦0‰£ü†Å2‰DïÕXáù¾/Xpûg"2÷½;ƒÁ(šH§8ªVµ -_¶”n¨Ù-7SÃõ¨N­éàÁƒtÑE±8Š€)ŒÂGEÜþ™\m‹Á`0ùŽtŠ£ªÙÙ´tébjÕ¼ Ý|„QMª.Óè /dqR…‰Þ«±Âó}_°àög0 #â¨JveZºx5¿¥5¨[‹jÞP*Wª@û÷ï§ .¸€ÅƒÁ`0 ƒÁ(8¤SeW®DK-¤¦7ßDõj× ªfS…òeiß¾}ôë_ÿ:"ŽFŒáã¶mÛX1 ƒÁ`0Œ|EAˆ£&PÝo jU*Qù²e¢ÅÑðáÇѰa·nÝJõêÕ³&j’ŃÁ`0 ƒÁHéGi±G·4ªOun¬NU³+Q¹2¥…8ÚK¿ú•G—]v9s†† "9xð`É-[¶Pݺu­‰šdqÄ`0 ƒÁ`0’AƉ£Ó§OÓÀh€`ÿþý%7mÚDµj׶&j’ŃÁ`0 ƒÁHéG è–†âèÒ¿ü…N:E={ö¤ž=zPÁîݻӺuë¨FÖDMf¶8Òwƒâ¡™ÿNù›*0?Úô1Ñüø`§ÌCë/ÔÇBò’;Å…4ã"ÆGn­FEÿ¥…Ìöeí¹¯âúÊš@ÿè+ŸYŽüj_|ƒ(ùIĹæ’³+i­GAo›äÚ©pÃö»[®}Ü÷UP»DÇ ¶nب–´~»ÞÇ” ƽGcöfô²Õ/º0ŠÒ*Ž*ÅG¿¢¬?ÿùÏtòäIêòàƒôàÐ÷ßO÷Ýw­ZµŠªV­jMÔ$‹##A,Ê܇ҸðwU¬ƒwKÛ¹çƒ88Ayh²üFzÂ-çfÝ”»,ƒepá%bøûÒ Ó÷… # ïW=œ#òòu ºxí‹üB”3ÏpÚ7ðš{ÙnQHE=’Í;]ÐË—éeÍÕ9L»$Ò^NØlñ;ô߯F¡~» ä7=Zò‡÷;Ê'd]EéG•ã‰£?þñtüøqêоµkwÝuW[jÛ¶--]º”*V¬hMÔ$‹##/àû2¦PPrÏ7ľF0úáÅ3€tcÀaZ–2Ä@úy˜{,L˜€²çóõˆj_´Q|Õ’G„i l8 ò\<äèåËô²æ‚ê¦]i/7ì"ý! §ö·6ß0é™iéçAù¸î1ëÂ(ŠH§8ª$ôÍ¢… ¨qÃzT§¦E]rÉ%tôèQjÑ¢95oÖŒš6mJMš4¡ùóçSéÒ¥­‰šL8r~ˆþéW›œñãtܲss£ŒøÑyþê—ËOøêSÎ^FNœœœláŽÎ ~yüKdô¸Œ¢îSܾ§â–°÷´ [üäïû‡ï·£Õ9È=¥pÛæþ«¼líƒ6×Ë âáØr=dÙcýæü¢óÑÓUpÒ÷]gåïxÛ⺻Æ×ÆnyË®·›NÐ=eKWÅÉÅ“h3ŽÙ¾HÃ* S”G•1R–XvÀ b¹ÞÒÙVgÀz8iúìCTþ2:åÑËèçfš®ŸµÍMØê¿®…Êþê%|(,a­iÚòwë©Š Ý=L˜xˆ„õ/×ÔÒeVeÕrëù„Ì7TzfZúyP>÷Àºø®£¨ ½â¨‚Gó©ñMJUtÄÑ^Wýî·¿¥#GS½zu©nÝ:T§vmªU«Íš5‹J”(aMÔdþ‹#§Ó‰ê¸­OÝðŠtŒr×÷c—úQÉw?ÚÔã•+°UpâxÞ ßÓ:òwãçí¾/x8õŽ6ÆAîy‡þÛÕMÀOÏ_ k»žh㸆ݹ–¾Ažµ úý'ŽÐ˜~z[¼T¿XvK9ï7Kº*Žª,ÚÍ+?üÌëksyùë©kŒ²ú ûiÇ¿_[剽Ò]ÿ-¥a¸Ç<·¥)êomsýJ`]#íY¨ì/â«üõ㨰iæ¹Ï"÷šž†‘ž3®íÚ(¥§£M½:éл@Py „JÏŸ–¼Œv®_@ùõcßõa¤SU¬Pž-˜O7 qTÛGeË\G_|1:xªU­BU«T¡*BñgW®LÓ¦M£+¯¼Òš¨É|G²£ 6„¾.êôCs€'¶1ñ“'Ú8 ½ òxñ\ÊD£ócr$rŸºOD#V)ø ¼§5åo ú¾Ï(ýfòë·¤§+øéí®… ºžÖëd?èZ‰b PF7Àσî]î¨~+°ì1Ê!àÝSAéFÅ1Ëeæ©ç—_ˆ®G\;àÖ/œ žõ0òNªÝý<‘°‚®yP]‹œýµç•¦-ÿÀ|t÷0aâÁë 5Í]–/Þo™o¨ô–ÞVzø |BÔ…Q$‘nq´PG• qtÑ…Ò¨|ùrT®œbYzã7è_ÿú—5Q“&Ž\8O§4ãºsÆ8¨sÖü|ù›?üèkTy¬eçz‘C"÷©:W'ÂßÓBßk!ïûŒCÐo&¿~Kzº±ò€ŸÞîÑaý×>±6ŽÜ'–2ø®¹éë:+èîÚqà½Pö°å}šå2ãØÜR £L¾²£Nzùô²#¨ñû ,kP=bå­ÃÌ;Öy"a5Ä,¿¥®EÎþaiÀ|t÷0aâÁ «ÚOw×Û[CT}Âæ&½Xiù…© £("⨂Ð<Ž8ªG¥5qtÁÐþýû©té2T¦L„Gÿüç?­‰šÌwqäþ8üOdü@‡äøãùÁ:•úA9~^:Q?â?<¹P¾t×Ó³ÿXÍòD—=8.£°"ûT¿§þžVÇAù÷`Øû>À'ɶ6 rÏ;ô¶ÕM Ýu?{ØÈõpŸ„û¢íå®t‹´ }×ÔL×¹v‘4 ÿP}•înÜ˲ìú=b†5ÎcÝoô¼ýÜl_¤i»æ2/ýIµC¯âùû`”)A;ßÕÃÚaÚ͹_¼úÈkTÎxç AýJáûª÷…î—`»ñÛÞWÏG?Ž ”fþümeÔÝĉKXÙV¸¿5wy?Äúí ä7½XiùYÜmua9¤8ªâŠ£½¦8*S¶,•-WŽÊ—/O*T 7ß|3sfŽ$œϘɦrÓ~ š»í…PçÅJ-‰X~ŽqîÙ9”ôä*¨<ÞÛ¥Sx\FA˜ûT»Ÿ4æ垎ÜG–üÝ0‰ß÷ £¼ÁJ{ª¡·­ÙÎ~DC€6èzf¿àŒiîÞ1Ü£ÊË?¨üº»ÆÚo¹ðÕ˼gœtï©Pý¡ÿÜß¾Èߟi>À,S;t½ƒÚ2°fÞiȇfš^QN/ØmlÍÓüÜ4eVAuÕÜ •ýEüPâHÀ–¦5K\_}¨x#ÂÊænƒ-íi©§–f¤ìi"fz±ÒŠUï8uñ]FQAÁŠ£ B]犣ÿvÄ–ÕU¬T™*‹N§JÕªT­Z5š>}:]yåÖDM¦Gå7ìŒC¢÷j<Å÷}žÁkùpOùڃˢpÏ•z¤Ü1ÂÃ÷>£È  ß9ò‰£ÿâè /¤ƒÒ 5jÒµjS:u©~ýú4gÎl*qÍ5ÖDM²8b0Ò‰DïÕXáù¾Oä“M¶ØùsO©ö•3%E ‹J=Rî‡ÂíäŸm‰š‘N9 "ÏX@y 2F~!ÝâHß­.J]„Ýê¦ú75¢Fo¡&M›R‹-hˆtÝu¥¬‰šdqÄ`¤‰Þ«±Âó}ÏH5øžb$ ¾gŒâŽtŠ#ý;GVqô›ßü†Ž¼÷5oÙšZßzÝqÇÔ®];Zºt©ÜµÎ–¨É¢!Ž ƒÁ`0 Fº‘^qTQˆ£Ô¸¡¶•·÷Îѯ(ë·¿ý}ÿ}ºã®öÔ¾ãݔӹ3Ýÿ}´jåJÙ–¨ÉüG¨ðÉ“'éðáÃLfÆ÷&ߟ©eA¶)_O&“Éd2ÓGØ\ŒõtŠ£Ê•*ÒâE è–†õ©ŽMýî÷¿§÷§»;ßK÷Þÿuyè!zä‘GhíÚ5TµJ¶5Q“ù!ŽÐ0h¤o¿ý–~þù<“™qĽÉ÷gjYmÊדÉd2™Ìô6c}ŒùÓ)Ž²­âHÛÊû÷—\BÇŸ ûìJu{„íÞƒz÷îMÖ¯§êÕªY5™âèý£GéÇ~¤üIÿ™ÌL#îM¾?SË‚lS¾žL&“Éd¦Â抱>ÆüiGB ùÄQ¶Ge4qtÉÿü8q’zøQz´GOêݧõïߟ6nÜH5jÜ`MÔd~ˆ#L·ýüóÏ¢±~d2™L&“Éd2™EŒëcÌŸ~q´niäGû”8úŸÿù8y’éÞ“zöîCýúõ§AƒÑæM›¨fÍÖDMæ—8úI4Ø÷ß_ÀœK³*Ñè½æ1“™î¥Ñ•"[£vœk ÔœÛ1²…l¥Ñ´Wºëíבæšq =3±ßA9T›;Lí}k¦ŸLã·ÕÞÑ•(«ã\šÛ1‹*Þë¹›çL&“ÉÌb¬_ âèFG•ó‰£?üNžü€º÷ìM½ûö£þÒàÁÑæÍ›èÆG?þô}ûÝw̹ÔAÛQïšÇLf8wTä>šÛA ;Ð3 “¾}wU²üæöŒÜs£Ž‹3¡ß1ó5ÎåµIå}ëO_^×J£hOT8qÊheöÒ|—FUÒÚçL&“ÉÌob¬_ð⨒G¥uqôG)ŽzôêC}úõ§!ŽÓ–Í›©Ö5­‰šÌ7qôãôÍ7ß0gKcûønó˜ÉLù¾ âìYTéñ݆ûnz¼Ru˜ížï~\ÒgûÂvfB¿cæï<¯L&ýÄâì~¼’ÿ~šÝAëÙÁçL&“ÉÌWb¬ŸqâèG¢0={÷¥¾B 8ˆ†@m)xqô½h(Tø«¯fRû¬ 4ræHªà.¹h?ó+Ú5²‚·£ÂÈ]nØ î¢‘"K6ßî&¸+’O…‘#¼wÁ/º‘|cù1‹¸Ïq¿UI»ã»a\7ÿ=iÒ¿°Þ·nÙF¶·×Ç«¿yž*F· ò/´ýN¬{HóËÊjO3eºê\°ýLÎhç™âºHwç|f{3<Üã×ÕÉîFúÆytú1Êhm”EO_åð~{Æ9ê§û1™L&3åÄX?cÄѾ Ž¾ÿÞÍcµƒ¡«0‚vâ|F;ÇèØéøËóv4Ã-O4wÒa ½ðŠˆ×n†ßÍÍ«Ý ç|ç „*Ј?¯;GÆY<˜È}¦èÄQ÷[â÷¤Î€ü í}‹²UõqÛÃûÃ]ÿ½;áR_f£mdþ…µß‰—¾G”Ï)³á®òòTw-^`]ãç'˨êå£ÎHKžkíá»Fð3ËlºiçˆkÍŸÉd2ÿÿí½w˜Å™ö=ÿ¾»Ždð÷íõÙkv½&ƒBIà€Á“”%F€”s´Íšal`±ÁÆD’@„a”PdÉxA("‰ &Úïû|õTwuWÕ©îÓçœ>iÎý»®[šîê ]]ÝUwWŸn(-ñX¿âÌ‘|¬Næ† “ýÇêfTÌcuŸþ9}ðÁBÐ@ÑÎ{šÿN²lééybÀ0p®ƒ—yO›ëºÌ£§ƒíô´3óy`` | [TÊ¥ùâ6R7ðp]ÎmRSTþUÛní²=Mó„Ùø€½>¢> V¶|²ä›K{ˆ=Æ™ùä|üâÒ÷ËšÕ&í´­eO[~` –†™vƾÛù òÓ×[uçJ?[eþÛ>ܦôííe‚ ¨˜â±~e™£ÿ£½s4y M« 2ð³ˆï½÷žÐ}4 ®3ÍÙÊ'Y¶´uu®@÷¹Â„¶Îé,;Ü÷‰eÞ¶óÚ„ëiÛùl¥9ýx±aPM(—v¦–Ü—±]–¨MjŠÌ¿ZÛ­«l¼¬þ÷×g©÷üeçŸmÙR.í!ö»ê!Çã—~âv“—‘†u|„2ö5Q~š"ÓÏVF}™ÿ¶óµ×¹¶ ‚Š%ëW¤9Ú#ÌÑØ&Є‰“iÊÔ©4³B^åýÉ'ŸÈ}ç{e7{3ÿdÙÖfš-:ñγ7;Âý©¿4!fžÆ¾:ó³Êk("}–YF= sY´ ].Ÿ¿¯ËüwÑÚAÄâ±~噣ƒ¦Ý{öÐÈë®i,Ý0~¼0H“¨­íIêqÆéÎDmÓq%U‡R¿ºN4s£+ ‚ÒT®m-n{´ÛêVžÇoãLêT׺Â:²x¿;ͤry#Íì¤×¹¼°_õ[¨Â ‚ b¨,æèT6G-ô“F˜£o~ó Úµ{7 ¿êºfäu4êúëiܸ±´~Ý:ê~Z½3Q[Å0G;wî”ióÎ8p ¡îÿ.b ~t·sÛ´Åy‹Žuƒ+ êˆâ¶™[ûLK¹¶µ¸í+«Ý–¯N É»ú®;w‹0 a]fv¢º~w{u þWëÍe®×RC‚ Ú÷¹<Öç1)ÍQ7ßÇ樧Ã}ãß…ÚE‡ £aW §+¯ºšFŽ¼†Ö¬^%#»µU sÄóÆÞ½2}ÞñÊ×bϹ Ž(Õþ]aÅU®m-nûÊj·å«Óòæ¿’¿çäkÅCó6ˆ;·ƒ ‚ Òˆû\ë󘿔æèÔ®]¨õq6G}éliŽºšæèk_ÿ:½þúúù%—ÓåýúÓÀƒhèÐ!´bÅrêÜ©“3Q[Å0G WÎÎ;ätUš¸m¢}¦«rÖ)Ž'A•NÜçòXŸ)¥9êÊæ¨å1úñ"ÌÑW¿úUzmûvúÑyçÓùü”~ö³ŸÑÅ_L GuÒ‰'8µU,sèØ”ÒuéÜ™æèGçöñÌQ·®tŠnŽþõ+_¡W^}•Î:»7õîÓ—Î9÷\úáH?¼„Ž=æg¢¶`ŽùPJsÄOƵ<öhhŽø7G§°9z‰þÏÿæè_þå_éå—_¦úÓºS÷î§ÓgœAgžy&-^´ˆ¾÷½ÿt&j æ¥4G:˜£Þgõ ÓOë& Ó)º9úÚ¶m›Ø°3uîÒ…ºvíJ§žz*Ýwß}tôÑG;µsȇr˜£ÿðê{vOêqzwù’öCì‹stòÉ' B§œrŠˆÔ‰î¹çúîw¿ëLÔVÇ6G­ÔPWOÛí¿(„íÔX¾=¬¡Õ_ 2imß²Vß(jÎZ‡úK \뜨¶Æmo{#Õ—­Ž2óÛÞXOu¢ñ·6ÔQ= Š)­9êD--Ñùçý~pNoêuÖ™túiõòIºý×¥:þ‡xC]÷Üs/fŽ$0€"ÐÚ¶#9øj­ d` FC¶o×V þR¢œ×ºJ½¶r¹¢Ìw™ëˆÏ u³@Þl©Äú€d”ô7G;Skëãô³ Ï÷ RazÒ+¯¼B_ùÊWømu_‘ §‰ k½¦ûï¿Ÿþó?¿çLÔÌ…€vE²;â\0G…SÎk]¥žqå*oñ¬‘qnðML¡ª”Rš#þ ѲeËèòK/¡‹/º~zþOèÇ?ú¡|½ø×¾ö5ªûú׿.zŸ}6ÍêÕ‹z =øàƒṯÇ:µU|säw ­|9|ŒF>Rà/g@¹cŠx´IÞ­Vé6jRf9Â|ãÂ@íC;SdÜvlÙ&m\ñ«µÝúek ¡Ë¨;z´(}¼üø:ã›/í8„³UYŽoNdN¯:¯uÙóôêÓ ·óŽ¥ŸG¬¾œ4Eô9aÛŒíÌryy8Ê™µ#gû[6„ùm9òøpY­¼y[ý±Óàš•O)ÍO=±r% <ˆ èOý.»”.¾øç´cÇëôo~“ê¾)þá…Ÿ^p]pÁùtþùçÓO~r>=öØctÒI'9µUs$:ýÂ/; ÿÒŸõ±¯ÓËè@wÚ¼¼ÔjoP¢w†Z9dÇ•$ Ô¹´3…'ιMêDä_µí–ËÆwÇý7Îso_3“©âÕMXŸ^yÂÅ/,öø dúeÕäŽb¹ÏUz­‹ÌÓQ‡öúØå„ù+bö=¬§¸s'®1ùfäam컎~Üñ±Û¶Ž÷YÕT¥4G§Ÿ~:­Y³†F\}]uåpj¸b 2„víÚE|0ÕrÈ!raàÀ4`€PÿþÔ_hÙòårÚÉ•¨­’ÍWúl˲ót (üA‹ÑAñ:£SÑÓÎ̇ïøyW\¨ rig>òŽ±ÞHrn“QùWm»µËfIû](Vþþ±1L&æø掽ÏÙ–-¢Ú€«Œ¼®˜×º¨öøØååó#®<P¹”Òñ'‹Ö¯_OcÆŒ¦Ñ×_O£®»Ž®9’öìÙC‡z(ÕvØa´wï^ºfÄ!tõÕWK­^½šºwïîLÔVÕš#õȊ짲vHz>ú`-. Ô¹´3µÑ@’·IÈü«µÝºÊæØï¨ú(+Ýo~Øû’mÙ"—2ƶ+;ŸüÛLFž‰ÚhÜrnù+Ìãc¥‘W¹ì0›„yëµ6žõøØi¹Ö@uPJsÄ?Ú°aMš4‰&MœH&L ñãoù~øáTwÄGо}ûè†ÆѸq¡ØQ±³r%j«âÍ‘ßyÆÝÙåŽÓ ç´ÂŽÖëPõIKÇèÔâÂ@mC;KðØKò6©þŽÊ¿zÛ-Ϙw×e+Ú#DzÝ2V]9™†¬S5+Ê=˜wå·lSîk»|vž™å³ãyûÔ‘<öIÊYŽÌü²—K_¶Ãl\qyèíWî‹ž~ÔñáòZysÜ¢œP|JiŽz÷îM›6m¢3¦ÓôéBӦѴiSiÿþýtä‘GRÿà S§N5´qãFêuöÙÎDmU¾9b¼ŽÆ˜ÈW­Ó:Wm½ëGÊÞlµt$qa vHÒμX¸ÎS!mÒ<¬4ýmª³Ýêu¥öÓ®¿dãܱëV ¯ZÞ\YQÇ,/\Ç3nÙo–±v•{›ÑÊ•§«ÒkËFü††„esà,‡VÎ^§¶SiÚÛéË®4táÎ}×Ús½ØOÝôDNÊ2â¼­^w0J€*¢”æ¨OŸ>´eËš={v Y³fÑ訣Ž¢:þ‡x¥®Í›7ËÈ®DmßUÙ:JÒ"׶·=Ú-È•r·´Y‰1SdÎ$Åþ *Rš£¾}ûÒÖ­[iÞ¼yRsçΕ⼿õ­oQÿà *@‰Gv%j«rÌwšþ¸@ź«lƒ”Š\ÛZÜöh·ÕI-_ë¢ò/W”ïXÈGí„ 2?•å)U[€t(¥9:çœs¤9š?¾¡ sdoÀ‘8²+Q[˜9bÊ=`µC®m-n{´[+ån3h³ÐÑ(µ9zꩧhÁ‚†2Ì‘½G‚9˜#À€æ0G €9*)ú›ð–#P)˜2Å7IbÐ?âiØR†霖ìÔÒVåˆø¸¦z­rzðõªÔ¯dÆõR¢·9!ãc«õâŸËþ+µÍm$樤 ³HkcØå@ ß%qb1(m¨ O¾vĘXボiÁy•œ Ã홟Ðô˜õb"óc¬ùQ£õ¨i`ŽJ :{Pé ]F{'^ bëKTwñLjgÒŸ1àoümŠRd•6ÿÖifýpYô2xñŒsÛy ÈÒ.d:ù^\iGäW­×K6!ê¼Ñÿvm›´þåv*\‡·µê…Û¥k¶ÓpÎ"&)o–É«;?¿ A}ÙNÓÓÎ÷ùlÇ$­#£® `ŽrÆ»@g\äwèø¢v´òΞёˆ‹¼º°ËÎ I˜Žßùhq‚rE–GKGlãmoÅ€\ک‹çܦu"ò÷ãÖîËwîÔ7ú;Îu£mA=yÛ§¼zÚqùp˜L2¼¬+®ºĶ FÄ3Ž‹7@ÕåŽ^#×KŽ¯ò×ÿÎØ6"MWþ¼A::úyê¥]ÿ®·EÂrÙëc—]iŠ²©‚ñ>RWñ:g@þÀåŠìxxÀ^à›Ý‘è _çõ/*L.sð Å‰*OÏ—L43?PåäÒN}äv}ðÕ†"Û´FTþŽí·û²b—M Pùµ¾˜ç‘žv\>¦×»µ­L3®1íÂCìgCƒÐ¨vàÊ×u¸ë¥;ŸŒ4#ówCŽ6'gÍ\eÒ·ÕIX®Œ}[Îe[k}.uEæ(W";,ïn§ß1ó¶‰;{5Øâ¿cÂŒüd˜™$£<β»ã‚*&—vª–Õ‚Eò6­‘¸­%l÷eÇU6^æõÖ@®(ç’ž¿]ÓëÝÚ6ÇvQ0¹äÛ¶ì}NØnŒüÕ1ã¿í8åIԆ㰶ͩþ#Ú¿‘†–¾4vÚž`ïkÜr.ÛêXësª#H˜£œñ:¬¸»W|ñöÂù¢^Ľ‹ºÞ‘hédtxaúcr½žž«ãÉ,OfÙ£ã‚j%‡všàÑ”ämZý•¿Õ“¶û À˜Y‹ˆë<ÒÓŽËG7Œ½­UÇÂc­Ãñüý•ÇÅ6„QƒÕ¹^êù瓽mTš!Fýg´3;¾™¾¬3ý\æ}vžÛIËeoçÏàXËò©pWšqË ×v9Ô¤ ÌQ^xocP ; µNëÌ´õ®{?BÕÒ‘Ä…y“\_ß@ QwB£Êcl¼Â›qA!I;ÕÚ“¦BÚtØŽùûÛäÞî+½®\狽ÿi¢§Ÿ9ptlëºDëNǵ> 7̯¶U±×KŽŸÈ r­#Ì>'2Ó—&^/‹Á'a¹2=mÙ(Oƒ¨Ó ;ÍlËŠ„eqÕ¯sš?Ș£Š$ª Òȵ­ÆmvŸ <°¬©#Ú6†»^Œß–@JÀU$èìAµsT‰ÈÇ«jfÔˆvãÂx ´CÂÇ=ßÙLˆæ¨"Agª…\ÛjÜöh÷ Ðn¤Ì`Ž@P‘æhþüù†¶nÝ s(*•kŽæÍ£y¾ØõíÛ×™¨-˜#@>”Ú±ÏÉjŽæÎ+5gΡٴeËêÓ§3Q[0G€|(¥9êë›#û©¹ÀuÔQtàÀš={Íš9“fΘA3¦O§M›6ÑÙgŸíLÔVÇ6Gú[™ð†&æ‡`ñÝ|¾…uäIzýuÄW 㺓:ꃦü=*ùÁÓèúµ_Ë.—ULx²òk½Ãˆ£¤æ¨oßxstä‘GÒþýûiÚ´i4uÊš¥4GgŸÝ›6oÞL³çÌñVä½o!0G‡víÝ»—®»öZºfÄÕtՕéáŠa´rå :õÔS‰Ú*¾9ò;¯Vy6p£?êýñ×cL®u¼:̧¾±Që83Ëæj‡Ú™"cðåØ6²MÚ¸âw„vë—SMÿ›±—Ó"³n¸>«öº׆´0o“ÓUËBA!müüýGÖ„Œü3Òõö=ØFÎ6Ð%Á6B‘yE·í†>&Ê ÛÛ™ûâåí—[Cÿ›ãjõâÃÆÜ‹oÕY’óVm£Í|0)¥9:ë¬^´aãFš1sÍš=Gš¤9Â$yæè(ª;äCh÷îÝ4lè4h õïw9]zÉÅÔúøãtòÉ';µUs$:½“ :9µwçØêλz^^jµ7Ò;Q­²ãOjƒ\ڙ‹çÜ&u"òïí–ëE•Q–Y?ßy¹e¶êF^gªõº“-}-Ž(ŸWfk½?•°Q'qéò6ê˜=¯˜z ë8îÐÓ×—í¿­c*÷‰Ã½¼Œ}uým ¥ÇÛm€N)ÍÑ=Τ'ÛÚhÊÔi4}ÆLš)MÒlù~CÝAD;wî¤K.þ9ýìŸÒù?9~ôÃÐÃK–ÐqÇëLÔVÉfŽœc/[ȃÕá1r½Õ‘ò:£ÓÓÎ̇ï(z}b\¨ rig>òŽ´ÞHrn“Qùw€vËe ëÄ.sD}L¶|²ä›K{ˆ=Æ™ùä|üâÒ÷Ë£f=¤dYöObo“$]ÞŒ ‡^Îy¹êÍŽ'·IrèËößZ|Gzª-õì,Ãf-Ë~(©9ª?­;­]·žn˜0‘&O™JS§M§Â$æèë_ÿ:mß¾]¢Ò9çô¥Þg÷¢žgö E‹ ï}ï{ÎDmU­9òQÉÈŽŽ·M]u·ì‚·ñË©ê¶d׫|‘é ¤©ò¤üDøÑ1}9»¬åŒtï0Ž§4iþñËš—³Þìü^§¶SõWN3Ì07Œ½~y=ƒé/ÇSµ?ü7Œ8)¥9:áÄ“¨ué2”ÒýÇ|?øûãóéŸ_Fý ¥áWù~øáT÷¯_ù ½úêktvŸs¨OßsèœsΡüàZ²ä!úþý—3Q[0G€|p™#6=Ÿ}öY¤>ù䓼ÌÑÑÿñôÀâ©÷¹?¦Ÿ\øsùÛ£+†_E{•9úÊW¿J¯ñwŽÎ;Ÿ~rþùtÁÐÏ.¼€{ìQ:¾b> 舸Ì O<‘Ž>úh)þþj÷îÝ©¡¡n¼ñFž9úîÑÿA÷/ZL½úü€~tþ…tñeýièÃiï^ß}ík_§í¯¿Nþüúù%—Ð¥—]Jý.¿Œ–¶>N'x‚3Q[0G€|ˆ›9ºè¢‹hàÀ4qâDZ¸p!­Y³¦ ™£ÿîÑtÿ‹è̳ϡœw]téåòwG{÷îõÍÑ׿A;vì¤Ëú  þÑ ÁƒiØÐ!´bÅrêÜég¢¶`Žùõ›#eÆG÷ß?=ýôÓ1b’Ÿ9ú.ÝwÿÔã¬>tÎΧŸ]| 2Lš£ÃØ}ýÂíÜEÅÊ¡W\AǧW_E«V=A§víêLÔVÇ6GúÛ ðf/æÛÃðý“(øœSõ¤Ÿ{zýáÍké€k]nä[G¥®ÛÌüÔ«Êùuã™X€Ò£ÌÑ[o½E|ðá3ر!Z¼x±aŒXy™£÷ÌÑ={SßžGþüR8x(íast˜0GßøÆ7iç®]4´áJ~ÕÕtÍÈ‘4jÔu´víê~Z½3Q[0GäHkcØŽä×õ1Àwa Þ¸žüoóèß¡Iã›4€)çµ®¯­ù–¹Ìuk|äÖüP-” eŽÞ}÷]9cĦGקŸ~JŸþ¹ü__ÏƈÍR®æèÞûï§Ó{žM}~pýô¢Kh@`Žæè›ß¤]»vSÃU#hÄÈkiÔõ£iÜ ãèÉ'×Sg8µs@! ]¹±nÁ Î›5 ü¯‡¹Lr^ëªñÈ·Ìå­[¾™`ÌñMÜ\”eŽxÖH™ž$bc”«9úοÿ;Ý{ßýÔýÌ^ÂýØ3Gƒ†èæè Úµ{7]9âZùuØ1ãÆÑÄIiÆ Ô³gOg¢¶ŠoŽü‹{+‚ÂÇäc9û£®Ç˜\ëxu˜O}c£Ö±d–#Ì7. Ô9´3EÆ\Ƕ‘mÒÆ¿ŠÛm0«Æå´ö'(¦½œ^º |ñÍ—vÂÙ¾,Ç7'2§W׺ìyêÇVmç Ôý<‚dõå¤ù+ìrxËAy˜`V23mÞÎ]ÿYÊa짞Ÿ½o6^xövÇÅÓ7 Näqå}·òæmÕõG›€R¢ÌûŠ(¤þw)ost.›£‹MsôMß]uÍu4jôXºaüš2u*mÚ´‰zõêåLÔViÌ‘¸ÐëpyÑ÷/áÁ* ¯3Ìè@9žÑC2^^jµ×)ªÎÄ*‡ì€’„Ú —v¦°j9·Iˆü«ºÝzûd ¹ÌúùÎËÅ(³W7a}Zùˆc%Ãb¯@Ö©Ú‡Pî(Öñà´ÅrP¹\%׺È<uh¯]N˜¿ÂUk› oÑJ›·Ëîú+‡d‘S^?nx ­íƒ:ÓÑ·1óÎ<®vûÑÖñþ©ý€¢ÌQ”âÇéÔÿ.åkŽø[GsÔ?Óí¡«GŽ¢ëÇŒ£ 'Ñ´é3hóæÍÔ»wog¢¶J6s\±³-[ÈŽÉ1 ë­¯3:=íÌ|ÌN5* Ô¹´3yçWo$9·I¨ü«¶Ý:Œ£Ü?»ÌõQ0Vºþ±Ñ Žø<‹+eŽ\Æ'‰ò7G? ÍÑ˸öz=öš8i ͘9“¶lÙB}úôq&j«jÍ‘zd"èÔôÁ[\¨ rigj9¢$o“‘ùWk»å²éû£qêµ:¾ÞóǪ›o~ØÇ#Û²E.eŒmWv>ù·™Œ<µÑ¸åÜòWØLJ—Ù0©ÿ=R*‡c? 3GŽ:3ÖkçDÖãj§åZ¥E™#69ùª8æhÜxš8y*͘5Kš£¾}û:µÅ… ‚ ‚ *—\>ÅV†9ú™mŽ2ÍÑ$aŽfΚM[¶nMlŽ ‚ ‚ ‚*]9™£1lŽ¦èæèg¢AAAÕ¦Àõ€9‚ ‚ ‚ ¨†¥ÌÑi=΢³Ïù!áÏ©ßÀÁ0GAAÕ–ØÝ#ÌQý=©WßÐO~z]>`0G{èP˜#‚ ‚ ‚jEßþŽ0G÷ÞGݺ÷ ³zŸC?>ÿBºôò´›ÍÑ¡‡ÂA”›îºë.)W±ÐF ‚ JÕ·¿óºçž{©kýéÔã¬ÞôƒŸO?¿ärá‡vÓ!i›£ÆÆF?~<5ª¤â<9oW™\Zºr5-iYJ>úxIÅyrÞ®2¹T-õ‰rÆ«£•“½Œ+ÌVµÔ9”®:bA[† êúÿ¾ýZxÏ=Ô©k=uïqõýÁè§?»˜víÚE‡rˆgŽv stÍu…™£ù ÐÍ7ßLo½õýóŸÿ,©8OΛËà*›®G_FkŸÜH}ü±3­bŠóä¼¹ ®²éª–úD9³«£•3éÀ·ZêJ_­ -Cuýßþ6ݽð:¹SWêvÚÔ«?Z÷SÚ¹s'|ðÁº9-ÌÑ„¼ÍѸqãä×i¿øâ úX˜€RŠóä¼¹ ®²ézè±VçúòË/éÓO?-©8OΛËà*›®j©O”3»:Z9“|«¥Î¡ôÕÑÚÚ2APÇ‘4Gw/¤OîD]ºFgò£u?ú íر“:Hš£ƒåFŽCco˜@“§L£™³s7G<ýÏw¹ô‹ú‹Ž¦­¾Ð©-¬?]H›}mºëBÚ(´áB¸Ú„ÖßéiíÒšß_H«…VÝ~!­ü~ß(#/ΛËà*›.~¼·ÕMËÓO?MëÖ­K¬µk×Z³fM U«Vzâ‰'hãÆF^œ7—ÁU6]ÕRŸ(gí•3éÀ·ZêJ_­ -Cu}ç;ß¡»zæ¨s×z:ãÌ^òѺ×wì ž4ª;è`Ï]wýX7~"Mž:fÍž“—9♑>ú(Ж?ý”ÖÞt¼¡5¬_O«…Vý÷ñôÄÇÓJ¡¿:ž–ÿòxZ&´ôÇÓã Ž§–ùÇÓcóŽ£GæGÏ9Žš}-žu-šy-½å#/Î;Içá2Glx–.]š¡Çù[£é3fЬY³iîÜy©˜£Í¢óàŽƒ; Vp7Mëà–ÿwWzem#ýýÓ÷èÑù'ÈŽï¦=¨ßMßM»{ÊqÔ<ùXúÓ¤cé¡›òëä¢ÌQ6c¤Ï}þùçô—¿üE®wͱ)RJÓEÕç—ÿøL6ˆ(þïÿþ/½¹}=-¿õüÔë3[9×þ¦íñA9Ðe½ñƒ´îw?¢ÞÚFÿì}úòïŸÐgî£7þÒB«nÿiÑŽ{.õ©Ú窦3hïóÒ{»·Ð®gî®>hŸÏïLÝx&="ôð/Ϥ%¿8“z`nwúó”ã+®œOüþ2Yÿ;Ÿ{”ùõ¹•³¯k_ÞݱÎ3nm·Ék»»6ÉôuÞÞ¹Y¶—ÖÞ*—÷¿º>•¶ñë›nÊY®t Si·»ßàÇÓVÝÒ‡¼²’ÞÞÑFOÜöã¢öù–ó‹¿}DÿüòZ2¯Sêå„9‚ ¨–•Ë5°sçδTŒÏ/¾äºD˜¢þÒà!CåÛ»åÀqÄ´ÿ~aŒfÊWxó#uóæågŽø•£ï¿ÿ~ MwýTv|7; –Þ¹-ÿu7ÚõÔBúß~)GÏ=!èÜøn?{íÝM;VtÇÒŸE§q×Äc鎥Åÿ}¾‘礓ËfŽâLÏñÿŸµ}ûv¹lϱî»ï>)NSÏ+s”´>¹îv‹Añ2a4›çϾÍõú\yûÏè¯ïl§÷Þx‘–ß~iªõ™­œ«›êiÿ_– –yãŇiÓÂÁ²Ì þ›õÏ/þF/­ûZýÇÁ´òŽþÔ¾övÚúØ\Z8£SÑËi·OžÍ|ëµUAÙXo´·Òà :ËöùÉûŒ0¥/þñ9m|xN‡.g.ß$ûòþž­2½×7ÝA­¿8ÑÙ†I@ÛÖÿ^nûÖΧRiÃlvôó3›`Ž’)í6¢÷Ïç£Ó[Û׋¶ü¿²=¿³û)y+V¿‘o9¿üâsY6Îé”z9aŽ ªeår ¬¯¯—o”6l]qE]yåU4âš‘´wï^:ìðéîÈ#¤Ьٞ1âY£yóç§fŽ‚»i¢ÓP?ú³âæôÚ†ßÑÿþï?åÎ0Î9Á»›æwênÚŸý»iÇã¥;n8–¸1¿N.Îe3FJŸ;dþÿ¥—^’áúl‘2Fü&Œ´Í‘«>¹,üø\Ô›¸>Wß5ŒþúöëôÖŽÍ©Ög¶r®º¹žöiæhï Ó†»‡È2»àõ_Š;φñ߯?ó-œÙ­èå´ÛçS‹®¡¿}ò¶_*Ïþú&­o¾BÖç‹«o‘¨½¶õz•µåzE¨½­™½µÅ•s× ­²>?m൧*¨œ…|í}yÏ7G}smßx½"ÚòËën‘âGè^j_#þÆèýý/ÉmßÚ¹5•6¬ÌÑC-wjIË jY¾ŠV®^'·+‰9zv>ué2Ÿžu…¹”ëö.¥‘†¦´Ûˆjïüèõ²›ºÓ—W}·í·vl¢GnìU”~#Ÿròõ8Ê-šÝ)õr•FÏÎïB]æ?ë +†RË/ås¼£*•ú.¤®Uܘ4JÝ«E¹\{ôè!Çþ×]7J^[GCcÇ“OÒñ¤QÝQG%ÍÿÎH£yóh~æè½÷Þ Ôö‡ ‚G ø7ênÚrѹ½¾ù.ùck}Ìw†Ã»i¢ã†¼›Æǯãø½è8~7öXºï—?1òJÚɹÌ«(‰)âGçtsÄúûßÿN/¿ü²\¯L‘2F,NOÏ+Ws¤ïcT}r9x@)Ÿ¹gc$L‘z–]Õç½3N¦mmwÉGìÒ¬Ïlå|¢Q˜£MsÔÖlÎÅñÚÓK¨yz·¢—S¯Ï¥7v¥[ïuõOùÌ?>ÿ«¬7žá|¹íô€Øp}Þ7« Ý;³ -œÑE”± ýyZúãäNô»Ž«¸r>ÖôSYç¯n}î™sfAåÌu૧ïÚeŽráÍ[Siú9zê¹— =ÿ—Wè¥W^§í;vѺ'7Èí"ÍwduuTç« Ž+׎µŽX)44¥ÝF¸½?&Ôúßõ´óé{ c¤àö½ëùZ¼àÌÔû\Ë)ßD'®ÅQæè¾™Rïß`Ž Ô¢AÁù+5hQôvzXÊçN†ìüòU±ËYiÊwÓ¨ïBêZÅK#ß2ršZ¯hƒ¥a9Ñ  üƒh‘'—k`¯³Î¢ mm4qâD©I“&Óä)Sä“tºê“?âr¼¼îV9[ôþ¾éûX곿¾Eœ$ÙàgÙŸâYÏÜ óÝÉ4ê3[9WÜT/¥Sì~þaZÿçäæèÕ§–Ð]Óº½œz}®ûã%ôÙ‡ûeþ½ó:=·t>}ú¡÷xÚÇïï¥ÖÛ.~ ßí-E}æ[Îô’3rYÿgúƒ0F…”3ׯž¾k_ÞÝ»9: ÌQuî2Gϼ°^|é5zeûNÚ±kí}cmÜ´Ynç6G|ÁîBóŸÕ– é\síX 鈕ÒHCSÚm„Ûûò›{Òžçæÿ‹ÈëßØóÒôà¯Î-Ûy©ÏÞG™£…ÓOIýús”¿øN¼=ØZ4(sðå‰Ïw-,ås'SV~ùªèå¬0彿)Ôw!u­âƦ‘g…á´H-sz¿UA’Æ(sÿ ª Ê/ÏY«ŸÍåØ»woÚ´iMŸ>]jÆŒ4sæL9YÄ“F9R¦ÈÓz*s´îŽ »i󎧕·œC»Ÿ]œx`¬óôò[èD§qëècé·×CÍóÏ3òJÚÉE™#}¶ˆÍ—1qšê7HlŠ”xYÏ«sdÖgøF2ÎÛÚ[ålÑsËIÛž¼SêÅÕ·‰ò%Á³ìÏ®ôÌß¼;âê3[9—ýw½œ-R°9Z{WrsôÊÖ%ô‡)ÝŠ^N½>·­ûmP¾Ï=L-èNû^Yãëÿ¥çV6Éúüƒv··Tõ™o9ÿ8éDÚðð\zø·ýèö±ÇTÎB¾®}É×¥Qçº9zæ…—éùöW©ýåír¶hÏÞ7h¿¸P¾õÖ[ôô3ÏÈí¢Í‘«£z–æw /æAgôwz¢“a|lÐ"o;ïo±ìÃð:½ã0ûÎYT'³í|ÑÉxëõ<9ˆ2çئÝFûE'Úùô}ôÏ/þ.Óãÿ÷KÚùâ2úóôú²œ—êwr|=Ž2GÍÓNIýús”¯¸ÍÇ´qy™áá -V۶ʔË5°OŸ>´eËšÍ?)š=‡æÌñÄ~ˆ}Q†9Z°`T>æˆßâ¶cÇŽ@«þç<ÿnÚñ´¼©—|#wnIÆ:[…9ºÅï8š®;†þ8ûGF^œw’NÎeŽÖ¬Y#~<.sÄâŒËÂ3HlŒš››å«õ¼r1Gqõ©ßä¼Û×Üê½ùhÆñB'Ò=ÓO¤»§žÜäŽø™ž9ºÝ¿;™F}f+'¿9mÏ Kd¾Ì.1ˆ_óÇäæèeaŽî˜Ü­èåTõùð¼“åì‹bÍŸ‡Ëßl|prPæ߃îš|Rp··”õY åÌeà›d_ÞÉÃí}k*û¢ÌÑ£KŸÐ½öú.Ú½ç iˆøq&õ›ö—¶ÉíÜæÈë¨äßž1ÒPëÞqòß|±·: ÙqÉNÀë„ŒNY¥—ÑqÅl«wJzž* W™ešÉ•fytÁ)´mÝ-ôÏ/³#¤ö¶…tçäSKz^oÌãGš…¢ÌÑŸ¦œR¶ó²$Ï mÐeË:Y|>úç_ÄNO#Á9ïm¦æg VĹn­ËQF;m½ì2ÜÞ>n_­2&¹¦Èx1udo¯Ò‘ñÂr3~A9y}e ê»2é«|£ê=â8éy‹õò¸jyƶ #_­NtùØÛF´7PTÞa¹½ziF­ÏˆãÕ‡2P¡‰²ê/c9·k`ß¾}åχ¼§æBe˜#eŠÒ4G+o;/xözéͽho»0&9tp:[–ÝBM£Ž¡›EÇÑxí1ô‡YùurQæHý®( sÄo­cc”¶9Òë3x‹×LÏýE˜£{¦'ßH§«“úüczgï‹ô{Ñ ?í›#uw2úÌVΖ_u£Ýχæhç³Sëo/ ÷¼L{ÚŸ çVü†ž]ÑD{¶­¡Ï>~Wî‹Î¶-Kèö §½œª>Ÿ~djP†ßzMŽã©yʱt÷4aFþú–\ÏáëO—w{yPsëècJVŸ•PÎB¾®}ygWîæhŸ0Giì‹2GËV®‘ÐíÛ¿ŸÞyçùúä?þ8Ðë;vÊí¢ÌQ yÁ×MRx7ïFúëo}Z¯:—$ëUXÒ4xÙXï(³Ú>¡Òl#m ¯¤·wl¢÷÷·ÓûûÚé=!~|ÎÅ;o¼Doïý‹ÔÏв?)Ùy¹ñ¾kè£ww×_ûz¦ø»¸.+}üÁZy÷úM‰ÎKÈ’}N$‘ÇþÛØèíùo}ŸƒÚ@2r;-L_Îv®»Êh6õísIÇÞ^Ê}M‘~?n—±cÃxzößz~r=§íçÍÛ(ÅÅSÛëÛ¸âÚiDý­§«â©<ô4õíT¸ž–ž¶k½žk;©ˆ:1Âm3¢o/¹ìÌ#b}Æ:?/ùÄ„c½jãÆz+o¹l­ÏXÎíÈþ†Í‘ùÔÜüâ™#~´Liù­çy/¿9­õæ¾´ãï›7¹²yé-²ÓøõÈc迯9†~?ã‡F^I;9—9ZµjU`ŒxÖ'ßÇê^}õUŸMÑŸþô'©BÍ‘¾v}ª7Ñqþ/®¾U¾ùè©ÇIYw'½¸öNzAèù5wÒ¦G)Ÿej¹gŽÔ 2úÌVÎG~Ñv=š£Â=0§žº±¯ÈŸüùOS»ÐŠ?’ƒ5ðáÿŸ_w7Ý2®SÑËÉõùÈ/N£7··ÇôÙå¿ß$%Êùâº?Èr1o¼¶‰þ8­»¼Û˃šRÕg%”3ׯž¾« K§@ˆwIDAT¿9Ú¾5•}Qæè‰5ëé}ûéí·ß–3ElˆxýgŸ}&ÿß³w¯ü?«9’2/ÚÞ`@[§w®¿íÎEuI׫°¤ið²µ>£Ì9*Í6òмÎôð/Ï %¿èA-èA‹ç÷ /¿ø›Lßæî9gÓ]ÓÏ ?L;ƒî˜r:ÝvC§’—Kæw¥VÞ$_ˆ’yþ®þý~r÷’—-nç®AZœøŽ¹G?wìóK)jõwF<»L~~L!;./çp®‡²Î÷¨í³¥±>ë5Eçú›ÿ×ë$#N[äG¥§+j½«¾]éñÿ®2ùÿ/ fñ¬øºìõVÆz£îbÚD «N‚uZ™ÛZÇ)iÙëüüò5GÁ¹–½L¹š#ö9¶÷)‰9ZöÛó‚Ù õæ4îàv¿è½!6µÞt¿q Ý>=¿N.ʱ©Q⼪gqz|w_ã­#Ö’%KŒ¼ 1G®úä7Ñq^Xu‹ÿæ£ãè®É'Ð&@wN8~?þaŒŽ£[ÇK[—yæHÝL£>³•sÉ‚n´S3G¯?ó0Ý7»[ð=õÌ=¿¡‰Ÿ¹¿÷—?¡ÝD¯¿ðmli¢»æünºöØ¢—“ësýÂôùGÞk±ÿþÙ‡´ñ¡iôØ-Ó£¿½˜ùÍÅ´aÉù} æ³ß£Ö?\gÜí-E}VB9 øºÚðÛ;s7Gos”ƾ(s´¾mc`Œx=¯ãøJü#M^ç4G|‘Ö±/Ú¼,:çc8®¿­øQÉë­í=%Ü6"O¹^/sŽJ»Øo0z\íwãO¡[®?¦,ç%—sÑœ.ôòÆfçÛôløºýê3­ô?»•ô¼„2åÍ`è2ÌûËò\ÈÄ3 2\Å5Ï»@úùåú[_Çr<¶ååÇE;ýˆs]®Ë-×Ë4#Ê(¡Úz½lZÝdMÇÞ}}Ü5EçúÛJ7(‡X?(HS ¤ýx¹K²¾åïg¬rè[ñõ2©õœŽ·ÏQõqœ\iëýŒPd›q£ëÄjËÎm#Ú‚ú;¨WwÞz¹ƒ¶µ^ÅÑÊÖ™ óòóö×ÛÆUmŽ^{íµ@­¿9Ovªsó¾ëp¬×Ó_Öýþñ7óUÞ¿»áÿñ¾Ë}lð8ÄM~§q£è4~yõ1ô‹«Ž¡Û¦ýÐÈ+i'ç2Gü!(6E®¹Úß-bq|eŒøUÞ/¾ø¢ ×MÑÿøG©|ÐÈ+Ws¤ïcT}r9ž{âùÛ"~„NdƒõÖže}n^ú[YÏiÖg¶r.ž×v<š£íO/1¾[¤¿¡é–ÑÞ †Ÿ¹oLù¸'+çCA{TÇ×%þÊÓ-tû¤Ój®œ¹|õô]m˜¿Y”+o¼¶5•}QæhëSOS{ûKb ú:íÞ³‡ˆkâ;ücø÷Þ£wß}O§wävî™#¯ƒ•°:½sâe½“pý-;-=®¶ ÂüJOCW’mÕrFV™sTÚmD~$U{Cäæè¶q'{×a6Jy^êå¼wÖ©ôšÛé ëS:<óõbÛýâ¼ì^òórK¶‚óEH ¼äyä8xpçoÃ6Ž#tÆy'dŸ_®¿í8ÁàS“ÊÏÚVuZ\Žã¯ï"Ìž‘o°½P–õzÝdM‡×©pCY®)z¼ˆ¿U=›åðLG°>èçx\lqÝ]hí«ãog™Œt½òE–Aåå¯3Òpm«+²M¸ë$£Ë°&wýEå/×kmÌΛ ¥¶lô=®õA˜Þ6ô>U_¯ïWæ9R±æˆAyå•W=ÖtÝçw §'¡ÞœvϬîôìÊ[Gn{¼|äKÝõ»É¿›v£è8ønw DÇ1ÿÊcèÖ©?4ò⼓tr.s´bÅŠXS¤#ÝñÿÏ?ÿ|¤1*Ô%­O. ¿‰Ž ?B÷Üê;éY¡gX«î¤õÿRÖç¦VÏqGœV}f+ç¢9ÝèõgBsôšÿÝ"ùCd6FÒy¿*æqÏVÎeÿs }â¿›ïú²©üÛ§ú\ˆ×«»ÂŸ~ôÝß8 æÊ™ËÀ7n_T~sÇ™^.ìæ(}Qæ(©Üæ(‹¸sul•¬ËœvQý†zÃ[”9úíØ“ËrýÈèßfŸN/®¿+Ò½´y Ý1­Wªå„9*µx –9@ËK<8Ìz¾¥˜_%*Sªºë`‰ë;/•¨Œ¹´…¨mÓnOU9z¤ñ<ÿnšè8´»~ÜÁñ¬Á§t¡ç×Þ% Ãr‡n}|x×OHÝM㎃囹Žcîðcè·SòëäâÌ‘Ëé¦H½ž›ãóËøñ;^eŒî¼óÎTÍQT}rüÒ†{ä÷knwœÐ Âhž@·Œ9~;úa8Ž¥ßŒ9…ž_w¬ç4ë3[9ù:ÝÙß-’¿…áß@ù¸g+ç OÜ"êÑû­Óom§Öß_AKš.¥‡n¾”7^J‹„¸ézôwW‹ðr;®÷§Wÿ¹æÊYÈÀ×Õ†ó5Giì ›\åJ'Nú£Õ¢BËœvÑû ¾±¢µùÍè“Ërýp•óOÓëiÇ Ëåù§óÆk[èöÉ=R/'ÌQéå~åpJ8pL-¿$Jy0[×ÁÖwž*IaŽBåkŽ¶mÛè¡_ÿ8è4Ô]¿;ø7&×?8[¾l_wÎoõcñ ,6 mxÜS[Ë-ô¤Ðò{gÓFû´ËyÇŒsåïåwÿzPM•³¯« ¿¼õAúûgÑß?×ÄËB‹ÐóJ­Î¡ô•v±û(sôëQ'—üú‘­ûÓì¾ôê³KiçKëé®9?.Úuæ‚ ZVÅš#ü···Zô«…wÓDÇÞåÎüÎŽЩ»iÜq¨»iÜqÌVÇ°ïÓL¡Æ çyqÞI:9—9Zºtiìl‘nŒÔLQcT¨9âíõ}¬ÄúLRÎ;&œDwM?þ0ítºmÜIWÎ?OïJoîz–þùå?äcžYëShóŠ;Åíot`w;Ý4æ´š*g.ߨ}ÑÛðÝszÓâÆËüG/¥û})Ý÷ß—Ò½B o¼”îþÕ¥ÔüËKéÏ¿¸”þ$tׂKé·{§VçPúJ»Ø×¹¥KKÿ<^ªõOãéñ»ÆS‹Ð/GW¶ë\Üõ˜g‹î˜qŽaŒÒ.'×9AP-+I¿Ã*¹9â7·)Ý»à‡™wÓô7’iƒ¹¬wÓüNcÆPOÜyèy%íä\æèñÇÏ:[”«)JËéûX‰õÙQÊÉ¿ÕúŸq'x¿JRN¡ùW/ÊzLÍ•3é(Û¾TJÛ€ÒWGk#ÕPNU`ŽÎÿ¡|#™ê4ønw|7M¾Qˆ; !5k`ÿ†Åp§¡w…trqæÈ5[¤›¢8cd›"¥4ÍQ%Ö'ÊY{å,dà[‰u¥¯ŽÖFЖ!‚:ŽJjŽ>ùäzá…-úÍ0úÓœÐ]³@œ}.Ý9ó\ù;ˆß ýnú¹tû´s鶩çÒ­S<ývò¹ô›IçRÓÄséæ‰çH5N8‡nb7õûCŒ¼8ï$‡Ë­]»–ZZZ¤}ôQ©GyÄÌU‰ß@Çbã“Mü{&=¯\ÌQ5Ô'ÊY{åÌeà[ u¥¯ŽÖFЖ!‚:ŽJfŽÆG{÷î¥÷Þ{ž{î¹’Šóä¼¹ ®²ézè±VúøãOèË/¿4LK)ÄyrÞ\WÙtUK}¢œÙÕÑÊ™tà[-u¥¯ŽÖFЖ!‚:ŽJfŽ8ÎM7ÝDûöí“w¹J)Γóæ2¸Ê¦ë‘Öå´öÉ"ž7‹SJqžœ7—ÁU6]ÕRŸ(gvu´r&øVKCé«£µ´e‚ Ž£’™#Ö¼yóäÝ-žþ/¥8OÎÛU&—~|™œ½áÇÛJ)Γóv•É¥j©O”3^­œI¾¬j©s(]uÄ6‚¶ AÔ1TRsAPÇ|]ë!H m‚ ªTÁAAA ÁAAA ÁAAA ÁAAA ÁAAA ÁAAA •Ì566Òøñãßi€ 8q»áöãjW¬Yó!‚ ‚ (V®q¤­’˜£ùbû›o¾™Þzë-úç?ÿ A9‰Û ·nG®öÅ¿_MÉøûßÿNo¼ñ†ô$ï¿ÿ>}øᇆx<¨þ×õÑGÑÇLï¼óNe™#þ‚7ê‹/¾„ \Äí†Û·#Wû‚9è¸t8sÄFñ €=è… ¤âöÃíÈÕ¾`Ž:.Ò}ùå—²€”¸ýÀU9Û©¾®ZåB+5—†Ö†:ª«óÔPÊŒ#ÙNõa™ê·ûë²®2Ë™Æ>pF\Ϋ¾Q”¨L*ÒÍŸ?ßÐÖ­[s6G®°Tõì|êÒe>=ë ˦Bâ[•\¶©X樽¥‰f̘AÍmÚú¶f¹ÎS3µiÛ§¥š¤ÌæÈÃ3$aŽZ¨.Ê”D˜#ü÷a{c=Õ9"JÓU•dRjsÄ>Çö>æhÍ›ç‰#õíÛ×™¨-eŽ‚xfuñï~²ºÌ{& K"Žße=“t}©¸…¤Q,Ub™J¬¢˜#6AMÍÔܤ™£öjÒ ‘ܦ…ÚÕrJªI`Ž ¢ŒJvòÜ£þmøxÔ“>yT ¥4GìoØç(Ï£”aŽæÎhÎœ9´eËêÓ§3Q[<¨åÕóμÿþý4°®3Í}šÿö—ÞïÿPOÏ¥ÎçÒÓI×'Q!q‹­J.[‰Äí']sÔFÍ3š¨¥½ZtsÄf¨¹Í±ZNGå€ãõb\'g,ýG´’²õGºêôA¶?Ë¡Â\‡eÆóÍÏždÄóÂÙ8ݸzŒ4kþ1J²o@1ÈfŽ>ùäúì³Ïäÿú1sÄþ†}Žî}X9:ꨣèÀ4{ölš=kÍš9s&mÞ¼™z÷îíLÔ–2Gï½÷žÐ}4 nÝ'ÿ¶´uu:w^×yÍ Öm¥9Ã@ç9[ÍøЀ ¼3ÍÙÊa^œ÷ùÛÉ2¨0_~>[­ÿ½|=ñ9Ì_æ¡)*®JÛÚÎË+,÷€ûÂ} ã¹öËóóÖûé†uæo[aòÊì–½mÚ樭y5µ´‹¿æH›9ò»ë8æÈ„³ùðÊžaÊn<â»â0w—O&ïº9ÒÒ”ajæ".,ž¸rz8Œ…¾µ¿ºùâåä³/‘fD7;ä ËV–e3ŽÌ€2gŽØü°1:î¸ã2 R>æˆý ûö<ºØ±/ ÌÑŒÓiúôé4mÚ4š:u*mÜ°zõêåLÔ–2Gï¾û®Ô}Ê4 ¸/X÷î»lXØ xË[ætö·xƒµ^Š×‰Áÿ– ®¶ž ÂoY¦¡¶»o@˜Ÿþ·’JSÿ_Ï—ãÈ´|sgÇSËj+®½­‘—_nÞVÿÛñÂýŠ(‹ÜÞª³ •nˆ”\Û¥jŽŒÙ!Ë ©ß!±šZZ:ÔÌ‘7ÊÉÌQüÀÚ3]âØÙ£gû75ÆàÛÌëþ¸°8GZ.“¢¢Èý“ûc¶Ýº¬ù‡¸ò ÉÑe-‹]§.’ÔPz¢ÌÑǾ1ú·û71îL—_~¹aò1Gìo6nÜ(=Ï´iì}<íß¿ŸŽ<òHªãxaòäÉ4iÒDš8qM?žž|òIêÙóLg¢¶xPûùçŸÓöíÛMÝq‰×‰_rm_9™N>y2­Ta¼\w Ýa¯Waö:×z•†\¾ƒ.ñÿ¾ã’:ºä}[Žkÿï Ï„¨<¬m]q³­wý튧êÆU{û —^~W8‹ÛO:æÈ3Cá 4¹~[dÿ)%•ƒp0‚y]¡æ(@="§FíÄdÛ¿IÕe-‹]§.g Ä¸Ì‘2Fßþö·éÜsÏe"Ýxãò÷AÊ åcŽzöìImmm4aûžP<~;âˆ#¨Žÿá…Æ£±cÇИѣéú믧µk×ÒgœáLÔ–2G¯½öšCwÐÅuÓ+¼ý µž—]ëU˜½Îµ^¥á/ßqq]|‡ŸŸÚFIŵÿ ×ãÚJ×µÞõ·+^Tݨp×ú :]ë•Ò3G¶2gŽì0ïñ;Wxþ*ù›#o0=×Ð ü[ ¶ý4¢Ì‘4IÂ||£b)I9ÆÂ(§cY'ÃàE˜ì¤jŽ²–%<æ‘û¦á×u’Ç/€bà2Gl€.ºè"?~<ÝyçôÐCÑÒ¥KiÍš5ÔÚÚ*Ãó1GìoÖ­[G£G¡Ñc„÷ñÅù~øáTwØa‡ÑÞ½{iÔu×ѵ׎¤‘#¯¡#FÐêÕ«é´ÓNs&j‹µ\ÀW^y…^Y>‰NºøwÞßjù¤I´ü•ß Ó"ÌËï¼õË'Du¼]îo¯âsð;}Z¯m¤¡‡‹‡gÔÐpE`æh àY£+hø•WѪU«¨^Dv%jkÁ‚tÓM7ÉA!Ï@P.âvÃí‡Û‘«}Át\JiŽN;­»ÿ¶ºtõÕW “Ô üÏP·92d(]Ñ0œ®ºêjïUÞ Í‹?ÈÄwþùÑ(ÊEÜn¸ý¸Ú«šÍ‘úÁ;~óঔæèôÓO—ßså1èu×]K#Fx)x!¿­ŽÍÑÀƒhÈÐaÔÐp¥pQü£5‰¿sAÅTîæÈü–‘Ts[ÞÞBMAXµ´ëqÓ‘IÜk”j›Rš£=Τõë×Ó¸qciì˜ÑtÝµ× ïs•4GÁ«¼•9âß54 ÍQ=ÌT~åkŽÜxm£faŠ‚0i”š©-c»Âd“ñ1 )¥9:³gOz²­&Nœ@ãÇß@£¯E#¯A{ö8Ì‘÷X]]yÕÕ´jÕêÄ¿9‚ b*UsÔÖL3šZ¨Ý_noi’3Hn#•¿l`ŽÜ”Òõ<ë,Ú°aM™2™& ƒ4n̺îÚ‘áG`õÍÑ iŽ¼2ð×bsy[Sùš£ð±ºðÑ9i†üGìÚšE˜0J-âÿ¦–v-~á²as„mdRJstV¯^ÒM›:•¦LžD7ŒK£®»Vš#öEu‡z(íÞ-ÌÑ Aò5vC‡ Íù;GTLånŽLy³CÞ£sÊIc¤™¤b›#Æ{9~{ Sjs´qãFš>mM2™Æß0ŽFºŽö²9¾È7G»i0›#ß ñ+½ù˱üYW¢TJjŽ¼ßù³GüXÝ Ý Åý>)Ù`æÀM)ÍQ/ß͘>¦MBÆß@c®š£Ã|s4Dš"Ï 8–/_N]ºtv&j‹ Ai(ª}¹ HR©Çç¼ßñ ´7ÔI³„2”‹Òš£³=s4c:MŸ6•&N/ßZ·wï^b_TwØa‡Ê·3 :Ä3H 0€–-[F;'7GJzæÈúÍ‘ö©’¿Êæ Š’š£³Ï¦M›6ÑL1œ>}Mž4Qþîè 6G‡Ææè0ù¤†+†ùI˜£0G ô¤gŽÊ/˜#7¥4GgŸÝ[š£Y3g ƒ4¦Lž,­ãü?\˜£Ã…9âgì®Þ@ ÆÒÐ!ƒ½Çê`Ž@‰é¸æˆ¢”æ¨wïÞ´yófš={–4HÓ¦M¥É“&ÉñÛ‡.Ì‘pH{÷î¡«¯Nî³Güh÷›£.ÎDmÁ4èˆæÈ{C]ÕaÚÀI)ÍQŸ>}hË–-4gÎliøñ:~­÷þýÂq›£ÃåF\u%])ÌÑÆÊßÁRÓ͈§æhîܹ ͡ٳ<ƒ´ÿ~:òÈ#-s4¼Á0G]KfŽ¶Sc}w‡]7Ùk˜#€Ú£”æ¨oß¾´uëVš7oÍSiöl:pàuÔQš9ºÚaŽ~ç¨`sÔÚþ£µA¤‚?ª=`Žjr˜£ùóç{iÞ\9‹˜#þῺn䈫å ¡C½ÀžÚõTg¢¶ 6Gøñz­sP{”ÒsÎ99Rb“Äyë[ßæèaŽÞØK£®I׃tÕUWJƒôÄ+©[·nÎDmE›#×ãrY¡ÛÞHõõb+¹àÞ–·ñ×Õ76ÂLuÒ3GÖwŽXÍmÎðæ6=^zÉ(·9biæè1˜{ƒÆŽ¾ž®u];r$&iõêÕtÚi݉Úr›#ÏØÔÛ®…›‹üQ‘'vnË3Ká6ÞÛÀ`Ž:i›#·ñi£fùá׸m HF©ÍÑSO=E ,Ê0GüV†ýb0Ç?â¯ÃŽ3Z˜¤Q´víZ:ãŒ3œ‰Úrš#9»ãøí?ë“ašü¡Là ¹¶5f–<†×Q(9R‚9¨ÊiŽ”stÔQÂíßOS§L–@š8aFéÉ'Ÿ¤ž={:µ•“9òQß1f€2f‰<ŒmaŽ:,i›£ð±:ž)rosP^*Ì%ßÎÀƒÈéӧɯÄN2…6lØ@½zõr&jËiŽ¢«Ó`Ó#Ãùñ9Ãðdl‹Çê:,é™#Sí-M¢}7S›±æ ¨(sÄÿ°9š3{¶üÒ,þÒÌ™´yófêÝ»·3Q[nsÄxFÆx¡‚|U·ZÇ3KæK”ÜÛúhëñB†ŽC±ÌѾöjʘ=‚9¨*Îñ¿ß[})–Å_Žå/ȺµmŽJ«ë(˵5Ï M-Ôn¬‡9¨JmŽbßV§Ì‘þ$›#þH’+Q[0G Ò3GÖoŽ cÄo«ÓÂ|¥m’@2*Ò)S¤f0sJMzæ¨üÉ(¥9âÉ6GÞÄмÀÿHstÔQá ØÍæßÍö~wÄ¿9êSðoŽHÌ@íQJsÄ“?< ¤~JäùŸÙÒ±/ Ì¿„/š>}:M›66nÜXàÛêÈ ˜#€Ú£”æˆ_8Ç“@³„÷ÑýÚˆ¿ÿê}V~çh Mž<™&ñ·Ž&N¤¶¶¶Â¾s@ŽÀÔ¥4G<ùÓ@üù¢iS§Òáø[¯<~;âˆ#¨Žÿá…ñãÇÓ 7Ü@ãÆŽ¥1cFÓºuë¨Çg8µsÒæ ö(¥9âÉžâÉ ‰&Ðxßÿpþ‡~8Õñ?¼0zôh5j]wíµ4rä5´fÍjêÞ½»3Q[0G `ŽjRš£=zÐúõëiì˜1B£ézßÿìÝ»—=ôPª;ì°ÃäÂ5×\C#®¾š®ºêJ>|8=ñÄT__ïLÔÌH˜£¶7R}ðd~;£öAdP‘´6X´“<ÏMn©µ‹Ö›izÝEtKcÌuÇßf‘Ê“Ë]ßHxÉ+ R(¥9êÞýtZ³f4D׎I׌þçÊ+i÷îÝtÈ!‡P;¤={öHCÔpÅ4lØ0:d­X±‚NíÚÕ™¨­ê7G…¼¯O‹ôÌ‘õ#Vs[ÞÞBMAXµ´ëqÓQªÀ×YhVêJv¾n§Æz× 8j}‘í§ÔûE1ö½Äõ©“ǹ¹½±žêÒ,l>æH |Y* 2)¥9âÉŸU«VÑÕW])MÑðᆥݻvÑÁLuìØ) :„† Lƒ ¢AÒòåË©+ÌQ`ŽÒ"msäþ°+‡5S›¿ÜÞÒd}$6¥ ÌQ˜ç¨œ–ä®y%˜#Î+l/¥Û÷(jÜÛ—‡9Bߨ$JiŽN=õTZ¹r%]1l˜ÐP9)Äþg—2Gü/°!(4`Àêß-[¶ŒºtéâLÔ–ÛùÞÖð®%w^²sö—ëc¯Ê^‡§¶mhut€­ ~GŸK^vº7\öî¤%MÏäKiÌ‘¥¶fš1#4KiIGĪNwô­óÁ ãq›sÛψç…5Fœcf9ÌsI>æÓ¨ç™_9§ÉøûàZW‘0.7Ó6M°®~ ½Ë‹¾±Q gˆT\{½eš#¿þœJ ›£§žzŠ/^L·ß~{†~÷»ßÿëzàèÙgŸÍÉñäÏŠåËiÈàÁBÞ¤ûŸ];-sÔ¿?©~ý<±9êܹ³3Q[ÑæHtê.¥ßaƒÝIÛp¸}ѶÖÉÁ—\Ì!/Wº2¾Þ¡æRv;.È—´ÍQøX]ô£sræHä.%)äà+bð¶_¯ýar0¦·7-M¦Ú_\˜…‘¦_NmFA/[|9õsØ<âÒ”øç•3mgX\~־ǜ£²\AÂqizÛ:ËgdzêÓ#jF#j}ûì3)žMz÷Ý÷… z—Þ~û:pàMÚ½{=ÿü‹ôàƒædŽxò‡Ÿ4p ¦È›êO;wîTæè ¹ÐïòËér_—]v9-]º4s×1Dt yѶï²q­# ^9ä™nÂø}Ùù’ž92% kv¨H³F,ø¶Üõ¶Ga<°ÔL…9€á4õÁŒ>0Œ øÖPá¶qƒÏÈrúç’™f¸¿ñÚ<ˆÍÏÚ÷Œ:ÓâdÔ­&îCä¾Ç槈´ç3˜çüòhK:†aôȯ Bľç}˜ÖgÞç&c‡+ü †­réÝÆqÁ¬‘üÛ˜UÚJ‹²!o­S2G²LÑõ¥‚ÍÑm·Ýf˜¢?þ„þúÑGôᇥ7ÞØ/ÌÐ^Ú±s7½öÚzáÅvz²mýå//Ñ-·Þ’›9þfù²e4@"#Ï©™£ƒ~î}Ï÷8x”¬>cëÅjƒúù'1Û¡‰gz5²ÑÑÌojL³¤™ÆõXa†Âß&á±:@¥¢›£O?ý”>úèãÀ½ýö»ôêk¯ÓK/½B/¼ÐNÏ<ómÚô­]ÛFÏ=÷BžæhihŽäÌÑó… ÁÌ›£K.¡‹…ÊnŽüÎÕ“yñæŽÐìÔrÈ+"]™&¯“éæ/qA¾¤gŽ¬ßéo£3^ã*ÑËrPˆ@)©6g¯7†Þ€V­çö¦âñßz<»]F…iíT¨¾±QKÓ s7ßørzƒ+-\»«¦O>ƒëÈüô:ƒ>ó|õ–µÁtdšÉ‘YŸ™ñXÑõf§hòhKö¾áÉ÷Ïlƒ>ù?&jßó<’RÕ§ ¿sӃω(·­Áq‚ÿxÂ3D~˜ap @nÀÔ¥6G+V¬ ¡C†ÿ3”†úb?$ÍÑaÂíÙ³‡®~]1l¨üR,?{Ç?Tâi'W¢¶`Ž@ÀÔ¥4Gݺu£'žx‚†74j¸¢Aš#ž4ª;ì°ÃhïÞ½4rÄÕtÕ•ÃéŠ+† ƒ4XN7±³r%j æ¤Ì@íQJsT_­^µŠF\}µÔÕ¬«®’“EÒ~øáôÆoÐèQ×ѵ#¯\%Ô+WJgåJÔÌHƒŽlŽäŸù÷xÎÀ@7Gê°lŒÞyç]zë­·éå—_“}î¹驧ž¥ ·Ðê5ëó2G§Ÿ~:­]³†F]wÔu×^K× ñdOÕqÄr07þ†q4fôh±Ñµ4òš´zõjê~ÚiÎDmÁ4HÏYß9b5·áò£°AXµ´Ûñ —Þô‰2GþøãœÌQïÞ½ióæÍ4kÖLš5s¦ð?žØ±/ªûÖ·¾% 2wîš3g6Íž=[l¦I _‡¬2]Ûò:ã÷x ¯Z(–9’o§‹z|ŽgŽðB€²QJstÎ9çHŸ£{V¬9bq$ŽìJÔ–Ûñ,fŠ¤I²}‹~±‚7ãcÍEÜ}7¶…9ªZÒ3GÖoŽ ó£ýÞ¨”¿9‚9pR¡æhÍ_°€øzꩧ 4GÙˆx¬NƒM O0¸ ¶•fÕU#陣òËæ ’R›#ö9Êó(9Ì‘rN¥2GŒÿƒu_ÒÐâ±xfÉ|é‚’{[m=^ÈP=tXs”e– –©ps4¿„æ¨౺j¡Ãš#zô/f0©(stÔQŽßÁ2БÍpSaæè(: ¼×Ø…©ð2T 0GÕÌ@íQyæèÀÿûFÞ»¾;–9ÕÌ@íQQæèÈ#”æhÖìÙ4›¿Ë&©€ïq!÷îÝK¯½öÅŠÛ ·ÌQ…`¼@‚g^ñ2‰JG~Î ~Ö Ú¨(stÄGÒþýûiúŒ4sæLš5Ë3I[¶lÉÙñÎðŽ}öÙgôå—ÿ„ Xq;áöÂí†IÏYß9b5·el×ÞÒ$ÚÛÌõi¨ª9*®³Ð¬”îSÞ›=3ÍQÔz 2¨(støáGÈÁÜäÉShêÔi4mútš!LÒæÍ›©OŸ>ÎDm)s´sÇúÇßÿAÿøÇBü?ÅI´Ñ^¸Ý0i›£XÓÓÖL3šš©9Ûvyªª9*ówŽòM…%ùÎ̀ꤢÌÑa‡. 3î†ñ4~ÂDš4i2M™:•6nÜDgŸ}¶3Q[Êñ£R_~ù¥ØÁ@P"q{ávÔεQóŒ&jiO`¢òT9ѱ2¾ÿ%MOf|€Ù ãùæÈøv˜Šç…5ª×”av9ÌÁ9‡54êyæWÎÄi2þ>8MBTXd~qûnš#/èý3òŒÜwÿ8øKiJ2MPð yCÉf²r9FÉöÁ'î8¨I*Êzè¡ò·×E£G¡±ãn&iµmØ@gõêåLÔ–nŽ¾ƒÝ¿ýíoU®‡ihÝ©ô«vûo(mq{)–9 «c#†·5Ï ¦–ö`»ŽdŽ¤!‰uÊÁ®3ˆÞZ˜1ðö‚4e˜\Ç…YiúåÔfSô²Å—S7¼æ—¦$gs—Ÿµï2¾^gV¹‚„ãÒô¶u–ÏŽgÕ§Gº3GÑõ™ï>øÀ°¨(stÈ!‡Ðî={誫¯¦kFŽ¤k¯E× “´~ýz:óÌ3‰ÚÒÍÑ?¾ø‚>ûüó*×Ã4D¢_þÅþJ[Ü^Ò7G¦¼ß5S/óãtÁï:š92©6‘¢åÁªþØW†9ÒÂú@;.Là‚C…ÛÆ  #Ë)Ë¥§ÇÊaPž+±ùYûžQgZœŒºÕ¤Â}ˆþXp\~ŠôÍ‘3NÞû¸©(stðÁÓîÝ»iØWÐðáW “4‚F\3’Ö¬YK§Ÿq†3Q[†9úÇ?èÓO?­r=$ Ñ/^°ÿ†Ò·—b›£}í-Ô¤=FÎ(ijj¡vWÜ‘‘ÉVN‹ÔÍQl~qfEÛwßH–eÙ‡{ßcóS”Èå½€›Š3G»ví¢ÁC†ÐСÃèŠ+¨A˜¤U«VÓi§uw&jK7G;Ç…”znuáÎÑ×àÅþúÓàº.´`qÞeÁsñÓb=΂ÁAzF§ž£]T:*×:!-Ï.¢‚d^ÏqX–²B‰ÛK±Í?Fç6?mæÈ'Œêƒkù·22~Æ@_„Ëo‚0#MÒÓô–™ ÀùEÇËš¦?Xwnã ‹Ë/άpX¸ïÞLJ²}0ˆLÓ>FŠhÄu“ñÛŸ,D×g¾ûàã×u®åÐq©Hs4hÐ Aݺus&jË0Gû›¿~ à EþvÏÎæ¢ Í6 «ë2Ÿžu†©¿… ¢.óŸ ã Z¬¯«D‹d^.=Kó… òâjë9žJ#YÖgçwi')+T¨¸½¤oŽ¬¢ÈY¡Ž÷›£pତ¦özsp< %×ëo Æ ýñaÞàZ…Õ76jizaîÁu|9½Á¶®Í`¤oŽ‘ùéu$ˆ1GÞ²f"ÓL~ŒÌú̌NJ®7ó8E[ŸyîƒDÅL@­Q™3G ‰MÒ@¡åË—S×®]‰ÚÒÍÑçŸN|ð}ðôþÛ×}êhÀ}ü÷}4 ®3Í٪¶ҜÎ~˜#ž';Ž½l)2O[çt–Æ+ȳóÚ„ëiÇ”5ØÊWÜ^`Žª˜#jö Æ€NÅ™£=Â5 JC† æhõë×–.]* Cgg¢¶tsôÉ'ŸÈ¾óνÂTq/ÿ-´y¶4+÷jagoΈ×w¦Ù›£–mm¦ÙÂÄd¦jóìÎ~¸YV^_¤WV¨Pq{9ªV`ŽP8eŽø;G{öì¡á WÐPaŽ±9ºürZÚÚJ:ur&jK7G\À·ß~Û“4êñ86þú·ï¥þb¹oö†Õÿ^fÇêoÇN#\v‰· Ó‘yÜÛ?L·®?Ý«¶ÕÖwž=[K;KY¡‚Äíæ¨:9åv¨T;iŽ®Þ@ÆñÍÑeÔZ€9âÄãµúÕu¢™]aP- æ¨zq Ô¡Ò ¨v*Ò]å4G§8µ¥ÌÑÎ;å2ðÀ1ºÛ3G\a¹ŠÓR3AJýènç¶P%‰Û ·n7 ÌQuá¨C¥PíTìcuà |¬Žwæ½{å:.l´{¯ë~ÎÕŠ¸p{ávÃÀ¥DëÍ4½î"º¥Ñ]Žm Ép©†­þÚdè¯w苈v‹åuOhëªMû0Ýóí’JÝ¿ Ä12~¶]\Ÿë½kt¥[ÜGëêÃí£ÚuÎð+ŵWÁƒ‘¯d×__ßò§b_È ~sÔß!C®æˆáÚ¹c‡|T ‚âÄíD#&=sd}çˆÕÜ– ,=••sônã86ŽÖå1"”oÓ¾M Ðó4Gºñ`îéÈ0?½±\/Ò·™®¥·Î_§ÐËcçÅèq³íÃ]ä¸Ö>ÓXˆcäü8¦ ù®PÞmpûº%Ms$ßâ*Y½ø&/Ç ÌQQ‘mÓx"F¯ë¨0ï:õ6Èè4cÈøh³÷*þà´Qß-ó¥ÖëßeÓ•èM•iºö]?}#÷/Û>€Š âÌ¿Ê›©2x0GiÀ€ü^å @!¤mŽÜw-Þ‡_uU*Þû›i›¿œc äá¨'›ÀôèòME`”t±9ñ.÷—/†Kš6Gáámµe6G…”\Í—%Ø>nŸRP€8Fb¤ï/؈#W'ŒS®†¤äßÓ7GÞ`+ÙGq æ$GŸ¥wã®ólæ(gCÀÆ¢^¤i}èÙKÇ3+Aš²MØçS®m#.M+-+¿Èý‹ÝP)T”9âÀîÞµK£Áþ‡`ËÁæóX æ¨P²?~”ïÀ”;»ÃåyìcgÖìÉnafôõÆÌRœ‘`ã™#›•n†9Ò¶3G±ûàËiŽ¬ýSá—³i³Œç¡—ó.ßØ1A½°"ÒŒ‹ ŽQì(?jV©Ä¸Û Ùví7Êù3¥tóáljLS`ψÆã•“ÓñfÀ8]m_"ò3# äÏžÙûåïÏ"Y¤˜üüx‹´ýÏÁx™wÙígfœ÷V˜9›!þöïЛñ¼°Fm&AOÓ,‡9`•ƒÝF=ÏüÊ™8MÆßg“ˆË¥œFܘ}iºÊà6Å1GÔ*Òõâ†ÆÂuîpfþîrFŸ¦–ir"÷/fâŽ;( gŽv sÄÆhÈ!4dèP:t­\ùuëÖÍ™¨-˜#i›£ðѹ&jiO–žÊŠc¬t%}´‰;¤Ì»ëÁ€^Èe¢ Éå<À·LNF8co#Ò²×Ù¦CG7Xº’8ò›r…fÌ_æ<õ2)É}ëÕvyòÍ*kTšñ¸.¼­‡èÑÅ1òo‹º±è™% kЦ$qa1äÒÞ9Ú5ÑVZÄé8Mæ6r’Þ|³" É"N×(S¶ü|h—5‰9råçÿ­Ì’³Î"àAd”!Œ@óu@ 3êÍ Ò”aúÝþ¨0 ëXÈrj¿ ÓË_Nýxš×¯¸4%yš#wšÙËâÞ?M®7%-};mlæ(>M¾±ØÎÇF64œžW¦¹q—3Šø4­´äñ°Ž­kÿbö! ’P‘æhÈ¡4lØÔÐ0œ†_y­ZµšN;í4g¢¶`Ž@¤gŽLµ·4 ÔLm9†¢²âDzä7säîÜÔžå2—+“£ôúz‡9±ÄWÛ&0G±°LG”QÓ•“9òÓ·IjŽt¤“fF<[Óe3>¼Mù­‹jƒ™æ)‰9ò ‡Ç0>öŒ’¯Ìó°ƣòsœCYóËß9ó‹GüþÊ(,íQ¢`ú‹¦‘±¯úà3.LàJC…Ûò`7j°YNY.==V2C’/‘if)Kä>²—Ó}]æ4ãÌQÎû®÷Ö.{¹Í‘».™Èý‹ÙP9TäoŽèJaŠ®q y-­Y»–N?ã g¢¶r3GܸÍ]yèe¬†òv ŠeŽöµ·PSÔ Q\X*+bŽ‰õe’üeÝ Ä‰ML›ãYæHÏ×e:ŠfŽeQº\3BJ‘&N(H;&MVIÍ‘sPç&âÂàlƒþÀ^µÙä3G IÊO;%³`ap˜¬ù`Ž\ùÉ(Ó¢lQÌ‘U#MÎ2A»ÊVN‹¼ B’ Êc±÷A½œv½zÓÉ¿ƒã—i„¼<ÌüÝåŒ">Íø´k@åPQæH½Ê{›¢k¯¥Q£®§ÑcÆÒúõëéÌ3Ït&j æ¤A±ÌQ[ó šÑÔBí9†¢²Rs”yè÷8c!¥ æy™·· „S~D§i×'+¬3ý)©tôºöm4 c!°ëÀ_öä+éí$!‘iƧ¹ÙöQÇÉ]é T”9:âˆ#ä`nü„ 4qÒ$šÛ çJ#{ºÞZ•Ñ/o«žqöƒHÏ•_y~˜ç[0 ‡r’arRP€8FÑ3CâȉëX8:VŠ@ƒcJŽ76Äø®|T”9:òÈ#iÿþýÒM›>]ÞMŸ9smÞ¼…úôéãLÔ–ÛE54½3â¿mƒâ‡±³’Õ‘‰m¢rDþ‘é†åðe î:èe©sTÙØwØ]u(»ŠfŽqŒÂ ªFCå|¶’wšQ/E†ûP˜#P¹¨Ù6£òRQæ訣Ž¢HC4kÖlš={6Í™3‡¶lÙB}ûöu&jËiŽwš=4ƒãØ&˜J–aVcõשY©¨Ž-*ÿ¨tõ)W½ŒÆßÑÓÝ `Ž*½í»êPvÕ1l„ôëSkŒ‘ ç2>0G• k\¨7‚K¨*ÒÍ™3—æÎeÍ£yóæÑÖ­[ËkŽ|”£—ë"ÓteÛŒt›#oF }júÀ†ÙÉ@AT êT”9âx Ѽyóiþ|OlŽ8²+Q[NsõX[†ñÐŒF„¡a#ã¥ãmŸlê3ûó£vºªžq2ˤ“‹A9sT|lnn† ‚ ¨FsTDs¤LQhŽž*Ð1ž±PÎÖ3¼N›‰‘fCm£­çG‚õš1¶ŠÂqä•®¶ÞõB††o¦‰›%Ș£Âà¶éºpBAÔ1Å}G "Í‘½G*ܘ£Âèæh,Uwu†utgßÇž¥nÕÑYcÝÛDêÆ~tt>ñ*IûPP½”I\æÔÊšäØÊm´6ÉËG÷£õmrPPçgu†CyÈ8FE¼~&i/¹*"Íqnæy®ÜØïèœÏÞ¾#s”*æì'<öVÀ·}×…³`ù˜wnMýntl“š ìÜÇžå—SHuLú:M•×éÓÞHýŽÎcŸó郣ÍmIH 2Ž‘^\/z˜Y3/–U‡±ûG½Xûsæ)9hJÓT$9¶r³>e}çSGZ…)Ï6ÝÑdÔke™£Z?7ó>WäqLÞ×ò¾v`ŽpsT|t]8 wPa‡&;îgWþ{ò²åÖñä#.ËÑýnt†E«ˆ›’ $½|œ9p‰¨w6GÚ±“Ç2jÀ'T¸Ìü÷+×zá²hÛÇíSš’ù«mÄÈ™ožçuŒ W©Út…Ë8Fż†ä.œ›yž+B¹ÔÌÌèÀÀFsdÞÉÓ.èò†Eì­il<+,㮡S~ç®Í$d”Å3;ŽäPÔ]¾´%ë:§Á`–}·êÓØÿ¸0©Ü’z[ɈuÜåúˆã,Ã"ŽQÆÀÙ+¯—®_/ÛÆ "b÷A*¢^"êÓÕv8½œý¤±³ê…yŒ²Ä ó×¹nÛEæ—¥^¬x®ó6¯s(ã{ⲜÕOÏSË/î8hë=©¶eµ™F¸_öãà—åh‘žœÝû×ϯیz~, ¿¶úûä·¬\Ú‹ž¦¬ëˆzˆMSªzÏM]‘犌âê'*̧Ӏ9ÀÌQaðÒuáT’QÄ€&é…ؾÐGÇãNE “ÖñGÊ‹ä!;+ž«SáôÅÀdlL'æ‰ÓOx'Ïê0•d¾qaZÞ .É~³¬}—yøeÕÿÎ%,H;wsäÉ/ê¸Ëýu €pÞG{ÇÀ™ó6z=›û&Ûµž‘ܾ»Â8?ý˜…m&,S¸}xNÄ¿˜43âe´y}[]öz-¼Û„W–`Œçh¿QëãÄû¥öQ“<~Ú1 Û–¶?RöþFW+žUÖøü⎃[á9îÅçöÁëâÌJ²,Ž:Qa™ûÆòòq#kŒã–D¹] TXmž›š¬öH¦_wIÚ‹ÓéÀàæ¨0øéºpzŠ¿ˆƒVÕ ¸ä,DÆãmõŽ0ªƒÈÕQ%'·Ó;÷þ†¥¹¾¨’õ–¥•²ö]¸Ê­%qaẸAHœÜñ¢Ž»\Ÿ1ÊT_mk·¡ppàja}fî«­`~[’å äåç°„õ}üâÒÌÞæítCéåÑÛþ·¾­YŽ}O|Þr™’´io+ö×*Räñ‹­3VÔq¯Ïèö’í8¸e¯|¼.ûÀ6¾eº®z‹=FÖ>u–Dîí#Ë)]×Jqep„Å´ ý\P2MľǶ3+^F›°Óu‰·‰>Îqòê6{\.sGæ0G…ÁH×…ÓS ´È‹ÎÁê輋tL'`ÇK<Ȳ•­3Šoç\gv¬9tRr{½ÃôÝ¡fvòYëÍÝцxØɇ۫ý‹ ×Å Bâ”%žë¸ç´¿~Úv{1òuÕKxS€e”%TT];MœžvLšÙÛ¼®¦ Ý›u’w›°Ë™Q%.Sç’«L¬Èã[g¬¨ã_ŸÑí%Ûqp+ܯ°Nx]¡æ(׃}ŽE#kŒ:Š K¢,ÛÛåªés3o“۹ Ëî×ÅõÞ€9ÀÌQaðÒuáôäu®ÁI†¬@v:Y;!=žü[u~Þv~gjvŒÙ:#!g<«#5ò÷ÄM¢ýOI2¿ØÁ-kßå~ºêÓZŽ Si¹‰” žÌO•;×væ—ӠȺ ÒŒo¼mü~Åíƒ+Œó‹Ø>¶®cŽ_\šYöÏ ·§—_„q2ÌQåTrì»±,²èÛ9ÖÇÉ:ÆJÑÇ/®ÎFz9™#oF æ¨ôÀÔiŽfÎœihóæÍÔ»wog¢¶™#¹ÿ{64^xsõX†™^ücuA:YL(0GµGE™£#<’öïßOÓ§O7´iÓ&:û쳉Úr›#a;´Ççi<¬Çêø7BÁºÐ”dÄuâ_n‘ž¾ÞõB††o¦‰›%(陣vjišA3fhjn3·ikÚZ¨]KA iŽ¦NjhãÆÔ«W/g¢¶¢Ì¹¶9jns…í£ö–¦¢"] iŽ&OžlhÆ bŽÌÙ!Oxì­#RsÔFÍ3š¨¥Ý–ž@2*ÊqÄr07iÒ$ClŽÎ:ë,g¢¶ŠkŽ@­¶9 «ÓÌP{ 55µPÏùáM-íVüÂ’Q‘æhâĉ¡&L ¶¶6êÙ³§3Q[0G Ò3G¦äct3š©—Ù†¨83I iŽ&C$5~<zòÉ'éÌ3Ït&j æ¤A±Ì‘gˆ|äÏé¿7jkŽþ}R¾ɨXsĦhü 7Ð ãÆÑúõëaŽ@I)–9bó¾€Áú=’nœ´8… $£"Í£„17n,;F˜£uÔ£Gg¢¶`Ž@¤gŽ¬ßÙo¦ó­Sáiϱ@2*ÒIc4V£1£iôõ×ÓºµkéŒÓOw&j æ¤Azæ¨üɨ(støá‡Ó>Q6FcF³1E£®»–Ö¬YC§wïîLÔVu˜#ïc¯ú‡_½¿A¥sP{Tœ9â°1º~Ô(ºîÚkiä5#hõêÕtZ}½3Q[0G `ŽjÊ2G‡yæÈ3F#iäˆtõUWÒª'ž únÝœ‰Ú‚9isP{T”9:ì°ÃhïÞ½tíÈ‘t͈«éª+‡Óð†+艕+©Û©§:µiŽ¶7R}]Õùjhõ×+sÒ†×ëNÅˆ× ¶fü8 AzFZ:õ™æ(*P`ŽjŠ2G‡z(íÙ³‡F\}]9|85\1Œ† B+–/§®]»:µå6Gl@4C$ŠnN„)©o$¹˜¦þæÅ߸øqT‚b}hœ\˜ùoo¬Û'É” ˜#€Ú£²ÌÑ!ž9ÞÐ@W JC‡ ¦ÁÒòå˨K—.ÎDm9Í‘4¦yimPfÅ2@‚ L›í $ì8™ip:ÊüHôícòeæ(%Zo¦éuÑ-îrlk¸H†K5lõ×&£(ç‰ãZá†ÏÛ$ÛåHƵ¥¤¢ÌÑ!‡B»wï¦aC‡ÐÁƒhÐÀ4 ?Z¶t)uîÔÙ™¨­ÂÍÑvj¬×Í‘kdÇÉ489™#-P6Ò3GÖwŽXÍm^X[³¹ÞWÚß:*+1æèÝÆq"l­‹:ob³¯Å8IÊmŽ|m*ʾ +eŽ>ø`Úµk 4èOúõ£~—]FK[[©S§NÎDm9Í‘Èh†ÃyaÁï|âÂlCc/Û˜ù»«sçÊEÚæ(™ái£æMÔÒî Ë_•Š7kt3mó—SÌs¤ÌQöë ŠEEš£ýûSÿ~—ÓåÂ]vÉ%ÔÊæè”Sœ‰Úr›#ô¨Çã2MC/ܸikÄ’öà%Á`Fþ.ÉKÃõB†ÈüAY(‡9joi g•RTyØGëêÃGæ\3Gùš#žY±oXð ï¼çP}#5òìKÒsÉ>ÇuÓc……éñy+¶3ÎkU&?Ì_òÒЖµ8™q=Š63€X*ÊtÐA´kçN꧌ѥ—Ð¥_, nŽ"I`l@Í‘¶9 ›‹š*ά«¬l_B·XæÈ{œ.4Nž’>^ç>_½ÙX6 î™ Ï0eKÔÛ>ð!†‘±LŽ\Öojc£"ÊxzX”9ÒÓàEa”\¿1² JBÅ™£ÂyÆèRºôß=^-æÈ0§IÏ™’³C3š©Íµ¾³F¬²â0GŠüfŽ,ãáδ„çs"sd›ݔȿíó9¿´Âò1Göv( jŽ.5ÍQÕE‚AȤXæh_{ 5Ù3D®u)ª¬T³9Š4.Œ]Ž¤æˆ“u™-\—€rP±3GÊ ñ£u…¿€Ü(–9jkžA3šZ¨Ý^W¤Y#VY)Š9Ê4 y›#i\TzžÁ1?öõ»%˱‘2âE¤ÉùE. ËP 4TÞ äoŽúÉßõ»Ü“|•wç^å @Ž¤gŽ¬ßYƨسF¬ò°•¿' µHí§ýB†¼Ì‘@ÆõgrZ-Ó#MŠšå Œgœ‚õ–aÓÓô^¦iα2MP¸?(%•gŽví¢ø(µ|ùrêÚµ«3Q[0G Ò3GåW‡£šgUŒ&L³§Ï< ”T”9R:tˆÐP©aB+W®¤n§vs&j æ¤ÌQeSµ3+æÈ›ÒwEÎ,aÖ( eŽ=ôPÚ³g]9|8]yå•V­ZE§ÕŸæLÔÌH˜£Ê‡MDva?þ¦«³3ê7H¡ŒY#6O0F@Ù¨(stØa‡ÑÞ½{iä5×ÐÈ‘#­Y³†N?ýtg¢¶r3Gåz|EÏÐT"0GµGE™£Ã?\æú믗Í=šÖ­[G=zôp&j æ¤Ì@íQQæèß7NêÖ 7ГO>Igžy¦3Q[0G `ŽjÊ2GG!s'N4ÔÖÖFgu–3Q[ÑæÈ|Öß{¬ß2&Ök{ÃGÿ]qyµ¾}–·giÛz¯öµÌQ«§Tn`ŽÒ#xu5~K€ §¢ÌÑ‘GIû÷ï§)S¦Ú°aõêÕË™¨-·9òÌM¦é°gplãã‡9$m+±M´©1Óö¾bæ|?EÏ”ôÌ‘õ#–þÁ׶æè°”TVd{®Ò×n æ¨Hs4}útC›6m¢³Ï>Û™¨-§9Š iDZMð6,f™+7k”åÎ8ok|_7V–É${ (&i›£æ6WX5Ïh¦6c9ý–¾±`´}€Ê¥¢ÌÑQGE ™3gÚ¼y3õîÝÛ™¨­¢˜#õÕûÐ0%¼#ž“9òf¹`ŽÊKiÌ‘ÖÔÒî-ó,RS µglW˜Ê ̪ˆŠ4G³gÏ6´eËêÓ§3Q[NsäŽÜ«Ë4?l¼t¼í£¥Ó1Óv=V¤“‹éE#ms>:—93ÔÖ\¼GêXeßí@QQæˆÿá…¹sçbsÔ·o_g¢¶ÜæˆñLˆzίñ:mÖFµ¶žxÁz͸Û Å µ4\/dhhðf¥XK–ŸôÌ‘©ö–&a„Ô£t¾qòM‘4IfæÈ?ßИPET¤9š7ož¡­[·¦`ŽHN±ÌѾöjR³Gòoû7GQàå¯r"gIaP%T¤9š?¾!6GÙ•¨­òš#svÊ‘«FŠeŽŒÙ!Ý(¹–SRYÁoŽPEÀà =sdýæÈzlÎ{Ì. O{ÖˆUV`ŽPEÀà =sT~•˜#TiŽì 8Ì(%0G)·/ Š€9ÀÌQz¨ïƒáÅ ¨t`ŽpsP{à7G8€9¨=JmŽØçØÞ'ÓÍ›gHš£šúΑõqZƒ¸00GµGIÍ‘ð7ÒYÞ'4GG%Ðܹs mÙ²…úöíãLÔVá樘æ#iÚ0Gåæ¨Æ/Ž¨£tµëÃožÕ;NÚÖ3Ï]âòõý:¢5âï‰âÿŸUè½.—±£RÒýÍâg"?>îwª&"ÚÄ÷ëE{ð£¸Sl31åŸòcß³–Ó¯ƒ´÷¥£ÃõÊí†e\+"êsMC¸}%×u¾íºZ®Ÿ ò)¥9b³UøœyÂïèb?ô­oEuG stàÀš=k†¡-›7QŸ>½‰Ú‚9iž9²¾sÄjn ÃÛšµ°fj3â¦#€¼Ì‘g~"ãdy¹|Q…Y,ªÎvç®nXÁ`Zü¯ØRb;‰Ÿž.}àË=,逤£˜£¨AX)÷©,+ÿ¸%Î_‹“+Qm©ûsTøØ‹zuè,õ™¯ù(¼où´kŽç·_×õ€¤”Ò±¿aŸ3Gø]ì‡ØÕuät`ÿ>š1m’¡M7Pï³Ïr&jËmŽÌ;¸ÁxÄyëùuÃl<Âí¼‹mFôeÿïÖ0×ÝaWÚbmCæºøt­òdìƒ\éÞ_˜´Í‘óã®í-Ô¤"6JÖGbÓ(ñæÈi~Q¯8+Ô€ÇÀð²sÀ ®< Œ’Ž–£ßYeŒ0o«/Çs”¶9 –Âûà<ö1D¶%AYÌÈy.GÃlTÃñȧ]Ç]?È…Rš£Þg÷¢ÍÂçÌœ6ÙÐýûé¨#¤º#8œöï{ƒ¦LchCÛzêÕ³‡3Q[NsÄwp3)–ÉÛxÄZ»Ì ¢î˾­–NÒtíí´ôÔ>8÷äBIÌ›!}i_5Ïh¢–vm›Tð¹Ð@êµáBú ùøZ£ëF‚澑fðzrCÞ¹è3ç©—/+bS6@ÎA«–Ä1:§™ùH]8sÔÞÒd†§¤Ú€Ï ¿ý3Æ ïüÑqËxû r"=sdÊ3@¶!òŒSSK fŽò†Ï‹hãÓ‚q»Všç[üùoŽ¢Ï[Ù´Š “$2±ãñ@G7GÁÀB\SŒÁa ö Ålqž\MjÛ |ö ÎÏÛŽW̲0QHW½èñŠ:.rð'¤ŽQdièÇTµÙÚRä¾g9F/êxq=gÛ‡¬v½,#?>Î1û¤UŸr½µN7qe‰3‘õ⧡×%+I›g\åÕ‰jÛLFX–²$iƒÅ —v @š”ÒÙýTZ¿f»fˆ¡7öî¦Ã;„ê;ä Ú»{'];ìRCkV¶ÒéÝ:9µgŽ°x3*<@qÍ®hæCb €äÝcÝÄhid1+isZ‘ÎE¥«§amç Ü_ Å2GÞïŒ" ý¤”Tð¹m\ªÝñÆ<8I:à„üpØøÛ©¥’+ý 8®(ËÑ}ÉÁ ¿lÔ‡]g:Ží#÷ÁO'jbãÙeÒ0êÚBÕ3oU®cwxà¬×s’vkà׃ªÏ’›#Î?¦>³‘ª9JZÞN«³¢Ãõl•+î8¥4GgÔw¢µO,¥Q —b?ľ¨îЃ¿A{v½NW¼ÀÐêåÑi]Or&jËiŽŒG×ìÁŽZ>>#ÁÑ–ø –9©§†o††5PR˜i{ƒ+¹\/ÒµfŽÜézaßqíCÔþ‚Ä˵5ψxé‚÷ø]SK»µ¾pÕ–áç@¸\sä¥uó!ÞiçpBx@“hP"Ò僉ìõAPªÁD¾ #ç¡–õ¼v~V~œfÔ`.ŽBÊÂëì;ÓL©`|l¹œ<à4GLLYìzÜ>ĵ¥¸xqÇ(.Í`0î§çJ#ØF#²,ü·«~rÅNSük™Ë¢þ–ûªâ ìº×ÉV×Qñ²‘ª9$.‹_/ÁqaD<®gü|Ã|ri×YñÇFñ}¥5G§ ³fE |¡¡½»vÐaS˜£ƒ¾N{vn§á—ýÈÐK¡úNÇ;µå4GE#¿A¨|Ò3GÖoŽ cd†9_Ú‚j>µ›ÖymŽ´š¼m³›#óæ„™g´9òÊ“ÏŒ. x0¡$k" }+LØaÖ€Ò™^ââ)Ââ¾>˜QƒJ%cP$ÒàNn•5Š|Ë"±òTqíümÀr„Ë4­<ªnbëL‡µVgÙö!ªÞbãi哲Ž‘]VÏŒs9E˜Úg;KmWýØ*ÛÆ[Ÿ~Ù”ô¶ò Z?î†ÉŠôÚµ76ƒ7Ù(¥9âÉŸUK¦+/û!ž,:ô Í ýyC+ˆN=åXg¢¶*Ãjæ¨Ú¨2s$ˆ›YÉ9ªAæˆÛAMCòz+Œ~ƒ ’PZst,=Ѻ„†_Ò×О¯ sôµÐ ¹èlC+N=ùg¢¶JkŽ@Gæ¨Ú¨>sÄdÿ-ÈÌQmb?ê…Y#@Z”ÔÂæè!j¸¸!öCì‹Bsô3aŠ4­h9¥¥£™£·>þ¿AAPŒ˜Òš£c|sÔŲ̂8ªÉñ£®õJŒëAA…b`ŽpPmæ(Î 1® AAŠ9ÀAµ™#~x”Ab\¨ŠõÜMÔ©®î‘ËSÿào¨¸J^×÷ ®£þ‹µu|̺ÜD›µm…AA%sd÷ö¹r½™.ß|ËUÞŽAê樭Ùý­£öjRëg4QK»'Fj¶HI¥í2HŒëU±*Ú½F³ºXÆ@ŠËi¶ÛÌmÒT!ùÅíCöºÞ¼ žê?ž±ž “k}¶0‚ ¨4b`Ž `Ž€Gšæ¨½¥Éúø«R5 C|üU¥fjËØ.S<Ð Ì–%Ó·e\¨ŠUµæH+çbþZ}1Ëmå'묞f=§o¥Ì‘qllqü¨2Ä…AA¥sds<Ò3Gl€"f„x6I3MÒD s˜¥Å™#–n×Ê_<3ÐiÁMb0[Gu]n¢Y|×_ütfBÎp\){†uZðZÏ ãùvi6ìx^Ø,žÉÈË"-½Œ¸VYÔ~Ëm½'5à·Œ§¯=JfÖ‰U—9ÔKÏÊÏ2Åaî°—O& ø{aAš2LÌG…ʼnãiÛF†ÃtÓam›ø±º˜rû—­^¢Êb…Iƒ‘§•_Ö}Põ)ÓŒ« ‡2òJsAT158s¤›þ;4 ž9Iæ€í:¬uá½´=£$dǘ¹¬>him+Í»Œ™aþß®²XR5G¨„†'œIRæH#Í$¥aŽ8\m˸.Pþ ïð‡ƒádæ(~ðì™.mð­d˜!cm™c`'«œzþ2o67ºô}Š3ZYd:VFšá¶‘õ[ÎϵÞWL~¹íƒÏ®o—¬ºMA[Lí˜#߀¨NRš6ÊtH4CæŸÁ1fudÍäéÙiÅ-Ûab2Y2O•¾‡iÀüxβ8R5GÖïØÉGçü—4„f¨Zš ¬ŽÃôm×Ê_Å2GÔÀ]Ÿ¡(©9²;ÓÊl—%C …ÜN¥kÕK†éð•­^ ÙùÙaqùÁAÕ¢˜Ú0G†‰àGÌ4Ó–9òQÆ©‰^fS¢þ÷°ÓŠ[¶Ã´Çõ’š#»l šÔÌ‘mxäL’ú ’õ{$i–’¿AW”1b1® ”¿ò7GÞ ;cÄ%}à-ÿVƒf?`n È¥H¦¯³Œçk:â –ûw7VY"÷O3«œJz¼Ø²XùéJ_Îû„g17q„ùÇ({û‚ ‚ Sæˆg”Ñ‘†B7¦‘ f•bÃâ1Œ4Y Ô  ™Ä6.qË^9ŒôDçéË,cfXfyM“¢HÏ ùÖ)cÌ aÉ_å­K™#—1b1® ”¿ò7G,en”Ô`Ø^oúežÁz}ÎëñôÁy\˜'•®m0Ì™#–6h—ƒx-Ì6RF¸Ê3¾,z~ÞË.’ÕKtYô:ÊTt~¾"÷Á®3žÛT… ÛNaª,IL5A”·˜y¬N{!mT´Çí2^ºfc<¶—9›cþæ'Î 1ú²÷wCC802’’†Hå‘FLÙ€›TÍQ‘¥Ž­+ŒÅ¸.P-(Þ DÊ1ÔmÐùr¦P|<2 jö0Ï ¢þ!‚Š+¦_ÈPzÂGÝ@µPmæȵ^‰q] ZPZæˆÓ‰z| ²5$g«"f¢ÂÔÌŒAPñÅT°9ꨲÌÏȨY¥˜ÙùXþÛ%P T“9Ê&Æu€Š!ÏD˜×¥¨Yb*Osäx” ƒóÜÄfÇ0“l8£‹‹ ƒ ‚J&¦<æ¨!Í}U,¼j£Ê3GIQòéºj¡£™#˜#ÀÔ¥5GÇzæèçÂiŠ4Gƒ}ÁRsP{”Ü=cŽæh—0GÊI]虣®0G „ÀŽú®–ù¦F€Ê¥”樛oŽ®†HW´9Æ(0G'ÁÒ‘º9’xõ¿gÔÔBíA˜÷‘،泌òb¿¦ r©Lsä›"˜#P.Ò4Gí-M–!Rj£fùáWÏ uLs„WÙ z€92ˆ»Ë])wÀq'¾¤gŽ”r…)ÁT0GÅÁ@Jj樽…ššZ¨güÇêšZÚ­í:¾9ªGc@sdsÓÆIýïa§³œ­Œ®ý²Ó‹ÜD‘ª9*³Ê ̪…Ê2GßæèuaŽ~*L‘¦åhŽxÖD itõÈZ\X<†’æ¦ Cb™—Øå˜rÄî—–^äv ˜£´°Û6@åRæHΖø”ÙFE{Ü,㥠qa6Ú¶áï…<øιù{¤83Ä8̳Ñû%óäõ2ߘýN`Ž Ç3òª T>iŽ^Ð3ÔO{¦`ŽÊ +ª>`ŽjÊ7GBlŽºTŒ9âY&9Sd «Ó3ª˜#€Ú£"ÍÑ€ó{†ª8s”õ(a«F`ŽjÊ7GBÒX½Õêæ ö¨HsÔ_"]Ë`Ž@‰Iݵ5‡ß2jj¡vµÞø’ýqØt’Q™æè'ÂiZö(Ì(-iš£ö–&Ój§–¦fjó—£·+L UcŽ:Ã’ž9j£æ¤3Brv)4Ki $£bÍQ?M0G Ô¤fŽø±¹¦jãY!ÿñ¹¦–vç¶r樹ÍVˆ@2*Ê$ÌÑNaŽtc”š9RRå×jóëµ z‹œö‘Ö‚Ó•HªæÈ0D3IEš5b€dÔˆ9ò¾M”Þ‡X5s:$©š#ëwDmÍ3¨¹-\–3FE2F,ŒÊ7Gçùæè„BÍQšf樣“š9’/]ÐÌœI gŽŠmŒX •iŽ„!b]îkiAæÈ›5’Ô ÕKG£›ÿïFÿ±»`Ö†0n]0õäˆ/þÞÞXn«o/½SëD Pé¤gŽ„Œ×uÛF)\Ÿž’@2JjŽNöÍÑEÂiÊ0GÊ¥cŽÝÌ0¶¹ÑŒŒüm’ËÀ¸ ‘ù·‚ש4¬p‘¾n¾@e’ª9*³@2`ŽbÃx1œQªsƱãsí÷MƬ‘¯ô~üŠÌ@ís&šÚNõ®8V|6Sºù1ÒÕÌ@ísÆF‡_ýÍ«WvGÅç¿m#ÄëÌß1Êæ ö€9Š ãÙ"ÿQ¸újÈ2sd¼¼AÆÑ•¶ÕU<0GµGEš£Ë„!ÒÅæ¨SAæ€Ü€9¨=`ŽpsJ‚ñ›Dž…ÆïÓG{@ÈxÄÙŸÕ·'óõ§*j¢?æ7¬Æ‹€ÞV=½ 1jŽÎ4䙣ÿr&j æ¤Aê樭9ü–QS µûëÛšõo…‡MS ‚©hs䙊ª Xÿí¨M„9ò¨Àý0Gò{Ž‚J“WõJ ÌÒ4Gí-M†!ŠRÒír¨``ŽŠN”qÈN•˜£Ãä¡ÿ>@JmŽVÂj =sÔFÍ g„¤9jns†¢r!óiôîÌ{(i8ÿŽ½óÑ%+¬˜ozäs½(£üt}#5úS%›/a‰Þ?×£\™ñ|s¤}[-Œç…5ò@?#, 9”Eí·4ÚzOúKhì}5÷!írƶ%ë8¸÷!Œ§ÇqïÜÍQ¾mÞ,¿•§ϵïquiýv–Ëþ@-s€ƒÔÌQ{ 55µPÿñ¹¦–vm6OþcuE˜5b• 9àÓg’G9³×r9¼»n—HOÙÒñÐ\.ƒ7Èô Sö½Ü¿ˆ ¢÷ÁË'Ë0Zš2L7$QañÄ—%ú8ˆL"Ì/ñ>ÄwÜe];Û’Qi$q(?s”O›7pÔgP#Œ‰IG‘ÇæœÀà Usd¢˜™$ù»¤fj³×¨r¡` ä`M " …¼àŽ FmáÀ9d&3GñƒÒÈ}°ÿ’1Ö±úà<.,žÈ²d9ÑyXeI¼ñÄ÷ȶ$ó‹7á1vW¾äeWäÛæ•Q å×al{aìúv‘½Ž„Àà UsdÍñKšÛ´m%/•‹È¢=à‹B “ŒNƒÏìÛpà y]¡æ(ÀÞ‡ØÁ®=ÐÕçqa ÉV– ¢ò°Ê’’9 p÷ª7G±umíƒ^Ÿ±í…±ëÛEö:s€ƒÔÌѾvjiÒÌœIŠ™9ê@/dˆÐ&tf Ó%sä œ£Ýú>È¿Õ@ÕO#Ø?k +MB’0ßTÄɨÏìÇaf]„u•Û>ä€uÜ£ÛRöãPæHÖKD˜Ñ&¼4‚:‹m/Œ~,"°ê2Ào/I!€Zæé™#!ÿÑ:õ›£pÖHû½«þæ(zLÊ6èù `¨\§¹’¿9b첪hü>È<ƒõº™ðÐa<}Ðæ¡Ò5ë+K}F#<ÌSßï…Iö!Žørƶ¥ÈãàcÌüXÞfqañä×æ½xj½YŸ~ùý0³½xpܸöêÞ*O’€æ©š£2 t2Å•Iµ”³!MNTóñˆ2¨ž Ä̘ÀàæT0G š¨Ù!9#åX¯f£`Œ “r˜£a0G Ò9ªux>êd*é£biRíæ¨Òê3*{2éãßá‘9Ș#ÀÔå2Gº`Ž@ÅsP{Ààæ ö€9ÀÌQJ´ÞLÓë.¢[ÝåØÖp‘ —jØê¯MFìk“K…|SX…ýfÆx{YµüV©àãù!X•ÌR7Güטïµ·4Yß@JOe%ƽÛ8N„£uyŒ#¿ÝRj`ŽjY¿áËÂfhÕµ¿ÞL£ÞWöѺúÜo:@­s€ƒ4Í‘4>qxeãÔÔLÍMÐÅàÍÝLÛüåăÿrSæ樈p}j†GÖµ2Çz][ÛðúR™i˜#Ș#¤gŽÚ¨yFµ´»ÂX*¼Z:”9òfþ#s®™£|Íß}w}ŸE>fרßÕ×LAäÝ~–Û·_Ò7rv!(Oô>å´ÂÂx~ùøµÎñ¼°Fÿ›7f˜]ŽÌ¤uWÎÄi2þ>dADXÚmÂ5cÉyxáa[×e’Û¬§wñùãÍ´ZçÌö%t‹Žéç™ñ¸j –Öœ“þìî"Y¤˜üüx‹¼í¥¯´C@\›€<©,sôu‡9ú±0GÀÒ’š9jo¡¦¦jó›c5µ´ámÍj¹£™#{ &]º’>^}ç`uÚo:ä€Lšlc¦n—vÚk@§”$¹F—“Ë …ÉüU™¼° M¦ÏtD…YiúåtÖµù·‰]W¼l‡¨4%yš£4Û¯·è¡ÙñÓä²8 écÕe<¾Y†dŸCÆù´• “ÃDÌ%1G®üü¿•YÊå±Ø´CÌ Tž9Ú.Ì‘0Dº`Ž@©IÕ†H›IâÇéšÛüõµcŽùÍÙƒ©È”ŒŠÁ™¡p&·¼.¯VtyrÇÚD–“ˆÚÀÓ|ÛåÛNõQS=LàãCÖ4ý²s›ˆ°ÔÛ„U/æ²^Ÿ1éu’ìfÅ&ñãÖ/¡wý5ãœô· LN‰ÍQ\=Ù¸êÍ?îñ3umŽ.õÕ sJLzæHÈ´NÍ ¹ PG3GÞï!xð¤KHå… Qƒ,9°â¾¯ànµ2¡ Ôö`¹`ìò¨Á`|9ƒÇäúÌAzO/k\˜WŸ*¬¾±QK3®®³ÔgäqÈrü˜TÍ‘ ß6áçåÉ®Omðî§o·U×ìS41f…Q)õ ßÀØaú 5zi”Ç 97UÜÄõ Ùq™#6=Ÿ}öY¤>ùä“â›#eŒ`Ž@9HÕ•Y9 ²î ƒ<°ó p§i¦kÏ@aæ&.sÄèÄO¤£>Zê{ßûuïÞèÆo”áE5Gº1ºôÇ=`Ž@É9ªlr»ûÜÀ•9‡v› j¶Æ6q3G]t 8&NœH .¤5kÖ”fæ(Ó-‚9%æ¨òÉúÈÌQIáÇñÐ` â‰úÍ‘2HãÆ£ûï¿Ÿž~úéÀñ±Dæ¨Ì( 0Gµ‡2Go½õ}ðÁÆ8¢Å‹ƈUdsä™"˜#P.`ŽjeŽÞ}÷]9cĦGקŸ~JŸþ¹ü__ÏƈÍÌèÀÔÊñ¬‘2=IÄÆætX`ŽjeŽxÜe‚Ôÿ.ÁIê樭9øÎÑŒ¦j—ë½oëYÍm™q H†2GQˆ§Sÿ»s:$iš£ö–&Íé*Þ‡_u€d(sä2>Is:$陣6jžÑD-í®0˜#€JB™#69ù æt8âÌŸ4AAPÇ“kü—‹âÆ‘¶`Ž@ÕgŽvîÜ™—vìØhÏž=ôä“Oʯ+ÿö·¿•ºå–[ E­‡ bKµ=]ÜV¹ÍrÛ… ‚ jÑÞ½{s’kü—‹âÆ‘¶`Ž@ÕgŽ\'R®Ú¿¿lòcoü|ªýc?ª4q»å6Ëm‚ ‚ªEÈà•{ÿý÷åøŽ_¾ ~/dýrUÜ8Ò–gŽ„9•Oœ9zóÍ7ó’~RòÉwë­·ú_WöÌÑÇ›ú裥ìõTl©¶Çúë_?’ßzøàƒéöÛož§† ‚ J¸5Jï½÷^ 6EÜ·ñØN½•æ€âÌÑÛo¿!>™Ôßê£aü¿¾.>)o»í6q"²9âÁèGÎü ìâÁ<×#+îoW\(»Ø½ów&ïÓïÿ{Ùv!‚ ¨ZÄã153Äÿóò‡~(û8õ‘×r™£SÙµ°9:Ų̂8ò5GÊ]tÑEò{;%>YÙñ¬‘wgþC9ø„rŸÓêë©áŠ+œÏš9SþíŠ e£7ßòÚ8ÌATmⱟO<10HgŽ~&L‘&˽" Ñ0G ¬äcŽ”1úö·¿MãÇOhŽ>¡>ü«?}ÊCüè×Ð!CèOwÝåüûá%Käß®¸Pv½õö;´ÿÀ›âo˜#‚ ¨ú¤ÌÑÑG-o^+ƒÄãºJ4GCMsôÍ…‚9¥&Ws¤ŒÑ¿ýۿѹçžKwÞy§\vmËâ“•ÍÏh¼ÿþÞ ô­·¡<ÄÇe‚0£<òˆóïÕ«WË¿]q¡ì: ŒÑ¾}ûe»…9‚ ‚ªMº98p 7ÎÿÍ·÷³†J0GlˆtÁŠ#WsÄ'ÖqÇG;w¦‰'ÒC=”Ƚýö;´{÷zíµ×iÛ¶W <Äweˆ\³9â¿]q¡ìjoßFÏ=ÿ"½úÚk0GAPÕI™£ï}ï{rŒvÿý÷ÓâÅ‹¥A‚9 !¹š#5stùå—Ó7ÞHK—.MdŽøÎüŽ»èå—_¥_| ÊC{ö¼"×ßlŽøoW\(»žþ/ôôÓÏÊ6 sAU›”9êÞ½»ü$ÅÓO?™#r%WsÄ'“2HóæÍ£5kÖ$2Go¾ù–œ5úË_¶Ñ³Ï¾å¡;wÓÍ´jÕ*çß›6m’»âBÙõÔÓÏÑæÍOѶm/ÃAAU'eŽäøŒÿfCÄã:˜#’9âÿ•AjmmMdŽø÷/¿ü=÷Ü‹´uë3Pzýõò¥ [·nuþý /È¿]q¡ìbcÔÖ¶I>^sAU›”9â'{”1ª´·ÕÁŠ'_sÄR‰ÿ×·ÑÅ'+›£½oì“wç7lØ" PîbcùÊ+Û¥âþvÅ…²kýú´fÍ“ôâ_ÚaŽ ‚ ªÇØ)cÄË0GäH!æ(‰ødesÄ3k׶ÑêÕëè‰Uk!¨²ôÄZZ¹r ­X±š^xáE˜#‚ ¨êÄfÈVŘ£“Ž¡Â ùY/˜#PÙÄ™£÷Þ{//½ûî»ø¤\´hmÝú”üÁû3Ïr#m±9ZþØbüSaŽX¾IÚ½ãUeŽ¾ê™#aˆtåbŽ ‚ ‚ ‚*]Ê ƈ¥LÒ®×_¥ƒ¿ùUeŽ^†¨‡!˜#‚ ‚ ‚:’stÁYBžAbIsô ˜#‚ ‚ ‚jD]|s4P˜#–4HB0GAAÕ”ºœhš#%˜#‚ ‚ ‚jJÊ 8ÿ,©,˜#‚ ‚ ‚jM¶9R‚9‚ ‚ ‚ ¨¦š£ž0GAAÕ®Ø- ÌQh`Ž ‚ ‚ ª)ÁAAA )sÔ_"]0GAAÕ”`Ž ‚ ‚ ‚„`Ž ‚ ‚ ‚„`Ž ‚ ‚ ‚„ŠfŽæw©£º:¡.óéY^·h¹h âõš-ÒË%?ßA‹a¥gçweéBóŸÍ Ë]œW‚´žO]RË3Byå‘°ü±Ê3 »ÝD¶£dÔA\¹ÒØï(3í¤*^äùœ[ÏÒüA¯¬ŠÚ^¯®+ƒh‘X·hPu™ÿ¬µ¯Jh«ATqæHïP½AŠÛô³ãKÛ ëÒ%nP•­\IË^Ì},D¥,>ip½ÝØËi(®\iìw”Š™vR© l>}óꙤùÒÍ/š1‰ØE"O]hŠ„Qsžóµ |w%´U‚ *:û樟0D¬"š£¨Îµ˜oö| É°ñìÄ A Ê•´ìÅÜÇBTÊò瓆§õ—f1òS*fÚIUœ2°!2Î)¶¯x3ÂÙ÷Ã(“<¿Ý3Æ[ùïJh«ATÙæH)EsÄÿ«G[\wŽ]/ßÝÕ¶åÁŒ'šï«´ÌŽG… Zdæ›9ÒËç=r¦£Ö‡åÊÌ7*}»Z^‹øq.o}f=hÛÉ<]éèÊ ç2†Û™å—wóƒr«ý ãT~ù˜šŠ£Õ¥¶¾Ëüùfytñõ<Ãu]æ7YË®ú˵"¶ ò°Ëì>&î6é¥Ëæ;¨“DõqÜ: ë8qÞ©׈òâp}¿DòÜåõZÛзóçûQ E•-¶m±´ë‡\æ¸eæs,õã*¦¾õº –ý¿Ç".LÈ(‹~Lôr÷¦ÞÚ6Á¾EíG.õ AAHQæh§0G•næHuÎzÍëùoõ¿+žJÓˆd˜³åë…ê`àW_ooW±oj@&ï¤gÙ§lw·]áú:ñ7?2¨ÊÞ9O»üVœoOX¯òñ*#/%s;oPU>{Ù¡‚êÀ,‹Y樺ѕ™V¸}\ÚšôòÒÓõ¶É,G\Þ)Wgùtqõ·’Óï0Gº1‚9‚ ‚ ‚ ¨¤?>·wï^zà2Ö+IsÄß9òM‘ÌAAA5¥ÀiÆ(Ææ‚ ‚ ‚ Ž$ÓeŽ^1Œëþ?ÿž®>D$ª E®8.¹âæ+Wú¹È•f¹ÒrÉB=A”·:;äÚ.©‚tNô¥¯ ôýâH BóRFZŽ2«ý)¹DyR•+RÉUžŽ®ÿ¢k¯B‹î¾Ã7F¡²š£Ù¯“©õáEž ‚ (»K-µõh-J,=Ï¥,Ç6¦\ùÅÉ•FZråWN¹Ê˜M®tŠ)W’È•”D<»)OA®| ¹òvˆ·sÆgYÛÖºØÍ›z}´9úöÿsÝøËtÃ5ƒ=côÃY*”ù{¥8Ù¯ ‡Š'³îã›+~ÍêÇrm+uF¦~œT"~”œyå!WÚQrÅÏ&W:rí{šrå å/W—Z®rå*Wº…È•GœÎ¤Ël§ t†”«|—±œq”\yÆÉ•FZråWN¹Ê˜D®´ÒÓå¾¼eWþI¦¦¥žN]®ÉÎÒ· ô“dÅu•/ØŸ”FöZJ”5»ÎÒä ç}vç™!W4q¸3ËÚ6”(C-IÔ…!«>&ŽBÿý«_ÐwþßèîÌ.ߧÿç[GÒò–%nCdK üÜŠ€»„y)¤ê9úØ„á®ø5+ç Gȵ­”˜ä#9 ñ£äÌ+O¹Ò·åŠ—D®´œRû\ ¹òƒò—«ŽK-W¹r•+ÝBåÊ'^ÉÌ‘=˜’«L¡.“ùÙq”\ùÆÉ•FZråWN¹Ê˜D®´Š)W²É•NRe S®8b@. I#EVWºJ¥4GôÁ´(ovE›£p¿ù¸$òŒ29*,*ž+ŽÓ”‹ÄÀ$/¹Òª2iƒÀx‰ý-–\劓³|P(G—\®rå#WÚ…Ê•O¼<Ó"vÒ±Ùä*‹©Àe¤+òÊYv)ÊY¾œe)¦åK,WzÅ”« ÙäJ'WÙ¦(Þ¼°‚±­”4RÛhñ\i*ÉmÄÀ¶¼ÒÊ©³|¹Â\if‘ÄgȵK„™†HI…Ž"Q¹Iì¿C¿ÿÍ/è¦_ßHóktÚÉÿIu—ÿ¨;Ýí8úêWþU$žAšxí0·)Rƒº4å¼@K7?žìºÃ\ñ¡\Äí8¹Òª2‰AXr‰}ÎEÎ:sI¤«œåƒ<‰:-»\åÊW®ô •+ŸxÆÅ%çÀVÉU[V>F|÷ 3^v)I–O¤'gyŠ!«lyÉ•n1å*ƒK®¸…*»)²¥oàî0 Ú6®4t™i•[ö¾ØJÑå(·1b “ÐQ$ê2w‰:ð5yÔ09cÄÆèkÂu9îßéÇ=O¡ºažE??§õ:õX9ƒÄØýêóåKJ«W¡’ õ]Ùm:›\iÔ‚\uQ¨\ù@ùËUÇå«l…È•G¡råS€^wÉ•¯-±KÎôÊ(W£äŠA”’Øïð£tãkÔåøïÒ{œD?ëÛ•êF\Ú‡ßC¤³ºKÝN8šúúWʤ¯BP•ËÕ®£äŠ_KrÕI!råQ r••åÚ¶Rä*o¹Òb¹¶M"WZiÈ•W1äÊ;‹¾¡K¤Ár¦­Ë%#Í"(iž®í²É•APJ:ñ¿þ?ª?é?èG=O¦ŸÓ•úŸw:ýÿ– .$€È×IEND®B`‚codequery-0.18.1/doc/screenshot2.png000066400000000000000000000461311300045745200173200ustar00rootroot00000000000000‰PNG  IHDRyÍK¯ñ¼ pHYsÄÄ•+tIMEÝ*;Œ+ IDATxÚìuXTËÇg¶—.i¥»ai;®ÝŠbw‹ ¶¢`+v+v‹J.¶^±•’XØ<¿?ŽîåÒÞŸø~žÝ³sæÌy'¾Óƒóóó? ˜@k´ÐZ­ÐZ@k´@k­ÐZ@k´@k­ÐZ­´@k´ÐZ­´@k´ÐZ­ÐZ@k´@k­ÐZ@k´@k­ÐZà‚#T v€æ­^ïÞ½Û³g•JcýD"Q@@“Éüá>§¥¥]¼xc FþÅ`ŒMLL $‘H~¬Ït:}ëÖ­yyy`äF(´ ,øÙ->>þæÍ›‘U¡=aÂMMÍzÊüüüº]gdd´k×lú³¡R©‘‘‘ýúõûá…r¿~ýZ´haii vþňÅâÀÀ@@PRRòc} …šššk×®åóù`çFÔ‚¡Ñ6oÞѶmÛë3“ÉlÓ¦½½½ع‘pûöm{{ûE‹ý¿íZæíí½xñb°é/ ..ŽF£ýpo ‚À8°oß¾`äߢµ?©ÅŒš7o¹±ý3úÉ~é#Fx{{ƒ‘O»¶¼¼¼^g0^ ?ÐZ­ÐZ@k´@k­ÐÚæ ¹Ò¼™íƒ*}ØßµnûÍ5ú 4ƒhþíÅ]£ÐÚ}QcîßoúòåßA+WaŒ›bæ¬1¨ä†Sg£/,_¹ ¶`­>Ÿ²~ûwïÁM‹œ‡†S9U×–[1Æ;vïY·1 ²@SͤBáÄi3>z\¯KŒñ™sçç-\ôÃãºQhíî½ûž¿xY‡ƒ7oß&%'ÿ²ðTy\m9°úõÌìì#ÇO¶pɲ.={“–ÄM~ÿ¾Q—ÅA|ÎËó9ÚØÒF½¥^zF橳笜x<B(5-íÉ“§¶Nð{+4%¥¥;ví)-+mö½"‘è~lì—ââÿVi«û®ŠŠŠ[·ïˆÅbé•ââ’·nÿ¼4óúÍëØøxòëÅËW,ì¾|ùR›ié?~‚^–×Õ‹Ä&­ÿ×¾àÚå¡÷>˜ÙØݾS›?ÎÍ}ýÃmÕ(´£zj!ë6ìŽÜ[¯?ÇOÖ14neb¦gjnbe«ojÞÊÄL×È$rÿï O•ÇaŒ-1¶´nelÚÊØŒü X¸¸†ŠO¥+­Zµ431&?÷4øQ£ÑªÚjs¦N§ÓiçN¿s튅¹¹z 5ccƒÑÛÿƒåÄÅ»xµÑ75×31³qr:bäͬAˆD¢uÚvêbdiíâÕÆáâüü‚ßj:„kkçÂåËf?–@ãEË»õêóªíï?|2|d½Ç aŒ½;u6³±kiljbmÛé¯kC7Ö['§¦Ž7^,ùGk/^¹<}¶ß±Ãã'O'N›nçìjhnÙ¶s× •«ªœ¹¤ªªbbbü3Î×úõÙÉÝÓÀܲ¥±©¹­}¯~wïÝ÷ó4cì¿p±­“KKcSsK¶íçÌ__PPï㪉 LZ K¥fÏ àxx˜Yz´m?ñ’*g~ÈÈ°MŒU”•qÔü¿ÛÜ“}Œÿç]"êöN§U¾\›³ŽíÛ]>waôáÃÇi³foÝ ¯¯‡¤­­Uõ‰¾mÝNþTÙA•Ç!„X,¦©‰ÉæÐ €¼¢¤¤X=0”o‚˜4~œôWƒ!Ãf7ò\šš–}ꤕ¥ùµµ§gkOÏfÑï²<ùµ´´¤°°ðê…óAž:svòŒ™{wîðpw«•ã¨´´´S÷žT eòÄ Æ††ï?|ع'²mç.gO324¬;)ÖægwÕøÊשTj¬tM^^~ˆïÈ[W.+++‘af1Y2²2u¿`m+N—•‘­¿¼{ÿaÚäI];w*ãñ²²s6nÿûï¿·nÞTÅ€ÿÊ;*FcÐÒШÔÊçpÔ_Õ/V¾rõúi³ý\9œ•Aª*ª¯rsïÆÜ«r0€›‹Ëù“'8vÛÈ{’KKK§NšØó¯n<^yfvVè¦ðÔ´ô-›6þŸeum·çåç9sœÌãñÊ_¿yñWï>‰÷ïÕq5‰5&­ÿaÓ33‡øŽ464\௥©ùþÇ —/+((””üÓí¤¨ xáÌ©†Dèëÿ·]‹1VÓn)íêÉÌÎVÕÖ-(,DÝí?ÄÇÒÁÉÀܲ}×nû"CO¾Àšõ8îžFVã&O‘vaŒaíÈ10³ìÑ·_Ff–ôA·ïÆèë™øëI?rü¸W»ŽúfæÝûôKMKG©(+ÛÚXÛZ[›™šˆÅbc##[kk[kU•Â¢¢ S¦[ZÛr\–,ÂcŒ.wpu'ãO šZÛí:TýqäƒaldhiaNþiki‘ן>{Öˆ‘…•kë6g£/`L!_dYðŠžýú“A¥Óé>#G陨é´Ìyø°æO@Àb±ú $ ä…Ë—Õ´[Ö˜ÔnÞ¾Ýé¯îz¦æí»t»~ãfÝ–/-+›6ËÏÜÖÞÚ‘ã¿p‘H$’–hb‰ÄÌÔÔÜÌÌÝÕuÚ99¹D.—Œ¡P8'`¾¹­½¹­Ã ¿9L6~ó)ÊÝ׆âæêÒ§WÏËçÏLœ: jÝ©.|ë6gÖf–ƒ† •›K^ܶsW—½Ìlì Í­ºõê“ÄM–æ´ÜÜ×>#F˜[:¹{nÜ.-,Êx¼©³f›Û9X98- ¦3è¶äå m¼<ûúVžFP¹(©n“‚ÂB=Ssi^رÅÞÅl²Ù,·6ÞºF&ÊšÚe<^ÏÕÒÔ051q°³óõ:lÈà”´t2_Lš6cÔ¸ ¤%1ÆîÞí6oÙJÞ"'/ßÒÈT×Ȥ…®é€J¥ê뙸x¶&¯<~òdÀÐa†VnmÚnݱSú+V¶ëÒÍØÒÆØÒºÿ¡/^¼$_¶¼¼|¶@ïÝî‹ìÞµ«»«Ëàý·…oªbŠ·n«jëJS{|bbÏ~ -¬\Ý>R¥Ä9nB›*ww7¶nd--3SS{»ÆùÏñ»zý:_ (**?y*ÇÃKßÔÂÊÁ‰ŒÐêy9/?_M§Õ­;w¥ [ŽKøÖmu¨Ž‚‚¼‘¡¡µU·.ƒ–,)((|÷þ=BèÐÑ£ú¦Ò¸X´dàÐaµ‰U’A5ãSgÏõè7ÀÂÎÁÀ̲]ç®—®\‘†d”iŽööѧOöéÕ“,ölßV%®ª¶n|B"i«OŸ>4ÙÔÚÖÂÎa朹UâzѲå6NÎ?¤sûô!Ë+ÈK«ŸT UAA´æË¿_å¾~}hoä™ãG}Y·~SÄRäW¬väê…sº:º#Ç—^wqæ$ÇÇÆÇÜ]à?!tüä©•!k͸{ýš£ƒýУJËÊê¨ôèÓc|õBôîm[¯Ý¸¹2d BhEà2%EÅEË1Æ~þ.§‘¾Ãj|BˆB¡TOÓEEE½VSU=qøІŠŠ i‚d1™2ߪi"¡híêUñ1wSâMŒeß [6…II§Ñää«¿r|bâøÉÓÆŽuÿÖ~}zOœ6ýÅË—uL*éÑ·ÿû÷ïíÛ»kÛÖôÌÌþß2éÔÙ¹  Ûxy}=þÏgxnîë³'ŽÿÎݘIãÆIÓ©sgÏzýæMvNNÝ©nÝÆ°ƒGŽ†mX{óÊ%•þC|Èddf©·hqâð¡‡øŽ[^^NÇëÞ·Ÿ¡Áí«WÖ®Z¹{ﾇ“í7xè³gÏwm8¹[QQ‘Òˆ:B`sèBBÌð›S¥¸¬Í&*ÊÊá¡V­]›ŸŸŸûúõÆðˆCû"É{+øü#öÇÇÜÍà&²YuuÕHûcs_¿¾tõª§»;ù•Íf±+5hääd¥.yee÷n]¹›š+­e%'ÅÇÜ=ê$BèÝû÷½ 224ˆ>urñü€»÷¬ ÝHŒ›œbok{úØáÃû÷1™ÌAÃ}Éë'OŸ …Ë—.‘¶Q*ÿÿ§FSPP SxZz†ÏˆQîn®çOžØ²i££ƒCe—‹—?{þüúå Õ „Æ©»²22ãŠòŠ‚ÂÂÛ11 ýç]‰>J¡PjÌËjªªÎNŽ±qq¤‰Þ¾{W\RòW×®u<…JýšKJJ:¬©¡A6Etº¼¼\åÞA™ÚŠÄ*I«Ž¢ãÉ“'b‘èhÔÓÇ´ñòœî7÷å߯Bwbî-YPw\#ŒÈŽ @еW±H|äÀþ#Qûûöî]ÙáîȽç/\¸u岂¼üïïC®ÇwÕÁÞ!dokK¥RCÖo˜9m*BèðÑcÁKûôꉲ±¶Þ{ Jš2Z{y’ŸW.ãxz½yóVWW!Äd05ÔÕ¥>o Xà?·[—N¡àeKOŸ;wùêµ}ûÔØ¿tö|t·cK8BÈÈÐ`æ´©aá‹æ±=|s—^½ÕÔÔnܼ•{_IU‡zöâ…®¡ é}IiYÁû7 %ò@”‚¼üŽ-á¤Ø}ù’’šZCŠG„ªŠŠ®Žv£Î–©©ªÖHŒñÆÍcG2h BhÚäI.]>}ÁoÆôóyôÅKï߸zá<“Á@EîØÞ¦C§„Ä$Wg„¼¼¼¾©¹„ Br²²“'Œwrt ‚›’’‘™õòqéOàâEÃF!»Böv¶U‚ä`gKÄÓgÏ­,-ëHu;wïÙ»kYèoßl`nŸ˜èæâ‚ÒÐаµ±&ÂÉÑÁÈÒúvLÌ_]ºìÙ·_GG{eà2„¾^+_Ÿ¡ç/\1Ì'>1éÅ‹w®_ÕÑÖFèëWiú4BŽFí÷êÐñÌùè¾½zV¾^›Mzõè~úì¹9 ¾=Š4,§êê-êMÉ eÞ‚E3üæŠ%“idh°vÕŠz{ä$¡­­%íF&Ÿ§¬¬¬ümhmó–­Æ††kV® ÂÊÒ‚Çã-^4wö,Ò[}==[‚ Ö®ZéݱsVvŽµ•å“gO5ÕÕe¿ñ é¨[Ö±C‡…þó*4‘=[[¶ï¸tùê­«—tFcîI– IjzúÆÍáÆFFŠŠ yùyb±ØÃÝMSCÃÜÌ !T[^îҩ㩳ç/˜º~ó––¦¦‘a]GÓ_¹víÄ©S‚ ÑhJJŠ'j@iSµH¬œ´‚8ábE‡‚‚‚­ Avv—®\½vóÆıcŸ<}Jùj dϾýT*ußîU'•J¹ríúÚÐW¢Ï©©©þ¸¦ý²èoçÝfÅê‡Q¨T±Xâ`g÷¯bþ[_І°MgÏGøøIKSƒÍbñüê^UTT¯^³ty0y7“ÁxûömÁgåäP(Cs+òw •ZÎã‘?™™™N7.rßþÀŋꮼ´ÔÕ¹}Ž¯•H$ä³>zdgc#ÍâO¸h–dçädfgGîÛOZžA§¿~ý¦¶b+=3ÓÔĘõ­á¢£­­¬¬œ–‘Af˜²²²Ø»· QÁ¯HËÈ ^µúË—/«‚–geç())ZXáo·D"ùôùó×9Hø¿¤:*•Æ`0ÆLœ,‰ÈÀÑiô·ïÞU 0BHUY¹° |Ó÷>’Á ¢ÑhŠòòd¤3 ]¯ !£F¿DMM-tÍšYsý[{zH§Gv|Ýê•æff¿zå;z\¥_+çdB$¯ Zîåá.½(++[GGŠššÚíkW***¤>HóáÝ{÷ddØGOœ:xP#¡ÓèZššÕÃÜ$º’~ ‰dÒ„ñƒú÷û§kˆÉú^„tØÛÈа´´4xuȪ å„D"ÓÊxeÒTUQQPP JÏÈ´µ¶®¹é™cc#Ã:RAHø|þÈÝÒÌCHIQ¡†6J6µ%á`gº&D(VÎÛcjµÔÛøù«k—+×®›<ÅÃÍí›jµ Æ86.žÁ`?ˆõôð@á¯"Ý òLII‘l£´ÔÕqÜmoíȹ|íz¿Þ½0¦Ô1ÒYyIÑ€ ÿTÕkH¨BÈP_ÿØÉSB¡F£5P ‰ZjÌ6VÖŸò>Ož>óú¥ l6»ÑÊ-AS&NèÖ¥ ›Ín©«SG…£¶¼¬¯§gfbrö|ôø±cbãâW,¬»ÊÂf±454HE´µ±NLâ:zÔÞÎcŠH$jH˜¿+iUoÄ“Qf ¯1~þâ…¡AcGB”šjjhØX[- tt°×ÒÔü!qýtBAA¾öÕ±ÿ1-=‚)æff¦&& ãNMË›Ò3³Úy{·oÛV[KËÔÄXòm“É"‡cÉÚ™Œ »…ªjjZš¦††ôO®­%ÂÒÜüÕ«WŒ5ÔÕ5544ÔÕµµ4¥=¢| >æîë7o¶íÜUããêÀÖÚ&1‰[¯KŒ1WFÎÐi¢+ ·•¥ER—4#iyÅš‹´‰­õ“§Ï*ø|òÝß¾{WXXX½ÂKšåË—/¤†YYZ‚Ü×¹ÒøÒÒÔ¤R©,&Ó»µ×ö]»¤ 6È"`ÝÆ0k+«:R™©)•JËÌÊ&ì¡®®¥©ÁbÕUK°4·HÏÈPUU‘¾)9¬`gkS^^^y!MÓˆA‚[¿öíÛwgÏG“Wj³ Aå³æú¯\8}Êäé~s…B!AL #D¦äïztqI ˜Éd „Z´P#ǪxÂb11BeeeÒÍ×X,VyEù¿²›õý±Ò{cãâ©TZ¥x¯Þ½zb„V­]'&ý_Û;X[YÆÜ»_}*™œœìé£G””” õ©þk£Šhõ-LMŒI¡­ÞhC ÈË>CŸÃââ²²s=z\c0¬,,"÷G¥gfÞ¼}çÅË—MNh•Ÿ={žóðBhæ´©q ‹–¦¦¥§¦¥ïؽ§Ë÷îÑCKKs؈Q)©i ‰Ic&N¶²´$‡HBT %çᣬìœqqëBöíÚ=x@„‹³³™©É¤é3._½–•sûîݸø2Ë…®]#‰Útì|ôÄInrò…K—zôíÿìùó›¥ù¡¶T7jÄðM[¶Fî?™•”tê칺WûŒ=R,îû .>+;ûäé3dÿªƒ£ƒý؉“¯\½–ýðaB—JiÍ\Œ1SB×®©¼cC6Áû/Xä`o×­Kç)'´PS[°dÆXMUUII)|ÛŽÌììó/Öñ¸wï?ävŒL{Ï^¼X´8çᣠ—.¯X³vü˜QuË€ªŠÊÿy™4mÆÍÛw¸))—¯^›=Ïc¬¬¤L§ÑΞ®ÜÎ&bÖ´i·îÜ \±2-=#!‰sÿAå:ÜñCQŸ>}^Ø öª#/40//?dý†‘¾ÃëõçKqñ“§OÓÒ3®^¿á3rô§OŸ† L„wëÖrr²ÓgÏᦤdde½«´yE•"±zÒª»è¨ kBîÄÄ ñyùÚ5nJÊ[·ç-\Äã•ËËËS©Ô /—––ý+Åçó‡—š–.­†’q½Ï.›5~Ê´F1^KÄŠå`Þ‚E%¥¥êjjn..d–¬«&r¹«×­WTTØ¿9Ýc½zŠD¢ââb²Fâáî¶w×Îu¡:,'+;xÀ€6^žÒD"++»amÈ a¾];wöòðh„‘^RR" kì1...&»ÖIêÈË 㯮]¢/^"«¿u ¦ªvùêÕŽÝzÐè4õ-œÎáùË—®Î7Ž£ƒµ5FH „‘ µ@#ÖÝŒ¬,2÷&q¹f¦¦nnÎGŽ£#‹Å »ÿJúÎË›2c–žžÞšAäé`–†ð9/oÜä)nÎ.KÎ …`·†è+“Éüü9›’’ÄåÆÆ'|øôÉÃÍÕÕÙÙÉÑÁÊÂ\,–k:t­µîR(”̬l²½›”dbdäáææÂqä89±ÙlÐ]i!Èd2Ã"¶œ<}fsèz;‘Hf©Ã\ ãÚ›‹—­X¶´sÇÐo\wÓŸÉ`ä¾yC¶_ÄÅóx_ðŸç' µ@Ñ]J£e?|Èå¦Ä%&ÄÅ'êµjåéîêÌá8sœäeeùªî’‹g- |üäé–Mµ45aß®*Ÿ<ÕÊÒrEàRhýÿ»:K£Qi?æ&§$p¹bã[¨©z¸»9;99;9ª«« °ZûWÀi´œG’’Sâcãâ[êêz¸»¹p8ÎNN r|þŸ¥»dòÕë×/š3sæÐA+** |$‚A§ß½ÿÀᢥ ôø«ÿÏžG&]üJ¡àŒ¬lrñk|b’ž^+wWg'Gg''EEE@ ‹!ý µÀ¿u—Nôøq"79>1)6.N[K‹Ô]ÎWp”””L÷›+Ãf‡®[Ãb2ÿt¡e0BÖo¸uçÎîm[µµ´þÌæ>AŒé †X,NKO禤Æ'&%§¦Zš™¹ºº8;9raZ |·î>~ò4)99!1é~lœ†z OwŽ“ ‡£¤¤Ôìu—\´{ﾑ‘ëW¯òòðøcg•””ŒŸ2ÍÐ@upП¦"•¿¦¤¦qSRâ³rrììÜ\œ9ŽŽö°ø­~î2èô'Ïž%q“ã“îÅƶPSórwsvæ¸p8ªÊÊüæ«» ååßOž1ËÓÝmÉ‚ùT 9 *.>av@@€Ÿ_ÿ¾}þ~ão‹_é%%¥Ü””¤ä”¸ø„g/^¸:s\9ŽŽ¶6°ø­~^„F£ÓéÏž?Oâ&'$%Ý{§¬¬äåáîÂqræpZ¨©’,›SDNQ^²&æþƒí›7èÿðMç[3™Ì a›/^¹²{Û––ººÍ»ßøŸÅ¯yyÉÉ)‰ÉÉqñ ï>¼÷pssuvæ89Z™›‹%°ø­~}{—Jc0èÏ_¼LJ&u7V^^ÞËÃßUWWçóùÍCw ‚`0èâæÎ_0nô¨ñcFUT4ó^YYÙÄé34Õ5Ö‡¬j®­7éâ××oßrSR’¸)±ññeee_ç::ššÃâW´hteÖ‹¿_q¿é.›Íöòpwqæ¸p8š>_Ôôu—Ïçû,(+-ݼqƒ‚¼|¦ P(莌²êKPÈëÉ))ÓçÌ›=mêÐÁ›_­‚yöâerÊ×ů4ÍÓÝÍ™Ãá8:èëé‘iò5Z 4zÝe2^½zÈå&p¹÷ÄÒét/WgŽ3ÇI[K«é.4$'L;qrÝÆ°àeK»vîTe“N§ïÙ·¿WîŠ ù ÆÒà>ƒèëKÃIöoÞºíäé3»·n10Ðo6ýÆtF£=|ü$9%%!‰û .NMUÕÜ3ÜÉQSC¿ µ@“oïæ¾y“ÄMNHâÞðS(­=<\œ9.']~,ã0Æ?}š2c–‰±ñª @Téø˜û÷ 8`꤉V¨‚xóöíß‘††G÷ï…c‚ ø|þ”™³åädÃÖ­mÒûBײø5Q¯U+w7WŽ££³“ãŸ0—­þ\Ý}óöm"79‘˽÷ V"‘´öôpá8»8;µÒÕýºûôé3 •bh`ð‹KLrÉiXxÄésç#6†Z[YŠD"׳ÿ@òlàÛW/7ÚMø(ÊÊ5koÞ¾#‘Hºvî¼(`žD"ÉÈÌœ2söÄqcGðý½ÛwñáãG‘P¤««Óð`H¿JÄâÔÊ‹_ÍÍ\]`ñ+Z ü©ºË`0Þ¿ŸÈMNLâÞ‹…­¿õ3ëëµâóë×]æç??-#cßÎÚÚZ¿å-2³³§Íòëß·OÀœÙ>#Ǽxù!$‘H¦MžÔ¯w¯Æi±XÜ®K7ƒâóù!+‚Ÿ>{vàÐá[ÂMML~û,ë×oÞŒž0©—çò%‹ë®¯H¿òùüäÔTn²tñ«­›‹‹“££#,~@kà«bQ© &óÃlj\nb÷~l\yy¹—‡‡›‹3ÇÉÑP_¿¶ö.›ÍöhÛžìÿܳc›~«V¿%üB —.ËÈÈ,çó© yUFVæZôù >¿Úü艓;÷D’ío„P$´±²Ú¸v Fûí‚ôìù‹ñS§R)T9YÙ«Η——W78yòkII 79…›’›øìùs''7WŽ£ƒ­ ÆH €Å¯h-Ô¢[äÇOŸ>'&s’¸±±qÅ%%^ž®ÎÎ.NNF†@:G4÷õkŸ‘cX,&ÙVÛ±%ÜÔØø·ûӧχû2ètéE‘H´lѶmZ7¶âžÅbuéÙ«¬ŒWù¢†ºú±ƒ~ï´ã¬ìœ)3gÑét„Ç»rþœ‚‚|å„‘——Çý¶øõý‡în®®ÎÎGK ,~@kà¿ê.ãs^~79‘Ë}WXTäåááêâìÂq464:tìxøÖmÿ´Ï„­›6Z[YýÊIIAÐé´>‡}ùRå' õÓG—WT4*«&r“ý.¢Wª×Û·õ^¾x‘à7ÉãÄäd?ÿùdÏ6BH$/[¸ {×.oß½KJNIJN~_VVæéîîÌqrvr416ÂâW´~°î2ù…IÉÜ„$îƒØ¸¼‚ uõâââÊ.AØúuNö¿Lni4Úêuë¯\»^½E(6oXogkÓxš¶ }òŒÙÙ99Õâ Ë/jßÖû7-…sïþü¥Ëªœñ ¦¦öùóg …B.~uvr„ůh-ü:Ýe0åååíºþE£R«jŸ¿nõJOw÷_3 86.>`ñf-Y˜™íÜÁo4£¶yùù½ú”‘‘©þ“X,.(,Œ¿{‡ÍfýÊ Ñh´KW®­ZÍbU}.›Í>~(JEY¿ µð{xóöí Ÿá…yŸQµ"˜_Á4 ¿Œ û§gŒSÓÒ>~\›@à3xP•ÛßHZFÆÃG5„#Ô¢E -MMk«_¼T©°¨è\ô…*•%Y9ù²²²ÛW¯ãñZ ¿¼u‹ÐÙsç—-_®¨¬Ôkðà?á0€?‡g^={ÖÌÚV(/[êåá-Z Ù@M:ÆMI¥R(ÖÓæÏ¥mN܈Ž¾|ú BˆF£%§¦¶ñòü3¦š%0Є`2·cî aj3EG[ËÜÌ”ÇãÅ'$Jg&´kà—Â+/?qèàÝ;wîr¹`æGK]ÝÈÛKJJþ~õJ €Ah×Ào€ mm1¬ýh¾ …bh`Èh- µZ  µ€Öh-4E0B¿f*,A„¨?ÿqAàçOÃCKº§þ*{h-4\qãÂ…ëÑ(?m@‚ ¨±É³ù0Þºný…Ó§ö–„¥Å%›W®úRXôú“ž˜tx÷zƒCKÃøøÞ}ûwì¤Âž‹h-$T„.8ù(3«e(ÈËç>ˆ¥4,ÉþûO!ŒqÔ®Ý]Ü=)ÓŠ»s'ÿÓçzC%óívvš‰b‘ˆéðÁÂü¼SQ~uág!ÄlX»#w÷nü»”ï)e’ããß¿~ J ü±À¾QP›¦ÔõÛÉýûãïÆxž?[ï±y²³Çöî‹1}S2Yy¹»©Éêššú&& W¬sÇOD¬Z]VZJ¥RUZ¨Ù»¸Œ™1]W_¿6÷Ÿ>|œ5|äáWåêö™ñ$ß‘lY™uÛ·Áî—Z õC„,Æ„¤²!‹P9BäA „¨a„$ñ’„´ç#ÄDˆòïÞ‚ Ó¾ÝR!meÒht:]!Bb„Ê¿ùÃDˆúo— •ÁdG„«kj~½B¥”#ôWÏzö($ˆ*±AP0f!„!Äÿæ3¯´”Ébí:sŠ_Á/ÈË;yàÀ˜ž½÷DŸÓÕÓ£bÌ@ˆ‚!1A`Œ1Æ4:-#+‹B¨ì›ï S!!B¢ož³dØ,6»º%™“æ#ôïZÁ@ˆöÍŒD¥[¨3 T2/üÉ@2ÐÜÁ¸µÃ‘}ûɯ¥Å%ÚºYéé¡çŸLîÛžãâbfÑ»]‡Èð:ÆdÇ)¡c‘ûzµmïjn9f¸oaÁ׳&éÌoÏqq65Øõ¯„˜©t¼Í͵04v02?l8c*B±·où«»³©ùÀ.Ýî߸)Í]„D¢gdhlaNþššÚ·ßÉ#SMhïߺ­«Gk3ËIÆ¿ÍÍ•víb„L Œ-̽<Ãw픕—?ä㸘{Ý[{»š[utv ¦}ó“Åf hãí`db¦©]Îã!„Læ¼±ãÜ-m:p\C/Áß^¿FXO>¢­#ÇÅÌrDß~3³¤?}),ç;ÒÕܲ§w»#»÷Ð+Õ6­\Ýžãânií7~â—Â"˜Юš'²rrôo§Ä`Œå¨T*B(ïãǜԴõ{÷°XìOžl_·þ]nî²ukÅÞµ;,l²ÿ!$FˆÎ`ÈÊÉU 9ãmÃ.Ÿ>³xÃZuM­¡¡Ó†øDÇ=×TM¦Ñé~FHßØxYX¨ŠšÚßOž®ž¿PÏШïp„€Ï;°_«eK‚°Xl„D,î>p€¹õÇ÷ï7, ”•—Ÿà_›… Ÿ4±…†:Pä¦ðyãÆ_Iˆ"„*).0rÄäÿ‡ÛÖ¬ÅÊ1£é/žå÷âé“u{v±ed6ù}øüYؽ@k? ‘XÌqq!dnk£¤ª²hÊ´ÉótÔZÙµkÐèQý‡“ dcmuóâů M„ìœ9dÏó¢ÀeçÍIKstsCQ©TM5U²g•ÐÞÍGô4P„íäI·.]¾}aÌŒé!›= µ7yd‚X$ ŽïУ{m!<²{Ïš];Z»»#„V†oncn™œ˜hïâB†ŽPByŸ>mÛ»¯¨ À³c1A¨kiêjkѲÔÓ»{ýzvZê€á>dCSU½…¦Žvå×÷hß®…††¹µõ³‡o_ºâà_›Š ÂÅË“ìWŸ¸¬Ÿ§×«7oµuuB-õõû (@ÈÂÚª0/ÿè®=£ÆŒ~ûùó­K—ŽÞºa¤«‹Z¸6dHûŽ¹ïßëhiAÂ@kàŵMŒPvjºŒ—ga~¾¥9ÒI DH¾ö|Ò:¼oô±ãïrsÕ44ddeaéiNÎãììûöcRéô÷¯ßPB *øë#÷¨ki’ê­¦¡Q[ž?}Æ`0Lœ,&ÏèŘN£|÷î«ð„±)9ÚBCcÖÒÅ^^"„^}"'F}mk²ÙÛÂ6y´o_˜—·iÅJGw÷V::åŸã·rž¿œ‚‚W‡£’/_HÙ627»ræÌå‹—L¬,i4:…B%UÄÔÚjoDıcÇM­,s_¼èÚ«×ÈiSÆMX±,°kŸ>ãt.wĸ±Â†U””’î?èÚ·¯††z¿Ã÷mÙJ£ÓmœœÊyeß½ÿ«Oï:¦éÓŒ=a›Í–•)ùRLꪦªª‚’RÔ¶¾“'¾y•ëäî^w0J‹K²3³Äbù‚- ÍÌ.Ÿ>wï¾N«–ùŸó(”–-”–gdfaŒܺ}æÐáù«W•#¤­¡áÙ¾]è²@^Y™‘™Yñ—¢ ^yëŽ$)(*e§¦åææ6¤q µÐØ!1~\Q~þöµëŠ ••¬””¤íÚ÷oÞÎðNg0Úvë2'h9¹€µK÷¿ètú­ÛmßA£ÓõŒ ÍÍ„zøúï¿7¯XY—'+'§ob¤ ¤ˆ1öðòì;|ØöuëÊy嶧½z¹zx„ìܱ'lÓ¥“§¨Tª±…Šѣ¨TªD".-)‘H$UÂ)ÊJKÉÊÁÄysVÎõ?9}Áüéóæ*©¨œ9t(bUˆœ‚|Û®]»÷ée¥¥ÕÛ§t:}ÍÎíá«BFõèE£ÓÔµ´ÚuëJ.´ ß¼vÑâ‰ýjêè´ŠØLg0J‹‹¥CÑB¡°¬¤„ü\Á+Ïàrbbȯb±xYè†ñ~³ óò–Ïö+-.–SP045eÉÈ „ŒÌÌ’cã¦û  …†¦¦KC7tìÚE„€ VF„oß°1rÓæÏ>(©ªö>¬MÇ"‚9uÊ¢©S·¬Y»m+l—üàüü|°дˆŠŠºŸš¶oŸ¤6¹­´£!²}™s/`ü„øÇ)Õ6søÚêEˆl‹"$&„Pe¯$ "jß´ñ­+݆‚‚!^¥ ¤õ\BeÒÝ$óGº«!!A`Œé1*­¥CXr ù¾•¼¥|Ûq!$S)$4„˜•Bˆq•Áê „DAØQéÝùßÑ2*ŠÿoËS0–^ja‚ X#„*jïоzîüy¡P‰€v-4ú*$Æ’J#šU~UÚRªJ¹Ï¯æ©^åõ=Bê!AµÛËj  é•n!*m;%½(DHX-Àu‡ýÛôïT@E-fW{wrž6¿vË×xŒ1¿&ƒÀìüAˆD¢Òâb(ì­€ŸE›öí¾{#€™±€ÖÀOBŒPtcZ  µ€Öh-€ÖZ üÁÀdâæ¡0?h¾À¾Q@ÓC$¥%&®˜?ŸHšœž „ÐÏ^à‹1j‚kˆŸ?y"¥Ïh-4†ZPP@£5±Ô+vìÞ3h@ uõŸ÷‚ vEFvlßÞPznAÍƦk×®°2Ð,³à§Cžä:p˜o¿º9B(ú¹GÝ<~òdÜä©ÇEijh@Ç,4`¼~ºÐÒh´Ñ&zy¸=êg -BÈÜÌ,lÝÚ¡#FÁQíZ Í_h™ Ƥé3 ügÏâóù¿æ¡ÎÇåKæËãñ@nà·ãµð3…–Éô ˜/+#³bÙÒ >ÿ—õèJ$D{oï’’ÒÃ|Ï8F£Ñ 3 ] ÍPhYLfàŠ•_¾|Ù¸nͯZ±XܧgaC1Š D €Ö@³‚ÉdlØþèñ“áà·4+E"Ñhßáí¼ÛŒ7žF£‚Üh-4h4Zäþ¨;wcöïÞ)‹cÿ-_ ð›9ÝÒÌ|ÂÔé ä@k 9@¥RÏž>|ìø‘ûÐïÞ c\QÁ\²PQQqÖ\&“ r  µÐÄs…rëΰˆ-'E5’I¤Ü††¬æ•—/YĹÐZhº`Œ“’“—­8~(JFF¦ñLýÅó‚á›^¼x¹nc“É„ÈÐZh’1‰l‚“B;rÜ„‰Óf°Ùlˆh­€ßNÏÉyˆò9úõë7!@0h¸oÀ?/÷¦Ò"Ä+)*Ú?'`~vÎC„D"6zLîë×yyypª€ÖÀoÍ0JFVùyäø iƒ†;jT÷n]$MêàzŒ±¦†Æ=»&L–ž™9Äwä‡ÉæôŒLˆh­€ßFÎÇÒÆ+•J1gž«3gøÐ!"‘¸)¾Ž¾þêà )3fIî©ééÑZ ¿Ô´t:.ýÊ Ó/_½võúõ¦8§— ˆOŸ?¯Z»ŽÍfUn捻¥U~G@kà×A£ÑRÓÓ+ÏÝE1™ÌÅAgÏGÓšÚŠÕׯßøŒ]}t6-=ƒ«o´~ #95­úu‹µ&tãC‡«Èpc&çᣑã'Ôø“P(züä D7€ÖÀo 7÷uIII•‹‰„Çãéjk£ß}ÌÀwQZVjinÎãñÄbqµ*=%- ÙÀzŠ€_ AMHªšžÎ`0ÈÏb±X 8ØÛ·mÓº}[o]mí >¿ºn5Z˸:;·öô(/¯¸sïN̽{±±±˜¦¥P(ié™úö‰Dbà‡€óóóÁ À/£¢¢bÅŠMq&Æ89%åéó¤.êhk{y¸³˜LPøÿ/«•‘‘Y¸páÿ#Õµ…ùìÙ³©©©u‡F£ÑhÔä”´¬ìl„1Ù´Ô¯Ÿ°‘i­D"6l˜¹¹9ä#´êâÌ™3!!!“'OþáºÒta0~~~)))-[¶ü±>ËÈÈhjjNš4IUUµÿ›eú àIDAT*..ŽÍfoÙ²¥i-e}ÈÀ/†J¥ZXXøùù)*ô“æUI$’éÓ§ëèè4+mß¾ýÁƒZ€¦ÌÐZ­´@k´ÐZ­ÐZB5lm[òZ ?„«×o;q²úa|¡pâ´=þ.ßöEŒ¹¬  µÐôHâ&¿ÿ¾®fèåìùóIÉ)Õ¯ ø‚k7nTT”—o»÷î{þâeS·ö›·o“’“¸©Ÿ¿x‘™ ‰hÞÀ~È@¦Ï Á÷Fjii‘_1Æ:F C,þº7}¿âε+–ßï÷<Þ#Ü ¬²nƒP(pvr"M½.4,|Û6„…B¡ÓèŸ@H(Ú··}[ï†{;{^€«3ÇÆÊ Ò3Z ¿òT×*g»J¿2 6»²{99¹IãÇuéÔ‰ü*!$†u [›Ïß¼ê_«^GDc6oÓé´Ên}‡ íÒ¹#B(##3hÕêㇲeØAèëW7 )Ï5F(Ag2™Ôæ ô!‹qqþêÑÊÄÌÆÉyëŽd¹\XT4aÊ4cKk[ŽË’åAäE„N÷9J×ÈDM§eÎÇdQ®©¡aiaNþY[Z²X,Œñ¶»ºôèefcghnÕ­WŸ$n²´)ܾK7 ;# «A>Ãß¼}+í}þâE÷>ý Ì-ÛvîzæÜù…J(Î ˜onkonë0ÃoŽ@ $‚’5ë7pÜ=,¬ÆMžÒ8$ƒ:wþK{G}3 ïŽËÊÊÈŸŽ?îÕ®£¾™y÷>ýRÓÒ¥·Ü¾£kh¬kdâ¿p‘¦††­µµ­µµ¾¾žX,¶´°°µ¶¶³±‘—“ËÍ}í3b”¹¥“»çÆÍácŒ±ï˜±»÷$ãîÃÇZú†wï}ÃÞ³o¿®‘‰Ž¡ñ–;! Ю€Ÿ‹D"5~âø1£÷ìØöåK±T·zôégcm}õBt~~þt¿9,&sÑü„H(Z²ÊÕÙ™ M uÒ“*$Ò‡ŒÌ,õ-Ö­^% ÷8à;fljB›ÍF-ðŸg ¯ÏðƒWN˜:ýò¹3äEEE~3¦ëèߺswî‚…²²2;v¬ì3Æx Ïp~öÄ1‘Häç?†ŸßŽ-¡À+Ïž\¼ÈÈÐ )9…[ÓÐïoc¼!lS"—{$j¿’‚bZF†¬¬,BèøÉS+CÖ®[½ÚÒÂl÷Þ}CGŒâÆÝ—“•E¹8sV …"YY™Úô›ÇãuïÛ¯w¯ž«‚ƒž¿x1ÃoŽªªêˆa>{¶osñj³sO䄱c&OŸ9z„¯wk/ò®~}zO4Q"!å! µðs)úòE$¹:;·jÙ’ÐýÚÙxæÜù2oÇ–p„‘¡ÁÌiSÃÂ#H­%¡ª¢¢«£ýOG …2ñ’™sæ’_Ûµõ>°g7ùYCCÃÖÆš 'G#KëÛ11uéBD§íIóçÍé?x¨Ô+gŽSÏÝB6VV/ÿþ{ÛÎÝU´–›’’‘™õòqù5pñ¢a£ÇŸ=¸´O¯ž!kë½¢§Áóòó••ìllBzz­ÈzÉÆðˆþs»ué„ ^¶ôô¹s—¯^د/BˆÉ`j¨«×­ß{öí×ÑÑ^¸ !¤¯×Ê×gèù G óa0ëV¯š2cVaQÑû÷ïÏž8&íI–“•Õþ6è µðsQQV3rĨqãû÷í3Êw¸µ•Æ8+'‡B¡š[‘|*µœÇ«Í‚ fN›Úã¯näW6‹U] BªÊÊ……AH$’À+¯^¿QTT¤©¡É`0ƒÁ@I$„ÔO'{ûËW¯Uñ*+;GIIÑР“y‰Dòéóç¢"±Xâ`gW)XÑÚALŸ2¹÷€AÞ;5Ò×g(Ƹ¢¢¢   xõš¥ËƒÉ€3Œ·oß6ÜÛ윜÷>’f!¢ÑhŠò_[«:´ïԡ݃‡vl‰øÞ¡q­€Vú/Y0ßgðàm;wöê?pÔߥ ¡¦¦vûÚ•ŠŠ Ò™TkôAEYY¯U«ºD¥Q%1ž·`QrjjøÆÐVºº±ññó.ªqÊ0•J­~™HazbB¯LútU•¢¢"„ •ÚÈ­1ÖÖÒâÆÞ?zâdĶí›"¶FŸ>¡¬¤,‹×-÷òp—º$û–B G A8ØÙ…® Š„•ë7äˆ@rJª¼¼ÜÁ#G*û͘4®Ò!dh ¿>dõºUûDˆ°47õêc uuM uum-M©{¯Œ,ÄÿÛ3²²ú÷éíêÌÑÒÒ44Ð'$’êâ1¾y玭­´‰J>ÌÊÒB ä¾Î•LKS“J¥šš˜0Œ;wc͆ì¥2pÀý[7äåå9*#Ãn¡ªšš–¦©¡!ý#k™LViYú6¯¸6›[š[¤gd¨ªªf!-CF–Ÿÿ|CCÃk/ܼ}çÒ•«¤{“UÆ㡺f ] µ";îîæJÁ˜›œÊf³1ÂúõÝ°ióàá#æùÍVoÑâUn®¾¾ž•…BÈÊÂ"r”¶¶v^^¾¡¾¡ÆøÝû÷YYR?UUTt´µk{¢¹©éÙóÑn..ê¯ß¼ÅøŸÚçÇO3³²Äbñ‰ÓgîÜ9v(Š yyy*•záâeScgg3S“IÓg,˜7¯UË–Ÿ>b³Øn®.ã©“&­Û„1vuæˆÄ¡PÐ8k6×nÞT—×PWÿðácii™²²2BhÆ´)Ë‚V¨ªªvhÛV(>|øÈw˜BÈÚÊ2úâÅ+×ohj¨üø©K§Ž5ê÷ØÑ##÷ï<Üwú”)JŠ ?qwsÕÖÒJLâF_¼˜{_A^>`Žß‚%Ë:vhÏ Ó­­,Ïœ;×­Kg&“YQQáåá­€ŸH~AÁ‰S§‚W…H‰•UTän²ø¾rþìÒ ³çù).ÖoÕjùÒÅäõë×Θ=§ïÀÁ-Z´X³2ØÐÀ ´´4bÛŽM[¶Jýôõºry`yy9…úŽ–”– ‚ Ö¬ ö ˜?rÜøòòrK s*…Š²·µ9yælßAC DØÛÚ9°ŸãèHÞ»d~ÀÚÐÞmZ·ñò®ç>ä/ ]¿vu?kïÞ¾Uþúmùå«_{{7gg›Y[¯7~îì4?¢½42ò%úœy»úàñÒîîîå©©+ÓÓáääÒòó'ŽŽA°¸Zû´þúMæý»ÕÏžnm}O-¦â‹ )Y˹«V«ª@ÏDQT(¢(êj¯ãÞ£é°EK‹‰ƒÃŽÜåðÆ è¾ÆŸÅ÷øx±X Ãðt«=<<<11±¹¹yäÌÝžfç}?ÚÌÜ2ÕÁ6'N›Ïç766²ÙìÞ¡Gý`] ÿ}KxÌÅ·eû‰Ãövä.‡7vxmFöEUÛŸf‡Õn?sËT}]@èœw£@Ö€¬d-ÈZµ€¬Y ²ÎŽf þW« ®Wô+}£è©z½^©TVVV´ÙkŠÇãÛÛÛgTX,–Éd’Éä9(T¹\>õ6–У[^ýé¥F£‘Ëå,PZ$‰t:]«ÕN}æR©T©TÎÍŸgnn. CFµÀ_,/@Ö€¬d-ÈZµ€¬Y ²µÐ~ZÆ?´¸IEND®B`‚codequery-0.18.1/doc/workflow.dia000066400000000000000000000063441300045745200167060ustar00rootroot00000000000000‹í][oã6~ϯ0Ü—]Ôex¿ÔÍÛY´ÝÅ{iûÒ—@¶G;²äÊr2Þ‡ýíKJÎÄÉ‘EQ4ä¡ù‰ùï’ß}ÿiÂl¥ÉÍ8„É4EÉüføÛ¯?~#‡ß¿»únßê¿y,úÉÊ\Ý ïó|ùíõõãã#ˆ7« O3Gk° ¯ÿÄqp­ ]ß] »Ì‚<0ßm¿ ò<‹&ë<$Á"¼N‚éÇy–®“Ù°,µ-7Mã4<ñÍð«»â3¼ÞVs½Wωº—Á<œdað±¾j¨?Jµ©zf‡Õ.–é*ÒEòÍò¨HM=æß2ÛR+](™¿ûêC˜çaöUy[Û/Ÿë«ºÙZ |dó(9ÆÒÏ'.Œ(óáH2± OÏå|¸I¿pq¿pY¿pÑêv™fyDù1ä$Mã0HJÔ<[‡íqVÓ Ö]ìT³PûÚï¢Nïƒ,|3ø!ý4|"Z†D³›á?àþÓ:lŸ®MáÑãZ¦Ÿû\RHGðçpÌ!u“É!B¦$ó8üŒBJÆÆ„&éCÀ1CíPÃ8\ÜNÓ,9 ]6®€)xå¸OœB Tí|¤Ö}Íïóz0$ a T2ÉÚMÒlf/5 Ë¢ "Än·ºOo+„k‹vŒ¶Åáí*ßÄá!B˜¬eõ´]ÕË`6Û·ôGϪå«ÈÃOG/üõÊÔ=åBïî•;Ç5Âø„5©“&i’W™ïwÁ"Š7ú~‚d5ï£`¬ò§?‡ñC˜GÓ`—Ï¿ƒ£‘RùN$ÜÿP;Ð}.­¢=@T#„–˜Û¡í›Ùþ„v@ZÄΓEXýJŸ‡jˆRiDë„Àõ³ÕkbÿšN×Åî8å[[ˆlm!\a…GR› Î…C{¨‘è‰h¤±HAŠM·!´-ò"̃—ˆdMs—·“GØÈêJíÉêjÁv-¼ö©±Í}ú 0Ãëì¸WÔóÇ9wQ7€ØF¹Sû¾|×Ây•~eÇ¢¢£ÎЧÈøEw‡ix5Mg¡×®õi¢)@ÉázÁq•ÅÑòö>Í¢ÿêÄ®<”F+Ó¬Ö˜ ‡­ùê\UVœÀ¶‚L;»„¦Õ„”„‡‚¬@(‘4# âd„ hÜL2uÒÈf’‰Ìv¼y—q  ö#ø"âQ¢ßÕí! V š‰|Í‚æm„+¦«iºô"Â}Ðn¨bI¼‚è:dQm‰­qTk:!4á¹ V(€d M¬B›F„´½B Xºø/šÆ.šØÄ2bmäÙ®ý Nƒ bx{ÓèMãù¦1æ+oû°Œš€(àyçºÏh>µµú¥Q(…ö«tëÔ}¼þz=Üz¹iBSˆ¹_JK­-ÎSÀŠd Ü.÷°o\‰¤Yì«P/‰v`~nåŒÇ‹àc8›x;ëÚÎb Ìü®þW1oh»˜]ùE³ð,ÈfÚ„|Ðâ»Â†k÷ÝäÆ1>RÚ§ÒéÄŠîœ1 Já±d CfRU0$-™dš&Ém˜ÌŠµjgýD‰.J[O”è¾3]ÞOÕâß³ŒL2» ²,}¬wÀ0¶¬ú6“ùiß›ÙB¼èÝ7D0o_w2="VGÖäé÷z mY8O‹DÖÁóÿïà¨/TümL÷ÌÜQ7Ã\v0Ì!¥äv5”AB‚$¨#¦u’æZâ¶Á®s†yu;k#p¦ âokˆ“ýQ*ÏáÌñÿ=šÿÌÆùS4^Ys BØÎv5ç‰HB™< ­þ8BåbYŽZFæÓ,¿¿}y×5²N“6.hãI›[O³h_L¾­™çàë<Õ^`^á©uäzJꀒ„‚çpßÿ1î•“õ¶$H!m,m3BÒ(ĸŸŠH¼¥£•)ÂÒQUóNc”ðTÔ¸ Ð%g¡œõùÌ"ì ­Bc"0ZÓ­%¬÷–À@Á„ ]Pé2íÁá-Ác‚C²pZpÛEx¯!ù¡‹ç×$¸ÏQ½÷ boç(åó|þƒÏ¨ž–Yl–Yj¸Ì&WzŸÎ­Ãlse¶ß›«°Èø³Ÿ´q>i£ýwQ¬nØ ÎùYŸá4=âå˜7²ÞqAàÂ'D.E5Û¶3†Qb¬Õ ’¢˜ ¥­W 5ŽxW7ò„æÒåÚ®Èñï×êq‹ˆ·ö‡„¼_ÎB¤?ŒA„GZç»uÂ(+P03.¤Å*:É»HvMk˜ü¤ööÝãNý#泜g;i!ýG!¤úíozx§±—Ð}Hh6â@RŸöÔSÚ²^Pn^ßÆÕœŠCebPŪ‰öÕMRø¢®¥auëz°6i^¾-Yx(íÎKvBÄI˜~gxÿjÌ^E„ÞzU"f Hàs™¿ÅÀŒÍ(E*#„ødÂC>¢Ä „~Âqg| òö_{(n©Þ^ì ÞÃ*—ÅâeæÖex‹3&È"BáØeµm\³íe”ÜÓƒäöwó>ì9+vVaMï¯Þð.l.,Wd„€~ñNo^¬è‹&é–h¾ÇnÝX e±a×€…#[dõs[gûžåÈV5óDGnoƒ¼7{1Þ,=Ë›uE[çÌÊœÙbÏ^vìÐÊmæ)1.m‰…ð­— M:¤wj_SÛ@„X¯9QsÞ™ÒÂíÚB£N!&f 1W˜€”±"î†VŽUHm;ëQå $^ˆ¼1!b“û~°þXô”m¡ý> ëÎHžšNì¾-Vªn¢ÔÓ .¦öS$¢Ø\Ìñžl%Œ9å\’±†“²@e’É×]z?¼ÿúëÑàïÁCà#L®#LÕ=ÒÏà¾æÜ:zb$ 5‹M%§NÓÈ>a®ðøé’ØZªõIQž–œg–ÔôDOL¸^óRK”Üä%*°ÛÔ¾EÂJà±ÙU‘52Ç(]N9wÒÈfÛ¡IÎv§œe/+'ü”³Ÿrnkq‰>KÍ1›Aº “«UºÎ¦a‘å¹òƸ‡YhÈ5 ǨÂ~w°®g¡ëô¼ý¡.(íÝ™Uý.ãŸO(Ȭ€†€CQ\ª‹XýyËÁÁcš}¼ÓbÆŠsB©ê—^Ú_¢´—öÙ¤”"ÌFØíÙ…µ…1i¤J9¢nO.´oY³üQŒëIÌûüQ/æíMî*2Ÿ@Ú[)cïÉ£ÖË©¨~sTö;ª ÒFј"5,¬ÌѺÖ–$§·¶}2¸mŠùãR|Þ×HÉ:+çT~É”,»HÉbRZ ¼†éX(‘0áÚW.ÖQë*”ñ¦Å|–ç"g9X²»¬¾¶„$È^W‘rËæTS‘r Æ´¢B¬@$ýKÂOÓp™Þ{͵ƒVÕ}$ô³¯HKr4Mh³Ïœ.Æaf‹r®iIaNÈ€^-ýs“ߧ‰'$ׄTÑ =]"{¡$LD:•I††Ž™ëK £¯'›Ñà§tte²ÔWÓ,ZæžšÜk¥Ãé™é‹2Sy›0{wU^è¿y,Þ]ý-6ÁeÉcodequery-0.18.1/doc/workflow.png000066400000000000000000001270071300045745200167350ustar00rootroot00000000000000‰PNG  IHDRk}ÔI¸¨sBITÛáOà pHYsÐй‹çŸ IDATxœìÝy\ÙÿðϽnûm¹nÝÒªÒF(…¤ÍHc0D#²$ …,_K"2– Z0ö[¶IFƾň˜AI¶$í»JEt~ßçÛ¯MR=•Ïû5<÷ÜsÏó¹wò|žó<Ï9*++€ËåB>|øbbb„wïÞ€„„!¤´´¤¥¥ !%%% ++Kyóæ ÈËËBòóó cÇŽ„ÜÜ\PRR"„dee€²²2!$==TUU !©©© ¡¡AyõêhiiB’’’@GG‡òüùsÐÓÓ#„} 66–bff÷îÝ#„˜˜˜Àýû÷ !=zô€¸¸8BH·nÝ !!bhh‰‰‰„===xöì!DWW’’’!;w€äädBˆ††¼~ýš¢¦¦ééé„ÈÌÌ$„())@NN!D(@~~>!DAA !²²²P\\L‘‘‘€ÒÒRBˆ¤¤$”——BÄÄÄ ¢¢‚Ò¡C¨¬¬$„‡Ãa8<òþý{æ€SVVRRṘÏçBŠŠŠ˜NAA怣¨¨HÉÎÎf8ЩS'怣®®NIIIa8/_¾mmmæ€Ó¥KBÈÓ§O™ÎãÇÀÈȈÆÆÆ̧gÏž„ÿý—9àܽ{ÌÍÍ™Nß¾} !·nÝb87nÜ+++æ€ckkK¹rå sÀ¹xñ"ØÛÛ3œï¿ÿžò×_1œÓ§OÀ°aØΈ#!ÌçøñãðÓO?1œ1cÆB>Ìp8&L`8“&M"„„……1œ]»v€‡‡sÀ™>}:!ä·ß~c8›7o€Y³f1œ9sæB6mÚÄp~ýõWX°`sÀñññ!„¬Y³†9à¬Zµ –.]Êp–/_ÎpV®\IYºt)sÀñõõ€5kÖ0œÀÀ@BÈ‚ ˜μyó`Ó¦MÌ'$$„2kÖ,æ€ãåå¿ýösÀÙ±c!ÄÃÃ9àLž<ÂÂÂ!\.—Kÿ €nTݦïÖ,o=u8ÿUÏg±NóÕ©YXW9ÖiÚ:5·¹\n[©Óú, ©SõV]ŸÅ:M[§þÊ,Ô¡§„!„ú"\B&Q„B¨!*++?~üHó&—ËåÒ[!„ªŸ‡‡Ç£w‹y:t`.ï"„B¨:tàñxŸ!ÂK¸!„P#p?|ø@Ÿ)G!„Pý>~üXQQñi ¨˜˜˜¸¸8Û!!„BmÀÔ©SÅÅÅÿýwà‰‰‰1ãœB!T'!!AŸÀÅû Í‚™cå[&!!Áv!ÔŒxÌì}lGÒ®]Q•'##ƒ÷AB¡†””äóùty]!„BŸµuëÖ­[·ÒmnII &Q„B¨!ÊËË‹‹‹+**€++++''ÇvH!„P0cÆ 99¹ƒOVVçÅE!„BJJJ^^ž®ÈÂ+**b;„B¨mزeË–-[è6÷Í›7oÞ¼a7 6äåË—l‡€Bˆ5¥¥¥………tí®‚‚‚@ `;¤6#??À€W¯^e;„B,˜5k–@ 8tèÐ ª  ÀvHm†™™™œœÜ€ììì0"„зFFFF Ð͸ùùùl‡Ô–,[¶ŒÃá\»v­ùò¨‰ÉŒððkMÞ,B¡¯šŸŸïââ4ƒ°R[bfföãŸÖiÖ<Ú@„>²µw„ú¦”””äååÑ¥µ¹;v …l‡ÔÆÐn(óòkòè¦Mhi¹òùŽªªãÖ­; ÞÞ[R¼½·tîìêî¾ 6nüÃÀÀ]Vv¤¶ö¤µkÐz,]ºÏÊj¾¡¡GLLb­M–xy…jjN”“if6ëùótÈÈÈ=ú‘hŒºúø9s~++{Ï4èëfc³ÀÔt¦•Õü„„Z^TTê媡1A$3nÜÚ¼<|x!ôíš={¶¢¢âáÇ€' [r^Ü¢¢"úS›¦¥¥õý÷ߟ={¶j!Í£¶¶¶þþþ*** içñãÿ±±¡úújyyE/_f@hèŒèèøÅ‹ÇŒkK«©«+ž;·ZKKtïÞ³Áƒ—iŽÑ"#o]½(ÊÕÕ”‹ËZ¯ÃíÛÁÊÊ‚øød>_ œœtu;%%í-..st\±páÎÍ›gÒ:uëÆ÷îsÆ-KLÜ%.Î?~„„Øýû[¥¥%½½·xxED,ûìW#„äææ6ü'ýÈÈÈHII±Bè«ðù|EEEIIIàµðaÎÍÍ-""¢%÷ØÂh555mHe¯Ã‡ãã“UU; …r4ÖäìlC7ÌÍõ]]í/]ºO3¨§çPæ#5›JJÊ8{önVV¸H¤=zhÀ“'©·n=>}z%Ÿ/ÅçK¸Ž¹24t=‹š6mˆ@À€)S–,Ù¯££u'++œî(0ÐCQÑùíÛrÉú¿Zyy¹’’RC~„oǺuë-ZÄv¡¯B·?ePEEÅ–Œ€™Ð¡ízÿþ}]ãh%$$ þý÷ßÏ6¢§§6?$ääĉææú«VM²¶6®YíäÉ¿7l8ñêU6‡Ã)**<ØŒ–«ª ëiª¢âƒœœ4MŸŒÔÔ\yy™ŽeéKN¥¥ï Jh‰ŠÊ§qMGEE––Ëår8èÝÛ›iA^^&--O__­þ¯ÆápZøª5{ûömii)ÛQ „š@qqqyy¹¬¬¬¤¤$OII‰ÃáTVV¶dûöí1bDKî±ÉYZZÞºu«Z¡„„Ä”)S|}}ß¾}ÞvœmœmÊÊÞÿúëñQ£Væä.÷×Õ32òWŸ?¿ÚÖ¶;‡ÃY¸p×ë×9ô­jWß«5\TTš“óFIIž©£®®øæÍÛ‚‚Ú×LNÎ’–– ÛðâEݨ¨ø’’­¦¦¨©)âp8qqÛee¿ìò£¤¤dvvö}¤[¼xñºuëØŽ!ÔæÌ™æææÆURR‰Dl‡ÔÆœ;w®Zú”ðòòzöìÙÖ­[544ØNbâëË—ï¿{W!%%.)ˆ‰ñh¹ŠJÇ'O^Óíââ2.—clÜ™Ãᤥ兇_m`Sºº̦N ÊÌ,¨¬$¾ÌÌ,Ð×W³°0œ7o{IIYFF¾Ÿß>7·AÌðíÛÏ$$¤TT|ð÷? //cmm\µÈÎ.|øðÑ£G´NXX˜‹‹K]SÀÄÅÅ¥¥¥?¾®]899IJJ&%%ÅÆÆÆÄÄ,\¸–óx¼Æ|1„BíBAAAZZáÍUSSSSûÌèø椢¢Âçóýýý£¢¢>;O¯——W÷îÝ%$$V®\ùæÍ›èèhNNN{ö쀒’’cÇŽ¹»»×ÕG‚ùâ¿þú+½khhOž<¹uëVpp0ŸÏïÔ©S@@@XX!¤©¾/B¡6jþüùêêêG…V’A§Nzÿþýk×®ìÛ·ï³õµµµéÇÓÐÐHKKcÚ9pà@EEűcÇtttÌÍÍëjN—Ã|pÁ‚„ß~û¾LMM•——ïر#}©££SZZŠ+Ø „êêê222ÀMMM}ýú5»ÉÈȨ¨¨˜™™|HMMeÎlmmNŸ>½gÏžz: `ll¬¦¦F¯I]]ýÍ›7LÊLNN–––_ñBµ6lxýúõèÑ£fÐÔÔT¶CúD__ßÕÕÕÏÏÌÍÍÏœ9eeeÌ4¾Ô¶mÛ?|ø°jÕ*YYYkkkæ-+Vܽ{w„ ´ÄßßßÄĤڎ:tèºlÙ²çÏŸ¿{÷îÕ«W111tv}}} ‹yóæ•””dddøùù¹¹¹Ñ·jm !„Ð7"??ÿõë×oß¾®†††¦¦&Û!ýŸŸ_ttôõë×ïܹӽ{w{{ûT­ãáááêê* ÏŸ?ÿçŸV¤~Ò¤I #FŒ`®Á¦¤¤ØØØÔÜÑÈ‘#/\¸pïÞ½>}úðù|KKË:Ðuc8ÎñãÇ‹‹‹µµµÍÍÍÍÍÍׯ__k!„¾ ,ÐÔÔð˜{Šíî]»½½=S mMÛB¡¶eýúõÌUÉOTKK‹Õš†@ ‘‘9t軽j„BíUnnnII‰¢¢"ŸÏçuîܹå×m&­mÀÉû÷^¾Ìd;Š–öþý¶C@¡æ²hÑ"f}ÐO”íÚ§çÏÓutÜØŽ!„P“QRRÒÖÖ–••ÞË—/ÙŽ§ÓÑÑa; 6IJJ²B5½uëÖ­[·Žnó’’’83Ëjººº/^¼`; „BM,;;»¸¸X$ÉÊÊruuuuuuYŒÆÎÎnéÒ¥,À077¯¿Ž‰‰Égë „j¯/^Ü¥K:Ü‘§««‹÷A !?~\´h‘©©)Û± „j½D"Q—.]äää€ûüùógÏž±Ò'7n400••ÕÖÖ^»v-- êׯSçæÍ›òòò¥¥¥µV€M›6Ñ᮪ªªÌÕêÂÂB///MMM99933³çÏŸ€¡¡áÒ¥K­¬¬ cbbïÝ»GË}}}mllLMM­¬¬˜1 ÞÞÞ ÞÞÞ;w®Þ]„BíÒÚµkŸ={6jÔ(àÑ\Ò¥K¶£PWW?w–Ö½{÷ldd4bĈñãÇ/Z´èéÓ§tÝÐ}ûö=ZZZºÖÊ?ö÷÷Õ××ÏËËcž“rqqáñx·oßVVVŽ§ÓI@ddäÕ«Wk®§vêÔ©7n‚Ý»w6,11Q\\<444::zñâÅcÇŽmÉŸ!„P+‘••UTT¤¬¬,''ÇÕÓÓûìŠÖ-ÆÙÙ™Ž®177wuu½té()) 2„®zV^^~ôèÑI“&ÕU™Çã}øð!>>¾¤¤D(ÒÎ’’’Ξ=»{÷îN:q¹Ü=z¨¨¨Ð=zzzÖºé´iÓèb,S¦L)--¥K"„úÆùúúêëëÿñÇÀÕ××o=ôäÉ“ÖÖÖšššZZZaaa999´ÜÍÍmÿþý•••‘‘‘ŠŠŠt1–Z+ëéé…………„„(++ÛÚÚÒÌ—œœ,'''‰jîQUUµÖH˜ËápTTT˜•DB}ËTTT äåå€ûäÉ:W;ë222œ^½zõêÕ+B}kèСååå—/_Þ·oŸ««ký•¯^½š››kooO/Ukii1ù¸ªºž¢bÆ¢TTT¤¤¤0Kr¹Ü&ýÒ!„Ú’Õ«W'&&Ž9h}òä Û!s¹\ccc‡“––VuЈ˜˜Ø¸qã/^¼H3h]•/_¾üîÝ;)))‘H$&&ºººS§NÍÌ̬¬¬|øðafæg&ÛÛ¾}{BBBEE…¿¿¿¼¼<³©ŠŠJ+ù¹Bµ¼ŒŒŒÄÄÄ7oÞ×ÐÐÐÈȈ݀˜u­ýüü,--­¬¬fÎœéààPµŽ››Û… ú÷ïß¹sçz*—••ùúúŠD"¡P¸wï^º„„‡‡+))™™™)((L™2¥¤¤¤þ<==ÝÜÜ„Bá•+Wª.AêããsðàA|˜!„¾AK–,122¢‹Ió ÙZXX¨¨¨ÈD¶dÉ’Z«™˜˜0×ië©ljjzûöíš;wî¬VXíòõÝ»w™m###fEÒªlmmŸ>}Zû7A!ÔÞ©ªª)((ïñãÇ,†rùòåøøx c@!„hÕªU«V­¢ÛÜ„„“èĉW¬XÑ·o_¶@!„.--íÑ£G………ÀëÖ­‹ëƒ¶ÎQ"­äád„B­ŸŸßÿÖ¥”íB¡6@MMÍØؘN¹Ã‹g;„B¨m ÛÜøøxL¢!„PC¤¦¦>|ø°  ¸Ý»wïÑ£Û!!„BmÀ²eËzöì ¼=zà}P„B¨!444zöìÙ±cGà=xð€íxB¡¶aÅŠ+V¬ ÛÜ`E!„"%%åþýûùùùÀ511155e;$„B¨ ð÷÷755=uêðLLLð>(Bµu÷ïßgknœÖIVVVOO¯É›ÕÒÒêÕ«—P(Þ¿ÿþÛä;@!ÔÂú÷ï_ZZÊv­ˆÝ•+Wš¼ÙåË—/_¾œnóþù燃rB¨055år¹lGÁ²âââæ[D+999//¯sçÎB¡gffÆ⼸!„šÐÍ›7¥¤¤ØŽ‚e×®]³³³k¦ÆW®\ù¿yqim¦=!„BíIçÎÍÍÍé²Ö¼ªËJ#„B¨Ë–-[¶lÝþ”AÍÍÍY ©}úçŸ>|ÈvìÐÖÖ¶µµe; „jb/_¾ÌÉÉÑÑÑQTTäõîÝïƒ6“'N¬^½ší(Ø1fÌÌ ¡ö' à÷Aûôéƒ÷A›•™™^ÚlGÑr^¾Ì¼zõíy#„Ú=¾}û*))ïöíÛlÇÓÎ99YùúŽa;Š–sôèuÌ ¡öjéÒ¥K—.¥ÛÜÛ·ocE!„âÅ‹111999Àµ°°èׯÛ!!„BmÀ/¿üÒ¯_¿¨¨(àYXXà}P„B¨!ºtébii)‰€wëÖ-¶ãA!„Ú†Ÿþù矦ÛÜ¿ÿþ“(B!ÔÏŸ?¿yófvv6pû÷ïß¿¶CB!„Ú€Õ«W[YY9sxýû÷Çû !„PCèééYYY)++ïÆlǃBµ ¾¾¾¾¾¾t›{ãÆ L¢!„PC<}úôúõëYYYÀµ¶¶¶±±a;¤6fÿþýlGB¨¥­]»ÖÖÖö¯¿þ® fÐ/UQQ¡££³uëÖwïÞ± B¡–c```kk«¢¢Ük×®]½z•íÚ˜‰'Š‹‹Ïœ9³K—.˜GBèÛáããsõêÕÁƒÍ ×®]c;¤6FLLlÉ’%ššŠy!„¾‰‰‰W¯^ÍÌ̮݀ةí™8q¢ŽŽÝÆ<ŠB߈ÀÀÀœ={hµ³³c9¢6ˆé†2G =|}Ãll˜šÎ´²šŸ!!‘}ûÎaêDGÇ+(8••½€ÂÂ/¯PM͉rr#ÍÌf=ž›6ý¡¥åÊç;ªªŽ[·îh]Õ22òGþE$£®>~ÎœßhƒuÅEE¥^^¡D¢1ãÆ­ÍË+úš !Ôvݽ{WAAí(ØgddôÝwßuêÔ xW®\a;žÏˆ‰‰a;ŠZ|üøQ(æååU-¤ytÍš5¾¾¾?~l`S§Nݺqc£@Àß½ûÜ°aËwMœ8ÐÇg÷£G¯ºuÓ€°°ó..vRRâàâ²–Çëpûv°²² >>™Ï—zü8Åßÿ@ll¨¾¾Z^^ÑË—™µV'§]ÝNII{‹‹ËW,\¸sóæ™uÅ .Î?~„„Øýû[¥¥%½½·xxED,kÈ7zöìYhhhƒKhhh8::²B¨>„?òx<¶ùŸ… .\¸ðÓ‹K—.]¾|™´”‘#GÀÉ“'þ‘•+W²ùk}iiiX½z2!gëùÏÀ@=(È“nWVþ¥¬,¸xq-!gÇÿî?ÿEÈÙââ>_*66„³/^„@VVxÕž>Ý---qâ„_qq-©µZbâ.ÈË;F_ž;÷‹´´Deå_uÅ”´—Ãádg¡åyyÇ8NIÉÉú¿Î‘#?³û³7ÐÀ›ïï¼X·n]‹í}ƒè§´´´þjžžž²²²½zõzöì!$==ý§Ÿ~RRRRSS›={6ÓHJJŠƒƒƒ¬¬l·nÝBCCåååiù›7o<==ÕÕÕ•””\\\rssë¯/ £££éö­[·>ÛŽÁ’%Kú÷ﯯ¯?zôè>}ú0ñ_¿~]^^¾þ¯Iµ³³kð÷.^¼˜žžNá 8ÃáTVV²{8û¬¾}ûöíÛ—í(ª;|ø0]gµ))©éÓ§B‚ƒƒÒŽŠŠ€np8AZZ.Lúƒ³ó/k×N9v,ZGGÅÜ\’“³ää¤E¢ÿw-EOO-,l~HÈɉÍÍõW­šTQñ¡fµÔÔ\yy™ŽeéKN¥¥ï JhI͸\‡½{{3-ÈËˤ¥åéë«}öéééýðà ùî-ïõë×lG;\\\x<ÞíÛ·•••ãããù|>899éêê&%%;::.\¸póæÍ0zôè®]»ffffffþøãL#ãÇ—¸ÿ¾´´´···‡‡ý75zôèîÝ»GDDdee >ü³ÁÔÕDFF^½zU(¨ªª>zô¨[·næââ"YIðà IDAT%%Õ?NC¬_¿>,,,,,ÌÍÍíSe+”†ŸÏçóFŽúôéÓ;wîüõ×_ÒÒÒ::: ,˜7o¼|ù2***++K(@`` ¢¢âÛ·oSSScccÏŸ?/--­­­½hÑ"ooïz‚©«ðôô¤åÀÉÉiÏž=6l())9vì»7»víjoo¯ªª Ü‹/^¸pÅhÚ(Rãò²””Ôܹs“’’6mÚDÛ6ÜöígR**>øû——±¶6¦å?¬XqàîÝg&|GKtu;98˜M”™YPYI>|™™Y˜øúòåûïÞUHI‰‹D bb¼Z«éë«YXΛ·½¤¤,##ßÏoŸ›Û æü©f U€ììÂ'pH„Ú°ääd999š>©©©òòò;v¤/uttJKK RSS…B¡@ðéꔞžÓ‡ÃéÝ»wçÎ;wîÜ«W/yyù´´´ÔÔÔŽ;ÊÉÉÑjÚÚÚŸ ¦Övè»4EQS§N=pà@EEűcÇtttÌÍÍ¿ú—h¼ \¸pÁÁÁh½xñ"‹Ñ´Q‘‘‘ÿþû/ÝþšÜIyzusûU(}åʃ?ÿ\!.þé¶ù¤Iö )#Fôc.½@x¸¯’’¼™Ù,…QS¦l,))++{ïë& GïÝ{þر%µVãp8Çû—jkO27÷67×_¿~jý1>¼XYYÁÂbŽ¬ìHKËyÿÐè_ !Ä:--­¢¢¢j÷žÔÕÕß¼ySPP@_&''KKK 55µÂÂBfd ššš'...ù¿ ôõõÕÔÔòóó‹‹‹™v˜]ðùüòòrº››[;ôݪGmmmNŸ>½gÏww÷&ýI¾Ø£GΟ?Ÿžž¼Aƒµ‰û ­ Ó­zÍök42Òðõ­~A„B9€ïîþ}ÕB€¿sçÜj5oß®~É´ÖjjjÂ'üƒ¼¼Lp°Wp°×g¿B¨õÓÕÕupp˜:uê¶mÛD"Q||¼H$Ò××·°°˜7oÞæÍ›‹‹‹ýüüÜÜÜ8Ž¡¡¡©©é¦M›/^\^^ÎÜ´b RQQÉÎÎŽŽŽvrr244433óññÙ´iSNNÎúõë™ýš››Ÿ9sÆÞÞ¾¬¬ì³íÔ¹‡‡ÇŠ+ž ———®ù´`ÕúwïÞeÊuttª.£É¬¯YW;‰‰‰ÕJèYÖ/áÀþóŸÿüç?t›{îܹ6—D9Çëرãüùó‹‹‹ŸñÄ>ÞÑѱþ'³B5@°cÇŽÖpAnÓ¦M?üðíjsLWiiCèmgYYÙ-[¶8p@II‰0tÀP]}ooïž={JIIyyyÅÆÆÂÇBóùüN:„……BhýéÓ§ÓKÄǧõB}–¹¹yaaa“4E‡Ö´’¥¬{ôè1dÈuuuàÑ…¶Û–©S§úøøÈÊÊÒ·L¡³³óÚµkë0DoÿŸÏ/))ºÇBÑEEEZ.%%Eë#„úfÍ;wîÜOøgÎœisITFFFEE¥jú„: q¹Ü϶V×X¨&!„P[÷ðá訨ÔÔTà:tèСl‡Ô4耡»wïN˜0–¨¨¨e^VcÔ¥Kæq¡ºÆBÕU!„Ú™ˆˆ—yóæ­_¿^SS3;;ûôéÓl»ëK6“9sæÌ™3‡nsOŸ>Ýæ’h]ZÏ€!„jC*++½½½½½½×¬Ycdd$##£­­íííÝèôéíí]m8~]Ãîë*oµîß¿êԩׯ_÷ÇlÈ*n­_«0„BmH\\\ZZÚøñ㛪ÁÐÐÐjÃñëv_ÏpüÖ)$$dĈ—.]ÞðáÃÛGÊa¦mm®^}Àv-*.î%Û! „¾ ]/…ì÷믿ÒLf``Ps‚½F¨g ÒZË[sV255ÍÏÏ×ÔÔëóÜ·{çÏÿsþü?lGBu¢ßÓÒÒ”””`Á‚ ,ضm[PP­ &&VQQÁÔÿþ=-l`ûõ,AZÏpüÖ‰^î¦ÛŸ2èˆ#X ©}¢ËÈ°;ºwo‰é|BMÂØØXMMíСC&&&µVèܹó‹/˜—ÏŸ?‡Ï­¡]u8>3ìžµg†Ý×UÞ$_ª™üóÏ?)))½zõÒÔÔä9::âú ÍdРAƒ b; „úŒ:„††Ž7NRRÒÕÕUCC#333&&†éLœ8qÑ¢Eƒ êׯ_FFÆÂ… ,‰êi³êpüº– ­«¼Ù¿ðWؼyóÿÖutttttd;$„Bl9rä… îݻקO>ŸoiiÙ¡C‡ˆˆúîäÉ“W¬X1gÎEEÅèêê8p þ«ǯkØ}[Žoff6jÔ(---à1?B¡o™••UTTT­oq8œ™3gÎœ9³æ[uѯ6¿®a÷u•W]^´U©ú;pÿøãL¢!„PCÜ»wïĉ¯^½®“““““Û!!„BmÀ–-[~úé§+W®ÏÉÉ©•ß¶E!„Z ssóâââÎ;ïøñãlǃBµ 3f̘1cÝæ?~“(B!Ô±±±GMNNîèÑ£Ù ¡æGïXÔ¯¸¸xûöíM²ÇˆˆˆŒŒŒÏV{õêÕÙ³g›d¡óÛo¿3†>ÌuvvÆ ŠÚ±®]»zyyÙÙÙÕ•GóóóýüüÔÕÕ›j"1cccww÷¤¤¤Z+<~üxܸqÆÆÆuÍÿ‚jµúôé3fÌ:÷È‘#­sS„šD‡üüü®]»öÝwßUË£4wjkk¯ZµJSS³©J×ÓÓsvvÞ³g¡¡aµ<ÊäÎÇ{xx¨¨¨4ÉB-ÆÓÓ3<<ÜÖÖh=räÛ!!ԌƎk``4ÒÑÐ/^¼ÐÒÒZµjUQQ,[¶¬ê4ž_iéÒ¥<¯¢¢bÏž=ýõ>|˜æÎÊÊJ)))Ÿ¦ÚB¨Åܾ};<<üåË—À;v¬‹‹ Û!!ÔŒh7”yIWkJNN.))¡%ÆÆÆM;*ZOOoܸqtûÇ>€û÷ï3POŸ>; µEÛ·owqq¹víÐ :vìX¶CB¨y1ÝÐZ5m”¢ÝÐZßÂ(Bm—……Ÿqãttt€{øðáC‡±BÍ«Z7´ª&ï€RU»¡Õ`¡¶kÚ´i´±±î¡C‡>ÌvH5»ºº¡ÍÑ¥jí†b¡6-&&æàÁƒô AîøñãÇÏvH5»Z»¡ÍÔ¥jí†b¡6mÇŽ&L¸~ý:`Eß”šÝÐæë€RÕº¡ØE¨­ëׯ߄ tuu€{àÀýû÷³B-¡Z7´Y; Tµn(v@jë¦Nºÿ~kkk ô³K#ÔnTí†6w”bº¡ØE¨øûï¿ÿý÷/^wâĉ®®®l‡„P aº¡-Ð¥˜n(v@jvíÚ5iÒ¤èèh๺º6z}Ðyóæåææ~ÑGîÞ½ AAA _&.."""hÎoV;v nî½ &QZZzñâÅF|PFFFMMmÈ!§OŸnò¨jÕ¯_¿cÇŽ™˜˜œ:uªïÝ»w§Nš<*„P#ôïß¿²²²K—.À!„4º!mmmºÂK»¡®®þúõk¶£@ òêÕ+ºÈm»wüøñ–é.£6MFF¦´´´´´TJJŠíXXvíÚ5;;»zÖ“h*¼}ûöÀ¤I“ÝDpp°P(lºØQPPàííÍvè‹IKK4ˆí(šKlllzz:ÛQ ¶dÿþýâââlGÁ²'Ož4_ã7nÜxþü¹••í†‡Ã!B{¯^½jÜÇ[•ÔÔTPWWg;ÔPôú‡¶¶6Û4£Ÿ~ú Ž?Îv ¨ ––n¾´ÑÙÙÙ5Çï_UUuݺuõÔ¬ëdÎÐÐÐ×××ÆÆÆÔÔÔÊÊ*!!–7äD­Ö6k=;ôööNHHðööîܹs \B¨i…††V-yñâÅï¿ÿÎV<ÍçÚµk;vìxúô)p§NÊt›—ËŽŽîׯ_`` ®®®Á±cÇàÉ“'·nÝ æóù:u  ƒlêoÍÓÓ“Îá””töìÙÝ»wwêÔ‰ËåöèÑCEEååË—QQQ¿ýö›P(”’’ ŒŒŒ|ûömsG嚧S?ö÷÷¿páBIII\\ÜÀëª õžÌ:u*22òßÿ>^UUU(V=ñªV“žÌ>}šÏçóùü€€€‘#G†††ÒÓ¦M0eÊ”%K–DGGëèèDEEeeeÑ6ß¾}+##ÄTW›,ü:5§Í›7ççç×,ONN ›>}zˇÔ|ìììÄÅÅé`SîöíÛ·mÛÖ’»çóù .äñxqqqêêêoÞ¼)(( o%''KKKÓCŸÏ///§åÕæ¯gR¾––VQQQNNNÕw5559N\\\ò`úl÷j=ÒÓÓ QVV¶µµ¥Ë)ÔZ355µÖ“9ú’YS…Ãᨨ¨¤¥¥1'j;wîܹs¯^½è‰ZÃÛD¨}())Ù´iS]ïþòË/ïÞ½kÉxš›««ë¶mÛúõë4ƒnß¾½¹w™™™¹páÂû÷ï¿}û6//oÕªU„sss}}} ‹yóæ•””dddøùù1s$™››Ÿ9sÊÊʪݠfèêê:88L:533³²²òáÇ™™™U  ;;ûĉÍýëj=ggç«W¯æææÚÛÛ5ª®šõœÌ³.PEEEJJŠššZCNÔêj³®³ÃX¬¡&·uëVæϘ½«Î¥ðúõëxÔ¦%]¹reÛ¶mtê]®§§§——WsïRZZúÍ›7ÎÎÎJJJzzzçÏŸ?uê”®®.‡Ã9~üxqq±¶¶¶¹¹¹¹¹ùúõëéGïܹӽ{w{{ûÔÕrxx¸’’’™™™‚‚”)SJJJàðáÃÊÊʲ²²–––ô‚5jßj=JLL¼|ùò»w襤¤D"‘˜˜X]5ë9™€íÛ·'$$TTTøûûËËË[[[×s¢vøðá½{÷@]mÖuv¨¢¢Ò¬3b#ÔäJKK7lØgøðá111 ..;|øpú/hÍš5Ì)c;°ÿ~//¯[·nÍ žžžÍ½K999úðRiii~~~ttô÷ßOßRSS;qâDNNNZZZhh(39²ŽŽÎ7ââânÞ¼éëëË<啘˜èèèÈ´,vîÜ™––VTTt÷î]:Y¾¼¼|ppprrrqqñóçÏéÿ`ÔîÕ<*++óõõ‰DB¡pïÞ½ôùµZkÖs2žžžnnnB¡ðÊ•+þù']û¢®µ¨¨¨“'O@]mÖuvèããsðàA…±cÛödU¨ÌÍÍ›jð—6õ•ƒ™ÝmÛ¶-;;{È!wî܉ŒŒ411€ÊÊJssóÈÈÈþùgÔ¨Qééé-p¥³Å|÷Ýw3fÌ044^k˜J±ÝØ¿II‰»»;®.ô5nß¾ýã?~éééTÍÖX“žÌÕÚ²‘‘‘¯¯oµBz¢VsIöÔß&=;d^2-ÛÚÚÒGäÑ7bÑ¢E¦¦¦­­©†+++{ðàÁ­[·,,,h ½QYYI_š˜˜œ8q"..n×®]ååå’’’-as˜0a„ è6wëÖ­˜D›Êˆ#–.]ª§§·cÇŽö÷ w‹133›;wnïÞ½£¢¢ØŽ¡¯DŸ:¡nÞ¼)//O×c ¼wïÔ1¶øÈ‘#={ö¤Ÿš1c†¸¸8•F‡óWÅ4†††Ë—/0`€±±qïÞ½=zT­rÍÁÇu †®«œ’Ø·o“>á¿÷A«HìÞ½{pppûHŸpùòå-[¶$&&wæÌ™3gÎd;¤vBNNnÞ¼y)))Ó§O700صkW»œ’£¹ñx¼%K–ܽ{wØ°a}ûöý믿؎¡Æ?~ü½{÷˜« ûöí=ztµµ44´oß¾À eÖ£AMböìÙÌ<øÔ‹/ÜÜܺvíºÿþ?6¼)—µ©©¹·oþ6ŸÏ—zü8ÅßÿÀ… kJJNÆÅm8Ф®šàä ))–”´7664&&qáÂÿ=;sêÔ­ÈHÿÿÝ2y²Ã°aËÞ¿ÿãǯËÉysÿþÖW¯öKKKxxÔ2MW‹™4iRµ|nݺõý÷ß[YY]¼x‘¥ jŒ¡C‡–——_¾|yß¾}®®®ÕÞ­glñÀ/]ºD/Ûš˜˜¤¦¦9rÄÊÊJBâk¬z¶®Ëõ’®¿åvœA/^¼òøñcàÍž=›ÃáÌš5‹í¨¾ÀÝ»wííí«ÍbÜ$222ÔÕÕ9_þ{ù‚ªõžù³gÏ\]]ùåf$Oý’’2Ξ½›•.)@ÚP\\úáÃÇøødUÕŽB¡œP(WWÍ'ORoÝz|úôJ>_ŠÏ— p9rehèŒÿNS7D àÀ”)K–쎎×ÑQ‰Šº“•NÛ ôPTt~û¶\Fæ3÷ÿýüüèíÞj?Å×ohjj&''WÛÝÍ›7 deeÕã˜[‰°°0zìÛ1mÚ´®]»²E“7n\``àÕ«W·nÝZí]flqPPŠŠJvvvtt´““ØØØ$''ggg¯]»–ËåÚÚÚnÚ´©êå™F«:ø˜¸¼yóæââbfàr]åõ·L+TVV¶×B:D×522ú”AÙ©µøøñcµ‰ÙšÜ“'O˜%ôê—œœ%''M“"COO-,l~HÈɉÍÍõW­šdmm\kÍÔÔ\yy™ŽeéKN¥¥ï Jh‰ŠÊ§I‡£¢"HKËår9ôîý¿‡äåeÒÒòôõÕêóúõëÍý£ÕtãÆ :¢¹™}úÝ»wööö¡¡¡t¦ïÆéÔ©ÓÝ»wÉç@=ïVVVŽ3¦Ö}æææË–-+++3fÌgƒÑÒR.**ÍÉy£¤$_µÜÙÙÆÙÙ¦¬ìý¯¿5jeNÎÑZkª«+¾yó¶  „ö5““³¤¥%è6¼x‘A7**>¤¤d«©)jjŠ8N\ÜvYY©/úÑäåå«ý2M²qêÔ©Ó§O×Ü£˜˜˜««ë¤I“lll¾(Ô†Û½{·¹¹ùÇàÅ‹MrÖßhîîį̂†voûöí5G_´&&&5“ÊÝ»wéF]c‹àæ̶͛——W]—^˜¦€žíQ]ºt©5™U|\×`èºÊ«î®¦ZW…¶ÎÅÅÅÅÅ…nÊ sæÌa%wûömeeåøøxf…)]]ݤ¤¤ââbGGÇ… ÒÛ´£GîÚµkffffffÕ±öãÇ—¸ÿ¾´´´···‡‡GDDD£CêС³ðK£8q¢fúìӧϲeˆ Âáp˜™q4Òú IDATꧫÛÉÁÁlêÔ mÛf‹D ññÉ"‘BaaIzz^ÿþݤ¤ÄE"11^]5õõÕ,, çÍÛ¾yóŒââ2?¿}nnƒªLSwÆÑÑROOÕßÿ€¼¼Œµµ±¸86ä©¢"ÈÎ.ŒŽŽwr²úlœ666ººº_ø#}^AAA͵ÀÄÅÅ'Mšäëë«­­ýêÕ«&ß)åîî~ôèQ.—{ùòe(--íرcÍÛWM{öV~øöH¾çÎk—ôÛÑî´œ?>!!ÁÁÁáÓeæÑ©/E/G¼zõªŸ¥SugeeU-¤§Nyyyôå¹s礥¥+++9N~~>-ß³gíô$%%q8œììlZž——ÇápJJJOjj*¨««7â³U}üø±{÷îUn ‹3gÎT­sôèQpv¶!älýÿåç÷ð¬ª*”••23Ó{ölÏ?ÿléÓÇ@NNºcGY Ã76ÔU“³©©Gꯨ(§ª*œ5køÛ·‘´²úêÕ“{÷Ö—••ê×Ï(.n-/,<1{ö--Ÿ/¥«Ûé?ÿUx]º¨ÀóçÏ¿òG«•ŸŸ_ÕŸQ\\|úôéÉÉÉLz‹T[[»9öîîî>þ|ºa``@·ÍÌÌ>L·‡ æää”››[ZZêîîîèèØäaüôÓOpüøñ&o¹Õ:t(Tû'ƒÚÚzûö-Û4—É“'ØÛ7o^3'ìÚ}Ñ S©©©B¡yLOOi„ÓÊ–=~üx\\ݶ´´\¾|¹ƒƒC£[ø;wέVxûv-—zj­©¦&-//oÇŽ³fÍzþüù–-[Zaú\È¡:´û>è¹sç6lØ@ïÖsçÏŸ?þ|Vâø¢¦Ž;véÒ¥^½zÙÛÛWMN­j)P«W¯6ɳæÍ*1q—£cõ™©[¤¤¤§OŸ†††ª««³KZÛÙB­D»ïƒ9rdÁ‚t®DÞüùóÙúE+Liii]¸py¹lÙ2ºQÏSà-¯OŸ>l‡ÐT½4ÚšÕ5†¡oY»ïƒ}† Âfˆ­P(¤³Ê¡FÿšŸ8q",,LEE¥{÷î<__ߦ ‹E„¸¸¸óçϧ§§geeeee¥§§ eeeeeeuuu33³Š‰‰±)úVBÓÒÒ²³³srròóó•”””””ÔÔÔ Zù]¢Ó»wï¡C‡2k æää“>`ùòåìD†Pm†Ú©S§=zoõêÕlÇÓxû÷ï¿pá™3g>»l5dz´´>|¸‡‡‡¼¼|ý•j„ÂÂÂèÿºwï^=7Z$$$úôécmmmmmÝ¿ÿV2±3[˜nhMØE­““3w oõêÕ§ÍõDýàÁƒü‘vCÙY´q*++CBBª>³gkk»nݺ§OŸ~ö³eee‘‘‘óæÍc²¦´´ôâÅ‹é:vMµ>hCÐõAÛfZô³šu}кwïž———œœý)8Ž•••ŸŸßùóçë_§¶¨¨(**jñâÅÌ/)æÎÏTûvÖ½sçNÍ?­>}ú°W«³aÃ`¯mª.£Ûp={ölȧbccéúЄƒˆˆˆ/Ý‘––¤¤¤|é©ÿ·>è’%KÚÄýBÈéÓ§—/_þï¿ÿ€@ puu>}º‘‘Q[””>|øðáÃW®\yðàÁíÛ·ÿûï¿k׮ݺuëܹs™YšZ€ƒƒÃƒZlwÍ­u®Ò¬!çÎ ¼rå -133suuuqq©ºZ_=dee‡ B¯OfddhEEÅ¡C‡LLL蟸¸øœ9sÒÒÒš¤ñ{÷îÍš5‹¹«££Cÿ•~ }PR£ŠÐZ5¼j``°~ýzKKKIII++«ôôôU«VÑ{ !!!„àààª?òõë×åååKKKég/^lmmmbbÒ¿ÿG1m.Y²¤ÿþúúúÑÑÑééé?ýô}8nöìÙô³¤JôÍ›7žžžêêêJJJ...¹¹¹´BAA§§§†††¬¬l¯^½ž={Fÿòµ´´¦L™Rí»¤¤¤888ÈÊÊvëÖ-44´jtõêÕ½{÷æóù–––LœõûÊ>hU°råÊ€€€Æ}˜fÐqãÆåää|}(µº|ù²••ýÅãñBBBÊËË›v7oþ{wãö?ü}zZZZ]]¾¾þÔ©SÝÝÝcbbXXX ª««YYYi³666[¶l¡]«  P]]M¥R/_¾,%%ÕÚÚ Ï+**Ò:Âùóç¯[·®¾¾¾¸¸xîܹ۶mƒçi=¨‘‘‘©©ieeeSS“­­íŠ+`##£ââ⎎Ž?–””PÞÅ7ožMcccvv¶‚‚}*..þéÓ§––WWWZœŒ ²ŒŒôòòúðáîý;àyPx˜m÷îÝeee«§G/^¼X¸p!üÿ'''`úôéCXqqqZZZ}ïAŸ?n``ÀËËËÁÁ¡¤¤tâÄ Úï¯!¼d0ttt80|õ3]qq1üç‡aزeËž?>L UWW{{{ø¯Q^^þòåË}ù?ê`466ž={vØ¿NJ†¢hoúÕƒþùçŸðøêÕ«´[wòòò< R©–––»wï¦R©õõõœœœÉÉÉ´kÏœ9;;;………£££áù³gÏÂó™™™€ªª*øòñãÇìììÔÿzÐœœ Ãh?p«ªª0 khhÈÎÎtï/zëA3331 ƒÝ9•J½rå }zôèQxüýûw~~~'cC8Šsww§åÚì/OOÏÔÔTssóÖÖÖÓ§O‹‰‰íÞ½>Î5`T*õŸþY¿~½¦¦æ³gÏøùù9þÛò˜èèè<þ¼™ª"""ôôôTTT’’’ÊÊÊÈdrFFƧOŸyÉׯ_—,Y ’Ÿø¥Lž<™B¡ìܹ“=**J[[[QQ1""‚:tI!(ÊÞ½{‰DâÁƒËËËUUUïÞ½›––fkk;Ü«¸ÙÙÙ·mÛöåË—7n‰Äamkô€³¡Í€QQQxÀÁÁ!""÷|‡/ëëëöööׯ_ÿþý{XX˜´´4‰D¢]KÛ3Ã0‘¢¢¢.uòðððóó×ÒÒÒMMM555´( †asæÌ‘”””””TQQááá)**¢P(ÜÜÜ´Ÿ¤?UXX( ÀÇÇ_ÊÊÊÒ¿K»-„Çã§L™B‹sø{xxÀ©¼——×`êRPP¸yóæ§OŸ<<<"##}}}Ïœ9£§§·yóæåË—÷ki~YYÙ•+W.]º”›› àááÙµk×ï¿ÿÎÃÓ‘‘1˜ ûnåÊ•?-ÓÙÙ¹}ûöíÛ·>|žQRR dðÅÝÇKZZZ²²²4ýÓ½9}úôÅ‹‹‹‹7oÞìââ8sæÌÍ›7`™—/_.]º´¤¤„½Çò£¸¸ø™3gÜÜÜþüóÏ€€€´´4aaa +++ÚleÕ××ß¾};((Žk1 ƒK{,X0¤áÿÜ„ ,,,F¬¹'N466ŽXs=%‰¯_¿îquîHZ¸pá¸_Ì¥££ÃËËûàÁƒ+W®ØÚÚÒ¿GŠ€ïß¿çççÓ~ÆÑF2bbbß¾}«©©}…Bagg§õsqqq ÃRRRº<î|ø`kkËÊÊ k¶²² *--íí’ŽŽŽ7oÞ?~|áÂ…´ÿ0D"ñøñã´1;•JMOO((( Iœƒ—Ѿÿ~È/III‘LzôwqoÞ¼™››ÛÙÙ™œœ, jååå'NÌÊÊ‚eìíímmm”åZ[[ÿøãÚ/b@ðôôŒÿþý{_j P(ÁÁÁÛ¶m£ýò›8qâæÍ› †;øQ¢ïÂ_ÁP}1­~ÝÅ¥=é6cÆ Ú[ôO›øøøÌž=›•••v?–úßübZZZ[[Ûþýû%%%ió ´:;;;ÕÔÔ6lØçAÕÔÔ¶nÝÚ¥~CCÃÕ«WÃiβ²2Ú|„¾¾¾±±qII ý<¨¡¡!ýßüï¿ÿ†wJ©Têœ9sàÝÚææf---ú»¸RRRß¿÷ðð ÅÉØ ïↇ‡»»»Ãïs¼§§'†aCrÏdöìÙ—/_>uêTppðÅ‹SSS¯]»víÚ5ÀÌ™3…ÿÃÇÇWRR÷:ÈÈȨ®®†—ãñøåË—oÞ¼YOO¯·#£¼Mݯ_:Œ/qpp tttÔÕÕ Âó—.]211éKŸ¢=«C"‘¬¬¬bbbŒ…„„–.]tøðá–––[·nÝ¿ŸAù¾^¦`aaqsssss{ûöíµk×BBBÊËËáD¸•ŽŽÎäÉ“áZDø+¸¢¢¢¨¨(===**ª¶¶V…Ãá.\heeµjÕ*8ÿKqvvfgggvÌG{NiÜÛ°aÃV®\Iÿë°eËkkëÌÌLEEÅû÷ïwŸ¶À0ìöíÛ;vì’’baaY¹re÷L_!!!îîîjjjUUUÂÂÂÆÆÆp7ŸÐÐÐ}ûö©ªªÖ××ËÉÉ…††œííí}}} BCC£¢¢¬­­aaavvv·nÝbgg××קŸÿ²³³³²²ÊÊÊš1cFq¹{÷î‘Éd)))%%%àååååå5°®˜±´´4??¿åË—Óž7ï‘ŒŒÌ¦M›nÞ¼I[ßÕݨƒ~øðôs Êø’êêê‚‚‚‚‚‚èèh11±‚ÿÐÖý´@èÇ ááášššS¦Lçåå]³f íü”)S:::BCCeddh×öV~ éèèÞ¾}ûìÙ³û8ƒÎÉÉillìïï___Ïìð™ŽA‡oiýXSÄŒõ1hµ··„'OžÐŸØN4JJJwîÜthÃeðkqÿøã¸?àeD?¥     °cÇ*•š‘‘QTT÷|¯©©…ãQ))©1·JbæÌ™D"ñúõë]¦Ù¨TjoßÔŒ/áãビµµµ&LërùO 0VRRbnnþäÉ Ãœœœ à[Ë–-Û´iSlllPP••ÕOË!8nݺuëÖ­´´´ÄÄļ{÷®¤¤Ž;KKK¹¹¹…þ3yòä%K–(((Œ‰ÝEd]¾|™OOOo¨*¬­­ÍËË“‘‘ª G¸3<Æ»»»c6ÈõDŒa{Óákb$áp¸€€€µk×rppX[[‰ÄÏŸ?ØÚÚÎ;×ÓÓ3"":ûxÉ ãé±Ezõõõ8NQQ𢢢ÐÐP øÖĉ-,,|||âââÎ;÷Óòc++ë²eËèŸ5DÀÇÇÇÁÁñ÷ßÕoÇ„„CCÃuëÖýزg< ÷îÝÊ•+•••ñ‡îtü111yúôéáÇýüü¾ÿ.##³nݺ™3gòóóµµµûuÉ õÖ"øoÕœœœœ›››ºº:@Ô×ק_oimm­¬¬¼`Á¸?ÆOË#2nÐ?|B>ë9óçϧ­'¯îß¿O&“eddþ׃2;¤±GKKëÑ£GÝÏ'&&ö¶¡·Khá>;ý*Ð[‹µµµ´5G8pà@u*))Q»=‡Ã <‚ ȯlåÊ•S§NUQQà<ÈìxƸ艹-¶µµ½xñ"55•>ï‚ 2xFFFFFFðøGnoooæÆ„ ¡ 6<þÜËËkÞ¼yÌŽAd\¹sçÎÛ·oW­Z¥¢¢‚;räÈ‘#G˜2”BBBŠŠŠÐmXAhnݺEÿTw||¼¡¡!''§²²òÉ“'›››ûXÕ›7oxyyZ,::zÁ‚œœœššš>`è£LTTÔÑ£Gá3©¨Eç:::œi;ç `gïþºs玑‘‘¡¡áçÏŸsrrÌÍÍMMMƒƒƒY-•Jmoo’lÕªUGUUUýÐè7ªvT@ñ í¨¿îÞ½;kÖ,xÜÑÑA$aJz0­Jo)?{ËÐÙcÐööv"‘èääD_¿§§§   LO) Ï'$$0®úÿó’š™™õ–Ö´†0?(ÎÕÕÕÕÕ•yÝ9‚ ‚‚‚z{¶dð"##iYSSS‹ŠŠÖ¯_ߥ |(ÃÔÔ”••5'''99911ÑÉÉ ¾kffF$KKKïÝ»wþüyÚU–––>|ÈËËcgg·³³£5÷3¡Y·n]eeåÛ·oÄÙcm´™••uñâÅOŸ>¥¥¥Áód2yíÚµlllûË @XX˜³³óÿ>È€óƒŽ4E€Æ SÆ 111ììì{öìaŠƒ:Ð1è¬Y³._¾ £££=æ¥ï-ågo:{Ë ›èò©©© pïÞ=j/cÐÞj£þÿ¼¤ÔÞÓšöÑPæ=~üø±cÇF¬÷Fé#yyùˆˆˆ\H¿ÔeÀ•Œ°E‹©ªªž:uJZZzïÞ½eeeCXyMM <†‰÷˜G³·”Ÿ½eèì-(l¢¸¸˜¾rø’–v´»ÞjƒïÒò’†iMG€™™™l¿oß¾‘lA鑧§§®®nSSÓ©S§ÎŸ?¿uëV''§!I9ÇÃÃSj†Ût÷–ò³· ½e…S­×¯_÷ññ¡¼~ýº¨¨¨²²2€““³¥¥ž¯¬¬d\D¿óƒ´¦#ÀÐÐÐÐÐãöíÛçìì< 2vÕÖÖ:88ˆ‹‹sss«ªª~ýúPPP°dÉnnnEEųgÏÒOž<©¡¡ÁÆƦ¥¥URRrøða@ huž>}zÚ´i\\\RRRÝïŠUWWkiiÙØØ´··×ÕÕ988L™2…@ XXXTUUÁ2ô$&&Ò_ž‘‘1wî\... ‘ßó¤ï-Z¤¥¥›ššNž<)--íääT^^>ÈšgÍš•••á6ÝgÏžõððÈÍÍmkkKMMݼysrr²œœœššÚ®]»JJJÜÜܬ­­1 “——WVVöõõ´´´øûûêdddôõõíííaŸZ^^~çÎÀ„ üüüüýý}||JJJÊËËýýý;æçç‡Çã$ >ÜÒÜÜüÓÚzdggçååõæÍ›.³­#àÖ­[NNNoÞ¼ùñ̓"Bíó<¨‘‘Qqq1}zäyóæÙÙÙ566æää(**Òç@ž>}zZZZ]]¾¾þÔ©SÝÝÝcbbXXXhÙË{LêslåææÊËË»¹¹Á’FFF¦¦¦•••MMM¶¶¶+V¬€ççÍ›gccÓØؘ­  @€¸¸ø§OŸZZZ\]]¥¤¤~š„™‰kqá bNNNeeeÔ΃޸qcÞ¼yôgž?¾dÉvvö™3g?~.g-,,\¹r¥   ¨¨èöíÛay …¢§§§¬¬¬¡¡áååEûóÖÖÖîرCBB‚““SFF†~‰ïÓ§Oµµµa®YVVÖèèhÚ[ÙÙÙŠŠŠêêêGŽùimݳ­•••Mœ8qõêÕýú;@C8Š8qð={öŒHç=@0» mý‚ CNXX¸¼¼¼¢¢‚¶£rw999222eeeôw³²²jjj`2ààà`GGG¸Ã¸¼¼üŽ;¶nÝ  Ú³gOyy9‡LŸ>ýäÉ“ÝsæìÞ½»½½Ýßß_^^ÞÜÜœL&»»»ÛÛÛrssaëBBB€êêjAAÁúúúÂÂÂéÓ§WUUÁÛd2y×®]´¬­­]\\ííí·nÝ¢-Lí‘———§§§ººúüùói'»ì>„/»œ î1Ÿ ÇÖ­[999=<<öìÙsòäI¡‹ÖÖVIIɸ¸¸iÓ¦õýª¡RXX¨¡¡affÖ¯˜ëèè½~ýúâÅ‹û{­¤¤d^^^~~þ”)SÐôãÇÓÒÒ–,Y2cÆ üÞ½{P‚ ¿& …ÂÍÍÝer®°°ŸŸvŸ)))úwik@888DDD`÷ _Ò&ç"""N:•——‡aX]]<ÿ×_IJJÒ’×Ò›Ð*‡‹Mz[êÒ%<?eÊ”Ñt÷êÕ«W¯^õ¥äÈhll|øÚµkCØO‰‰‰EGG߸q£  ``VwCžÖ´ï–,Y²dÉxŒß³g†aCøÓAqLBB¢®®®¢¢Ž!"‘X]]]__×€0N1Ôƒ¤î~~~ÁÁÁË—/ˆˆ`ccëm±IgggK] ¼¼$†<­i¿„††¾~ýzíÚµ?~É¡yPA¨}žÕ××766.))¡Ÿ3gŽƒƒCKKKAAÁ¬Y³è§!i3Xaaa3fÌ Õ£ªªB¥R³²²&MšÛ-,,ƒó[ðÚ¶¶¶•+WêèèÔ××S©TCCÃÕ«WÃFËÊÊnß¾ k›3gÎÑ£G©Tjss³––}RRRß¿÷ðð””Íó QQQÝ¿²yxxÜÝÝá㘛Eè åó §OŸ>}úôˆõÞ‚Œu¡¡¡BBBªªª¼¼¼7nlhh„……}ùò…@ Òo%Ó´¤îšššÛ¶mÓ×קwâĉ7oÞ$‰úúúß¾} VSSãââRWW§Ýh ‹‰‰QQQÑÓÓërsÏÎÎÎÊÊJ@@àÉ“'÷ïßgaaÜ`yyyÑ¿„}gnn®——í5Â\k×®õõõ;w.h_\Aþ3T{%''Ó†€c³Æ ôP^^^ššš.eÐtð†p_\ü®]»ðAA„Yà”——wçοÿþ{_2ˆ!#ïï¿ÿNJJ²´´œ;w.îÌ™3~~~Ì Aä—õùógOOÏÜÜ\OOÏ¡ê>û’ËSII)44ô§UÌþˆ?~œ5kߊ+"""äååáy‰ôÓ —,YrÿþýáŽ0::ÚßßÞÅ£îåž1ƒ IDATA¡E"‘೘HßÁíg988˜“’H$˜¬4;;{ÿþý}¿ÖÝÝÝÖÖÖÈÈhX×èZXX(++Ï›7€Û±cÇŽ;†¯1Aä§Ö­[7TÝgoö¸u¢££czzº£££¤¤$Üc–Á‹=îØ[y___¸»¨¨èñãǽíÈHckkK&“ïܹ7—Ÿ?þ‘#GºÀÞêÑÐÐèìì|ôèÑ ÿ€Œééé9::NŸ>ÀtçÎÃÚ‚ 2bzËå)&&öøñ㺺º°°°“'OFFF(J```oÅ  .VVVêèèµµµõV>##ÃÓÓóéÓ§ )))p(é?¡ÀÀÀÕ«WÛÛÛS( …ò×_õøÔ³xñbú€‡Ã7“’’¸€€úýA±+++ëõëקNbgg‡‰Òho™››KJJbF"‘¬¬¬bbbz¬A1‡™3gNš4é?þøöí[|||oåñx|{{{jjjCCƒ€€‰DÊÍÍŠŠ:þ¼€€›Odddccc? ãzfÎœÉ8‰÷àÅÄÄœ={6##€`ʶ‚ Èc°Áao['vÁ Xû#öX^VV–L&ûûû¯_¿žD"y{{···÷¸#£œœ\¿>`o;;ÂzxxxºßZëÖ­#‘HjjjüöíÛ‡µ1AdÄô–Ë“ÁÖ‰´Š=íÈ ¼¹¹¹¹¹yssóÉ“'W®\™˜˜È ýgß1N#Z__OË%>L-Z´hÑ"xŒÛ¶mêDAƇÞryÖ××ãp8EEE ÊŠŠèŸ ¡eeP páÂ…ÌÌÌöövooo...--­ÞÊgffÆÆƶ¶¶²±±„‰'ö+ý'ŒëÉÈȘ={öªí»ààà­[·Â%Z¸sçÎ;wnXÛCAFL2Ø:ÑÙÙùƼ¼¼kÖ¬a¼Ãb÷ý{+ßÜÜìêêJ ®^½èmGÆþbPOlll÷|yCëÙ³gçÏŸÏÌÌ€sçÎ?~ð› +´«‚Œ€¡ÚÕo¬câÎò?…võcàÇD"±­­q±AîêGëA©T*ÞÁÁaX»kAÞÞÞGŽ™8qâ°¶²`Á‚ Àã=(ý3C‚ 2æøùùMžTVV2;Š~ P(ðYï_m ¡aè/…J¥¦§§ÇÇÇGGGçææVTTuvvv/) $$D$ÕÔÔ´´´´´´ØÙÙG2TØ(<ÆÛÚÚbvùòå‘ŒAF ‰DÂãñÌŽâ'Þ¿ßÚÚÊì(˜Œ6…Ð0ôWðêÕ«W¯^½xñ"..îÛ·o]Þåâââææ.))©¨¨(//¯ªªªªªÊÌÌ„iÔ&L˜ ¤¤¤¥¥¥««khh8a„áŽùÊ•+/^¼°µµÕÐÐÀ_¹rõ È8öøñc~~~fGñRRR …ÙQ0S—(„†¡ãU~~þõë׃ƒƒì. @DDDWWWKKköìÙD"‘H$öøŸ¾²²²¢¢"///...>>>99ùíÛ·oß¾=sæ ;;»‰‰‰•••®®îðu¥/^¼ “ÉÚÚÚÿëA‡©%A¾è2…Ð0tœihh¸sçεk×âââàZVVÖÕ«W/^¼XSS³S‚‚‚‚‚‚Ó§O‡‰HÛÚÚ^½zŸ˜˜øÏ?ÿܸqãÆD"ÑÒÒÒÊÊjÆŒCþ)lmmµµµ555ø±õ"‚ ãOP CLJÂÂBww÷àà`¸¸}ÅŠVVVzzzƒ,²°°Ð6ªÍËË»~ýúµk×>þìããããã³lÙ2333KKË!œÊÑÐЀˈ8Ô‰"ÂD=@!8 É`¡õâÅ‹åË—‹‹‹“É䎎ÀÀÀ’’’7n,Y²dhïµJHH8p +++!!ÁÁÁŸŸ?**ÊÚÚZZZÚ××·¡¡aHZ Ü°aË/¸«W¯ I½‚ ýE?ÅãñbbbúýÁ:ÔãšLd4£R©÷îÝÓÔÔÔÒÒºÿ>++ëŽ;²³³ãââ6nÜÈÍÍ=¬­«©©;w®²²2,,LVV¶  `÷îÝnnnåå僬üåË—×®]ûúõ+tõêÕ!A¤ÿàtâĉ7nÌÊÊš5kàòåË·o߆Çh:¶´µµ]½zU^^ÞØØøåË—‚‚‚žžžùùù~~~RRR# †a«V­ÊÊÊŠŠŠÒÖÖ®®®öööžþ,!!áïïO¡P<<<™†aK—.ý÷ßV¬Xä“cêêêëׯ—‘‘°Ý°aÃÐDŠ Ò™™™999ô}'=gjjúáÃ//¯>Œ|x£Ðüùó ìíí%%%}||º?F9òÊËË<(!!±gÏ8ƒ÷l988˜Ýjjjáááiii7ndaap=—.]Z¿~=œzÀ]‚ }µmÛ68ñÉ¢L)ÐüùóËÊÊBCCUTTJJJœ%$$\\\JJJ˜OvvöÖ­[%%%>\SS£££óÐÒÒÍ @^^>00°¦¦F@@``5$$$\¿~=;; Adl™0aÂêÕ«ß¾}ûäÉ]]Ýoß¾?~|Ê”)/_¾™:;;Ÿà½7mÚtãÆ mmm~4ä3BAúkñâÅ‹/~óæÏÝ»w/\¸páÂ…©S§®_¿~ýúõôl'--íÚµk7nÜ(**Lš4iݺu{÷î•——‡¨Têp´;z¨©©©©©Ácœ¥¥%êDAÆ(‰tëÖ­¬¬,WWWðõëWøäemmí´R^^îïïO"‘}||ŠŠŠ¦L™âíí““sùòeZ÷ù+¸xñ¢……ÅóçÏø¿ÿþðëׯ3;*Ad€dddŽ9âííýìÙ³k׮ݽ{÷ùóçÏŸ?ß¼yó¬Y³`:MMM‘¾×™——÷âÅ‹øøøøøøŒŒ 8¸äçç_½zµ••mÖ£Q~w0’’’BBBôõõµµµô Ì A†’’’‹‹Ëš5k†©þ?®_¿¾  @GGÇÚÚÚÅÅîšM"‘öîÝ;|í" ‡ÓÕÕÕÕÕ=þüíÛ·ƒ‚‚ž={öþýû÷ïßûûûdee555…………èðóóÃíÚaòø¿wîÜ¡ßćÃØÚÚþöÛoŒ²Žû»¸[¶lÑ×ן7o¿víZfÇ3ž=zôhñâÅ£sMÚ•ŸŸßÒÒ"''Çì@º $‘HŸ>}dggïß¿ŸÙ!¿.vvvø¬KKËëׯá82!!áË—/_¾|éc%püª¢¢2qâÄay¬˜;wîܹsáñ4$$„©!gÒÒÒû÷ï·±±ÌHÍ”)SæÍ›ÇËËëááAÛßù§ÓÓÓ]\\tuuOŸ>}ñâÅââbAAÁÍ›7»¸¸À’yyyöööIII’’’[¶lquu…3I¾¾¾gÎœ©ªªâææÞ¹s§³³3}ý¶¶¶·nÝÂáp±±±€¦¦&~~þ.{•ÔÕÕ9;;?xð µµUOO/ `Àëé¤XYYµµµáÂQ*•úþýûOŸ>•––Ò8kjjéG¥"""ªªªÃ‘Ød¸pá³g϶nݪ££ƒ Å0 õ ÃÄÀÀ@TTtË–-GŽAýèÀ0ÌÓÓsÙ²eOŸ>ÕÓÓóðð€ÏŸ1OWLLìñãÇoß¾500˜>}º±±1`ÕªU***‘‘‘åååp@FF†§§grr²œœ\UUUnnn—ú1 ãåå=yò$ ""‚Ö%ÓXZZNš4éÇìì쎎Žvvváááƒük Hßa¦¢¢22OÖŽãÉÁׯ_ߺuËÐÐPGGwóæÍÐÐPf‡4žyxxòóó·lÙ"++{ñâÅ!ß‹KIikhè¿C[çh¶téR8  sÓÃuqýbnn.))‰a‰D²²²‚ùî333ß½{wòäI666 ‰½{÷ÂÂx<¾½½=55µ¡¡A@@€D"õ·¹ÜÜܨ¨¨óçÏ °±±ùøøDFF666ö·åÆý<¨ƒƒÃ­[·`>5œ¹¹¹¹¹9³CÏ h‹Ö†µý¥xzzÒŽcccutt-Zôï¿ýø¡¥¥%...!!A&“+**EEEüüü\\\° -寬¬,™Lö÷÷ÖÑÑé-™% ð9sæHJJJJJª¨¨ðððÀ'êCæÌ™cff&)) `ŠRÀ78 ¥L?Z[Ûàà .¾ž›ÛDUuûׯŎŽçÒÓóÿ””´²µõœ>}wÚ4[..)© ǎݤ]›—W®¯¿Ÿ‡gåìÙçÏ?àå5…ç}}ïJHXqr®µ8~üÖ ?îH ÿ]={ö &Ú}öìY—Ðgi.))177?tèP^^^^^žüáL$«««ëëëa±üü|Ú%æææqqq•••zzz+W®ìoÀââ↥¤¤PþSSS3 ×C!ÈÇwqÏ;gffÀ‡……avóæÍŸ]Å|uuuc"ÎÉÊÊvYûQ8?Ú÷źk×Ãã'$%ù ó¥¦R89Ù¶Æǧº¸¬^³F–|üøˆ„áíÛ/§O76žXµÊ[Eejd¤gyyíŠ?rgdä{z^ON“#VUÕåæö)ïÏ?ÿü“ššJ¥RaÇCûß‘|9kÖ¬ÄÄÄ.ýûï¿‹-ÒÖÖîò« ""’••ëëëq8œ¢¢"†aEEE¡¡¡pQÒ´iÓ”””œ}}}+++á¤& 33³¸¸XCCƒ@ `Q¢ŒŒŒ¾¾¾½½ý™3gDDDÊËËãããMMMû[‚Œrãþ.î›7onß¾½lÙ2@ëA™RŸŽ¿‡ê`?ÊÉÉÙ—Â99%½)+ %x³fõ¼k—¹¹6< ‘䬬ôbb>ÏÏÌ,x÷îKlìq66 ÂÞ½¦Û¶ý Àã'´·w¤¦RDEù¸ú”ùvß¾}}úxLòüùs]]]<OÒÙÙÙÞÞÞ×××ÀÀ 44ÔÍÍM]]@  êëëÃ)I ÃîܹcggG ÄÅÅmllŽ?hnnvuuÍÌÌÄãñrrrKWâî¦VUU%,,lllLëAᨗ6öEdÔÚ¶m›‘‘‘ªª*¿jÕ*fÇósÜÜÜc½ïLJJê¾€200 ‘HÞÞÞ?­„B)ãæf‡Ý'¯Nº“—WŽaX]]“* ¨¨ŠŸŸ‹‹‹ –‘†²²D2y¿Äúõ>$’œ·÷--ÅŸFbhhÈÇÇÀ0 þ£ý,))ùûï¿{ OIIÉÃÃÃÞÞ¾²²’vRGGçóçÏ´—8pà@÷k%%%£££áqpp°¸¸8@YY9))‰ñßäòåË´ã+VÐÖñ¾yóðððøùùùùùu¿&¨255=© ˜¦¼@ƺ±20UUUØ}𦦦†Ý¾}›¹11F$Çôó6_¿~>}z÷ójjjW¯^íK=ÂuuMß„„xèÏãpÿûÇZRRmn~äÉ“#::31 srº\PP ª«ëëë›a'šŸ_N»ÄÜ\ÛÜ\»¹¹íäÉÛ+WþQQñó©PEÅŸw´ÃÊÀÀ ûÉÙ³g»»»›˜˜`foo?€j“““¥¤¤²³³=jkk;èHûŠ¾ƒGdt:{ölll¬££ãÂ… ñwïÞÇ?F‰Ã‡···ÓŸ¡õýªGFf²¾¾ª½ý™ v¼©©WD„OD„?+«–©¯oÆá0EEI ÊŠªBCã44f¦MSR’qvôõÝ\YYwòäßL™™ÅÅU3ØØXÞ‰ñ½6?š$&&>~ü˜þÌÌ™3=<>ÎK—~/*ºQWþæMÀÔ©¢™Ÿ?ÖÖÞ u8°öóçÀ/NEDxî‚'’’ÂÑÑǾ}»›’rAHˆG\œPV–IJòûöínUUXBÂ8`å’’’=z˜1cÆÍ›7?~ühff6$Ý'‚0Å~õõ·*ÆßunnÌ”••W¬XWHàFòw[[[PPÐìÙ³é×\Œ9zzz***IIIeeed29##î'Þ€Iß9xÉÉŸáÃ*ÙÙ%GÞ¤=ý2æüñÇ !!!Ÿ>}277G}'2ÖíÛ·¶8eôT50ãþ.n@@€±±1Ü92 GFFâp¸ .DFFÂ-`ú¨®®ÎÁÁaÊ”)Á¢ªª PXX(((x÷î]•J]¶lÙ† µµµâââÜÜܪªª_¿~í­€¼¼¼«««¶¶¶²²²¦¦fzz: Û…\RR²ËB’ÎÎÎíÛ·oß¾ýðáÃrrrJJJ´­ú»xùòåëׯ™ÞwB……•::N¼¼¦‹9Ï߱ØÙ DMMͺuëRRRÖ¬YƒúNd 9sæÌüùói/_¾|ÉÃÃÓÔÔðññyûö-èå›êæÍ›³gφWmݺ•……>|E&“ÕÕÕ»´B« //ïáá±páBEEÅ9s椥¥u)Üý»®¤¤ÄÌÌŒ@ ˆ‰‰íܹ“vw­·ó¿ ÷ïßß»wn·‚‹ŒŒŒˆˆ™†ÿúë¯Õ«W«©©IIIõýBKKËŠŠŠ>äåå±³³ÛÙÙÄÄÄ®^½jooŸ——wâĉìììsçÎÖ®][XX˜””T[[K&“ᣖ=ÖÝ»w/22òýû÷666FFFmmm  %00>’ÔÔÔ¢¢¢õë×w‰°·[6lPVVîû'V&&êùùÁµµwòò®=j3V uÁÇÇ·víZÔw"cŽ¥¥åÛ·oi+®ƒ‚‚ÌÌÌØÙÙ»”éþMµhÑ¢ÔÔTøhVLLŒ„„ÜW2&&FWW—q£> OMM]±b…££c—w»×™šš²²²æää$'''&&:99Á’½ïÍ8¾‹»cÇŽ{÷îÁ¿<.(999111‡XZZ^¾|™¶m7cpKî²²2˜ ÊÇÇGPP°±±‘ƒƒÃÈÈÈÚÚzéÒ¥ñññ999=*++#€Y³f1®°iÓ&øhãÆ8Ïà%:‰ÄÁÿAù¥ -]º4((èðáÃ---·nݺÿ>}Þ¾©„„„cccÕÕÕwîÜc``ÛÛ#Ñ4›7oæåå,_¾üرcŒ gee%$$¼ËA¡P¸¹¹a÷ÙÇDDDà†a"""Œ7û  ÁkkëàààÎÎÎÈÈHAAA---úw|SéêêÆÆÆFGGëêêêêêFGGgddÔÖÖÒßîüÊ°±±5440.\XXÈÃÃÃÏÏ_JKK755ÕÔÔôv~qÀÏÏï·ß~ƒÙœð÷ïßáv{{;™L®ªª¢ýçÄ0ìÒ¥K0ï+c´-¹i3h:::6lØ°fÍš‡FEE-[¶LBB¢®®®¢¢BHH¨/5º=P¾ÿžŸŸÇ—½Ý$œ9s&‘H¼~ý:í7D¥RÇñ] A†Ä²eË6mÚÔ%;`øM¥««ûûï¿766.^¼XII©°°ðæÍ›ššš“&MdHôßubbbß¾}«©©·å( ;;;_oçÙôõñãÇÀ-9q÷ïßïr'a8}š””¤¬¬ÌÇÇgaa!##3sæÌ!ûc!2~Y[[?}úTCC&˜ì¢·o*..®¹s犈ˆÀ›dºººuuu‹-|<ôßup‡×úúz)))‰D"‘Nœ8èí|Æý<è¬Y³–.]*&&À–.]Ša؃˜sÈËË;vl$÷”èÑÕ«Wmllllô¯\ÙÍÜH~jÖ¬-))”””¦ï‹ûSBBB•••UUU´ù›QKJJ & E{!cÝòåËá­M###fÇ2,|}}Ÿ>}º{÷n===üÇÇñpA>---¬¬¬ÝÏwïVÚÚÚྱ.%%åŸþ177 A†XSS…B),,ÌÎÎæææ†ÓâââÈË £Ü±cÇðxüŽ;¸¹¤î~÷ãÇÞÞÞ£ÿÆU_ìÞ½ÛÜÜÎÜá ™3eff2;dœ P(ááá/_¾ìèèèò.''§¡¡áŠ+–-[ÆÃÃÓc 2æØÛÛO:Õ××w÷îÝŽŽŽ´~úøñãünjj:>ºO€¢¢"í³à —.]ÊÜ€dLû÷ß.\(%%µk×®çÏŸãñøéÓ§/^¼xóæÍk×®ÕÒÒmhh ³´´Þ´iS^^³£F!@$ííí«««<(%%EK¤‘››»råJeee˜þËÝÝÙ‘™Ó§O/Y²äéÓ§ü£GÐ]\˜ØØØýû÷'%%¸¸¸–-[fbb²téR¸—$½âââ»w‡ÿûï¿—.]"“ÉëÖ­;x𠌌 3G!ãìì|éÒ¥––ØÂLéw455OO+¤¦¦>yòdíÚµÜãÇa¢(Aú.//oùò庺ºIIIÞÞÞ!!!æææÝ»O€¨¨èöíÛcbb233mll0 »zõª‚‚ÂþýûáÞâ2F‰DúÆ;;;éßÅápãi سgÏ“'Oôõõ8}}}x„ H_|ÿþýøñã3fÌ€O»ºº8p ³›S§N½råJQQ‘Ý÷ïß=×ìxì IDATJ$Ù ÒñÁÅÅ¥·Ý‘ÆÓ (4cƌŋ‹ŠŠ؃.Y²„Ù!!Èp©®®ÂÚ²³³UTT\\\-,,òòòŽ9Òãj~Æ„„„.]º”””¤¢¢R[[ûíÛ·! AFX—a(Íø€Nž<¹xñâ'OžpOŸ>…3¢2ÎÀ‡ÏæÌ™sþüù.w– ªªÊÖÖVVV655UNN.::úÆ´´3gΜׯ_ûùùuYÁˆ cNÃÐU«V³( ===::º¸¸ Ç^½zõÛo¿ÕÖÖnݺUEEåãÇ®êï¿ÿ–••½rå ‹——קOŸ†dKRÀ„ vìØ‘‘‘aff6$"SÀ½ZéÏŒË(ÀÉÉ)&&Þ»Åééé Õw‚Œ*÷îÝ ÿøñ£²²²©©éû÷ïû^CGGGHHˆ¢¢¢¥¥eMMÍâÅ‹SRRÜÝÝŸ£ QQÑ[·n‰‹‹mµ2’\]]éÿ¯aff6cÆ &Æ3L¦OŸ¾hѢɓ'𺺺†EGG3;*dfœ?Åì(~¢ªªžÙ!ôÏŠ+ ]\\Ξ={÷îÝ»wï­]»vÍš5½å°´´´Éd//¯²²2''§§§çž={†5Tô\2¦Áaè¹sç8ÎÍÍÙ ŸG9;;ÿXB„aa*2™Ììý“’’Âì¿Y¿•––:99Ñ5acc³°°¸|ùrLLLVVVuuõ‡tuu500ÀÇÅÅ¡õ ‚ ã’……ÅæÍ›™ÅHX¼xq[[Û4”••õüùs8Šÿ÷ßG IAdäM™2E[[›ÙQŒ„ º¸¸ØØØÈÉÉð¿ÈAAONNvŸœ¶¶¶ŽŽsBA1áèÑ£ZZZÿüóæAA¤/¾|ùòâÅ ¸× þÅ‹ÌŽAAƆýû÷ÛÙÙM:€×ÐÐ`v<‚ 26L:vŸœ†††¦¦&sBA1áðáÃêêê>à_½z…æAA¤/²³³ÊËËìA™‚ ‚Œ Ü´i“ŒŒ ?þ|fǃ ‚ cƒ´´´´´4<Æ©©©©««37 A¼½½çÍ›À'%%¡yPAé‹œœœ×¯_WTTpIII‰‰‰Ì AA~——ˆˆ`v=sss{ýúµ‘‘?wî\fǃ ‚ür¨TjGGgv ý#%%%%%qsçÎ7osBA˜¥¶¶ÖÁÁA\\œ››[UUõëׯ€‚‚‚%K–pss+**ž={–——öõõ•àää=~ü8}zÚ´i\\\RRRÇŽƒ'ååå<¨©©)//Ÿ˜˜Øc뀜œvvö9s椥¥è_„¡?þøcÎœ9<à“““Ñ<(‚ È/kíÚµx<>))IXX855•““`ff6sæÌððð²²²åË—Ã’žžžÉÉÉrrrUUU¹¹¹ð¼¥¥å¤I“>|øÀÎÎîèèhgg{üø±„„ÄÛ·o ¦OŸnll ˆŒŒŒ‹‹voð×_ݼySNNî÷ßwttŒù¿L(Ê›7o*++àÍ›7oÞ¼¡"‚ ã :;;3.– (++£?™™™‰Ãá¾}û_^»v‡‡‡J¥~þü™ýÎ;õõõ´Â999†•——×UUU†544tih×®]ŽŽŽT*uÚ´igÏžeÐz—2ïß¿çääüéç4i µµõ§%‰B¡¼}û¶²²’J¥âTUUUUU™Ù¡#‚ LB¡P¸¹¹ ýÉÂÂB~~~nnnø’6í'++K&“ýýý………uttâããa †Í™3GRRRRRREE…‡‡§¨¨¡¥¥%...!!A&“áúU€¨¨(ƒÖ!"‘899†þ“”„„„ŠŠ @ãTUUI$³CBA˜@BB¢®®ŽÖ·AD"±ººº¾¾¾¤P(´·ÌÍÍãââ*++õôôV®\ Ç0,%%…òŸšš99¹’’ssóC‡ååååååÙÙÙQ©TX mê°ÇÖG9OOO•û÷ïpïÞ½{÷î³CBA˜@FFF__ßÞÞ¾´´´³³óÓ§O¥¥¥òòòªªªÎÎέ­­………'Nœ€…333ccc[[[ÙØØÂĉ»Ô(//¿sç ¾¾‡Ã)**bVTTÚÇÖGðÓD~~þû÷ïáj)Ü»wïÞ¾}ËìAæ RUUåååݸq#¼eöåË`hhhggK677»ºº«W¯†……Áó!!!ÂÂÂjjj\\\êêêp»u999777uuuMMÍmÛ¶éëë÷½õÑÌËËëýû÷puFV#‚ ㆳ³³³³3í1’{óæžž^mmí6LXYY[[[[[[YXXF¬Qœ’’’ŠŠÊˆµ‡ ‚ c—‡‡ÇìÙ³ïÝ»Àüø=Š ‚ }QPPðéÓ§êêj{Pfǃ ‚Œ^$i”ßÂIüñÇ®]»ÄÄÄøY³f1;žQáèÑ£.\`vãÜÁƒíí홂 ÈÀ‰‰‰ÁîÀÃ04­­­ÍÏÏgvã\]]³C@77·ˆˆoooccc|JJ š¥9p`Íæ͢Å8tøpÈÅ‹™‚ È`¥¦¦ÖÔÔð©©©ÌŽgáááœ2EˆÙQŒC\\lÌA>‰?räHbbâ÷ïßeee---·mÛÆÆƶ`ÁMMMoooúÂ=ž())¹¸¸¬Y³f`1H¤½{÷øòaåíí½wï^¸1!nÆŒ3fÌ`vH‚ óEDDèé驨¨$%%•••‘É䌌ŒOŸ>1;®QDTTTAA¦{Ã͘1CQQ‘Ù!!‚ LÖÙÙ¹}ûöíÛ·>|XNNŽƒƒCII)00pîܹýªÇÑÑ1==ÝÑÑQRRÒÖÖPRRbffF ÄÄÄvîÜÙÜÜ Köv~4;pà€‚‚BDD—žžžžžÎìA&KMM-**Z¿~}—óý]+   @¡P¦¦¦¬¬¬999ÉÉɉ‰‰NNN°doçG³’’’ŒŒ øx.==}T¥ÿFA˜æH¡¥*YYY ~~~œœœ“'O>tè™L¦R©½Úևܑ#G233MLLøéÓ§3;A„ùEEEBBC¹ ²°°‡‡‡ŸŸ¾”––njjª©©éí<íÌè$"""""qòòò Ì Aaº™3g‰Äëׯw9?€q!‡£‹‰‰}ûö >þ P(ììì|||½hø#dÿþýÓ¦M ಲ²233™‚ Âd8. àìÙ³¹¹¹mmm©©©›7oNNN†:::Zè0¨JDD$++ ËÉÉ©©©íÚµ«¡¡¡¤¤ÄÍÍÍÚÚðÞÎûçœÒÒÒÏŸ?ûö  A¡111yúôiRR’²²2Ÿ………ŒŒÌÌ™3á»ÇŽc£Ã —§³³ó7xyy׬YƒaØíÛ·ëë륤¤H$‰D‚)»{;?Ê=zôóçÏ+W®àåä䘂 2Zhii=zô¨ûù¸¸¸>žèèè|þü™ö’H$Þ¹s§{±Þοyó¦oÁ2°°°°°0<ÆÉÉÉM›6¹!‚ Șàââ2uêÔ»wïð_¾|ý÷Ad4(//ÏÎΆy2p_¿~ýòå ³C3 ’’Ú0i’‘€€Ùòåž_¿ÿô’7o>óòšG0JJ[CCÿŽšA?~<;;ÛÔÔ€“‘‘‘‘‘avHcÆo¿Í‹=^Y–œìO¥R7n<Ý¥•JmoïÖF  A¤GBBBÒÒÒ\\\ö S§NevHcƼyòRR"\\lS¦‰Š ðñqÂóòòvijî‘—·KLÌ,(¨X²ä7·‰¢âæÄÄž—:ËËÛ¹º’µµ÷*+oÓÔÜ“žþ#;ééÓw§M³åâ2‘’ÚpìØMúòôM8:žKOÏwtüSRÒÊÖÖ×ß?rÞ¼´Âññ©¼¼¦ÍÍmô-–”T›™&V‹‰YîÜyžöno‘ÔÕ598L™²Ž@Xmaq¬ªªŽVÞÃ#xáÂ}ŠŠ›çÌÙ‘––7YA±`ß¾}ÒÒÒp>''̓ö ™üÄÕ•\[Û0wî´¨¨C´ó‘‘ qq>Ü5µßÄKKCKK«ûÍ£·ªîÝKxñâ4g`àc##÷ÌÌË,,x11ÁÇHHÞ¾ýb`ppútqcãùÝ›ÐÔœŸêâ²zÍ@MMƒ³s`ZZÞŒ0ȵk°±±Ð7gjzHFfrNÎÕúúæ+¼œœ.=»A$––Ç'MšøáÃ9vvVGÇ?íì΄‡»Ãò&?}z„——óðáGÇs±±Ç‡ð/Œ 2jUVVæææÖ××p999ÙÙÙÌi,Y½Zçýû?Ÿ<9RW×´oßeÚù-[–Á¾-+«ðõë¬S§6±³O’–ž¼wïªÞªÚ´i)ÅnܨßÔÔŸ 07×–”Æ0ŒD’³²Ò‹‰ùн‰îøø8MM5¯\y hhh ‹·µ]B_ +«0!!ÃÏÏ““mòdþC‡¬Èä'´­FºG’›[õúüyGn66»ÈÈ„ÆÆÏPoÞ¼”——°|ùüääÏAä×pâÄ …²jÕ*^JJŠÙñŒ1ìì“ØÙ'MžÌïë»YOÏÅ×w3++ @TT(,¬à¢Ýà••íu›f‘ûWa&"ÂWTT ˆˆxuêÔ¼¼r Ãêêš TiåiMôÈÞÞÐÜüð±cÃÂ⥥EH¤ÿ÷¤oaa%??|)-=¹©©µ¦¦žé ‡a˜3Ç‘VGQQ•œ (ø£#gccih ‰A†„€€€€À¯b¼¤¤$‡ËÉÉanLc?a„Û?Òî…‰µµ­­ß'Mš(-­îíòììxðý{{~~9‘(XRRmn~äÉ“#::31 srº\PPA+ßåv;÷ÿ^ëèÌäååxðàõ•+mm º´%&&øí[cMMìÚ)”2vöI´n¾{$ââ ÃRR.rq±õçO‚ 2ž999ݺuëÔ©S«V­ÂåååQ(f‡46|ÿÞ~ìØͬ¬Âoß_¿ÎÚ»÷’‰‰Æĉø.Åäå§(+ËøúÞ´´´ùûGöVáÅ‹ÓÓó¿o÷ô¼ÎÃᥥX_ߌÃaŠŠ’†U…†Æ1ˆGD„?+«€þŒ¡—×õ7o¾¬[·¨Ka99¢ššü®]šKJªÝÜ‚¬­Ó¦À»G"#3Y__ÕÞþLii  ¼¼öÎ}ýK!‚ŒSUUUùùùpGCÔƒö†a ::NÂê5kŽ.\8ûÒ¥ß{,v0&惊Ê6==W==åÞ*ܲe™µõI³gÏ>Þ¿ïÅ‚—“#º¹Y¨«ïÒÔܳmÛY}}ÕÞ®8;›ß¸ñŒ—×tÍš£ð̆ zééùÆÆóiwk郿}Û­¾¾IJj‰äH"É8aÏ @Hˆ‹°0¯šÚN..uõ]¯^¡Lì‚üêNž<™ŸŸoffÀ‹‹‹3;ž1ŸéÙã[™™—é_JHž>=J{éînÙãUÓ§OquõïròÀµ¬ýi™Ÿ?ÒŸàæãã첆ˆ†H¸sÇ­ï‘ððpøù9øù90ˆdêTQ*µ‡-4AÆ%~~~ZSœ¸¸¸„„sB†ÊåËøø8ŒzAÁسg˜˜XXX_PP€žøøVqpLúûoôAèܹsÝ3fKmmm?/4jjjŠŠŠø‘ié¢û]ÙAª©¹=J"Ad”¨¯¯‡Ïþ#CåôéÓÞÞÞ¼¼¼<‘ØëÓŠ‚ ȵuëÖõë×3;Š‘6qâÄán‚——vŸö †¡‘(‚ ÈxÂÉÉÉÉÉÉì(Æ¡]»vݼyóÌ™3æææøââb4m† ‚ }ñíÛ·’’’¦¦&®¸¸¸¨¨ˆÙ!!CiyCI$G”vA¤G¾¾¾¥¥¥«W¯à'OžÌìxP©ÔŽŽN<~³AAþ‡‡‡‡‡‡ãDDDDEE™Ðøàë{WBŠ“s…¨¨Åñã·àÉSr š¿x‘ $&fòòšÒ*¡OúèчqñõÜÜ&ªªÛ¿~-†ezKÛ uÉÚ[ ÎÿôC!‚ü²~ÿýwaaá›7opeee¥¥¥ÌiÌËÈÈ÷ô¼þôéц†ˆ”” ººJð¼©é!VÖ‰99W““3œ.ý´ªÈÈ„ÈH¬¬À?ÿ¼_XX™”äW[{—LÞÃÉùc‡wKËãß>|8——ÌÎ>ÉÎî ýå[ĶQ(×w1ˆá§±õö¡A~YuuuåååÍÍÍõ CŸÐÞÞ‘šJihhà†™Å§äì Lš“SòèÑ›ÀÀ]“'óãpجYR0ã´ÝõC_bëñC!‚üÊüüüÊËË׬YÀÀìÆÕ4[³u³ï;ˆ²ï[µ'q&G“€q·5&㌣IÆLŒHeÄ…VA•U ‹Œ‚àŽ 1A (*ˆÈç÷ÇÍWO?­`žŒ_Hô¾z9u ªÞ[]·«NPÐ*Ò+{¬–œã§"M@›šî«« tu…2Ï65Ý'm;ÍÍçš›Ïuu]FÚvŽ•m¬~NmÏ\) …By•QSSÓÑÑQRR2‚êééMtI/³gž8±©½=7$ÄeÖ¬/Aª%'y×’SUU©¿ÿ§IÇööÇ2yȵEffz]]½mm²Ïrm;›šö‘ŸG’®×Ò}CǪa¬ÇŸ»R …ò*³bÅ mmíììl൵µµµµ=÷=”ñ¹q£¹²òâÀÀ²²‚®®4 «%§»»mII-ôõÙ=Tº=çè(^¾|‹ôéü9m;¥û†ŽUÃøíBÇY) …By•éééyøða?ðÚÛÛéú¿Ó×7øÉ']Ý·µ´Âöìù:7÷3»%gLÌ‚³g—„„¬‹ÆÊ™ý‰ŽŽ†›Ûr¡pÖüùq==}äñç¶í”î:V ã· g¥( åU&11ñáÇï¾û.0ÏýbË+ÂêÕ«cbbbb®Zõ׉®å%dÕª±±y±±±ÿüç?q’ªªª¨¨¨êêê¡¡!›ˆˆˆeË–)++ÿœ÷ÖÕÕ…„„tvvŽÿ²òòòÈÈȺº:DtqqùôÓOg̘ñ‹ žìì좣£gÎœ)óø… æÎÛÒÒ‚ˆCCC&&&7nܘ )”—ž–––¶¶öD—A¡<‡#GŽ„„„¸ººÖÔÔÜ¿_"‘\¿~ýòåË/pyyyúÓŸÞxãï¾û®±±qöìÙ¡¡¡éééÿcZD~!þ/ ’H$=êììÜ¿ÿ¯P…òR²|ùrMMͬ¬,àutttttLtIÊxŒŽŽ._¾|ùòå6l°µµUQQqvvÞ½{·§§'´¶¶†……éêêôÑGä:-hnnþÃþ ®®îààP]]ÍeëêêúàƒLLLtuuÃÃÃ>|###}ôÑŠ+V¯^mhh¨§§·bÅŠ5kÖ¬\¹r``´µµOúiʹººškÎðÌl`gg÷ŸÿüÇßßßÎÎ.<<ÜËË‹+ ªªJ(rurrrœœ~:¥¿téRÒ€P"‘øúúŽ³šÒ ’^ÍŽŽŽ€€€¿ÿýïÃÃà ,H$yyyæææiiiÒË}:ís+¡P^ez{{=zD´Àëèèàöy å·I}}ý;wžnÕD¾úª¤¤ÔØØX[[[]]½jÕ*òlXX˜‘‘ѽ{÷ RRR¸wEDD´µµ]¼xñöíÛ`áÂ…Ü"æÌ™#Îœ9íííçΧ¶gf#äççççç744¤¦¦^¾|ùêÕŸnD%‘HÞ}÷]™óÏÓ¦M«¯¯ooo€ŠŠ 33³ªª*³šÒ ò÷÷'455ùùù‰Åb‰DÂçówïÞýöÛo/Z´¨©©iþüùÒË}:ís+¡P^e’’’:;;ÃÃÀ'‰D"ÑD—D¡Œù²Û3{Ù644œ9s&>>^UUÕÀÀ`ýúõ‰Ξ=»yóf@`iiù¯ý‹¼þÖ­[ÅÅÅ)))ZZZÊÊÊ111ùùùOž¸»»—””@__ßs³=“… ®[·®®®Nf¶•#00°©©©   88˜ÇãmÙ²…œ8k5Ÿ™GQQñðáꪪo¼ñFOÏxw‘+í8•P(¯8ÉÉÉ]]]ÀSWWWWWŸè’(”çð—¿ü¥¬¬¬¦¦ÆÅÅE$…‡‡[YY9::2 sðàÁîîn wwwww÷M›6‘·äææVTT¸ºº†„„„„„p©²²²ôôô¼½½ÕÔÔ|}}OŸ>M -***..¶¶¶ÖÓÓ[½zuQQÑ_ÿúÓõÁ111gÏžutt ‹ÅÏÍö4ûÛß®]»öç?ÿy¬y555OOO}}}2ãÜÕÕ5mÚ4øéÏ^Íg"//Ÿ““cdd4}úôÇeï É1VÚq*¡P^q”””ÔÔÔäåå€QSScfœ}ìÞQáÿ+/äŽ ¿&---~~~aaa±±±/*çÈȈ¡¡aFFÆk¯½ö¢rR(”_™>ø ===555""‚×ÝÝÝÝÝ=Ñ%Q(¿-ŒËËËUUU›››_TÎ]»v‰D"éOà åwÇÀÀÀ“'O†††€?þ4 …òÊbccóÅ_¼¨l"‘HEE%33s¬ÉK …ò»`ûöíIIIäj¾ŠŠÊD×C¡¼üpßw¥P(¿kÈð de†~%ŒŒŒþ·0}Õè( åðþû裏§ïرcÎœ9üÞÞ^zZ‰ã“OÒ>ù$íù¯£P(Ê+ÉÐÐP__éâÀïííèz~ðù|%%¥‰®â%‡\XI¡P(¿_RSSSRRˆÍhP …B¡P~ <%%%@0ÑeP( …ò;`ñâÅŠŠŠ¤s0``€ÎƒR( …òs†Üz›ûn.…B¡P(”±•““ãñxt”B¡P(”_OAAv,¢P( åç°páB>Ÿ¿oß>à ÑyP …BSÌô nIDAT¡P~£££äD.0ä²P99¹‰®ŠB¡P(”ß:ˆˆˆ Ã0 #·nݺÈÈH†aÌÌÌNœ8±oß>gffvüøñôôt999SSÓŠŠŠŒŒ yyy“òòòŒŒ “²²²ýû÷+**—––fff*++;v,33S =z4++KEEÅÐа¸¸8;;[UUÕÐа¨¨(;;[]]ÝÀÀ °°0''GCCC__???ÿÀB¡P__ÿÈ‘#ÐÔÔÔÓÓ;|øpnn®–––®®n^^ÞÁƒµµµuuuŸ]YYéãã#''÷ÕW_?~ÜÏÏÇãEEE?~ÜßߟÇãEFFž8q" €a˜õëןwîœOOOOttôùóç}||ººº6nÜxáÂooïÇÇÄÄ\ºtÉËË«³³3&&æòåË^^^›6mºr劧§çÇccc¯^½êááÑÞÞ{íÚ5¶¶¶Í›7_¿~ÝÝÝýþýûqqq nnn÷îÝ‹‹‹ûî»ïÜÜÜZ[[·lÙróæMWW×;wîlݺõ‡~pqqiiiÙºukcc£‹‹Ksss||ü­[·œoß¾pûöm''§¦¦¦„„„üÑÉÉéÖ­[‰‰‰ÍÍÍS§Nýᇒ’’îܹãèèøý÷ß'%%ݽ{×ÑÑñæ͛۶mkmmupphhhHNN¾wƒÃ7’““áÔÕÕùúúJ §»»[F8B¡ÐÀÀ€ÇãÀºuëqíÚµ°~ýzDüôÓO ** ׬Y7nDÄU«VÀ¦M›qåÊ•‡ˆü1ÄÇÇ#â‡~‰‰‰ˆ¸téRHNNFÄ%K–@jj*".Z´vî܉ˆóçÏ€´´4Dœ7oýí½÷Þ€ôôtD €ÌÌLD|çw ''à77gÍš‡BÄ™3g@~~>"¾ùæ›PXXˆˆ3fÌ€’’D|ýõ× ´´IËƲ²2D$„+++‘eY8yò$"@UU"úúúÀéÓ§ÑÛÛjjjÑÃÃêêêÑÕÕΟ?ˆNNNpéÒ%Dttt€úúzD´··€k×®!â¤I“ ¡¡mllàûï¿GDKKKhllDD333¸}û6"š˜˜@KK "ÀÝ»wQOOîß¿ˆ:::ÐÞÞŽˆ¤±sGG"jhhÀãÇQMM zzz‘\ÜÛÛ‹ˆd‚|``I;ÙááaD$ÛÌèè(9Áãñ‘œÌ——GDòoEEED$7½ˆHn¿¬¦¦†ˆ¤%­††"vtt€¦¦&"¶··€ŽŽ"Þ¿ôôôñîÝ»`hhˆˆ---`bb‚ˆ·oß333DlllKKKD¼yó&ØØØ bCCØÙÙ!âµk×ÀÞÞ¯\¹ŽŽŽˆxéÒ%pvvFÄóçÏ€««+"ÖÖÖ€‡‡"ÖÔÔ€··7"’NÚ¾¾¾ˆXUUˆxòäI`Y+++`Ú´iˆXVV¯½ö"–––À믿Žˆ%%%0cÆ D,,,€7ß|óóó`æÌ™ˆxèÐ!˜5k"æææ@XX"æääÀ;＃ˆ™™™ŽˆäJµ÷Þ{Ép5oÞ#¦€µk×""iwóÅ_ âçŸÎ ç³Ï>€ 6p‰ŽŽFÄÿûßœpHsÙÍ›7sÂÙºu+"®X±‚βeË`Û¶mœp¶oߎˆ‹/愳`Áؽ{7'œ={ö âܹs9áDDDÀþýû9ádgg#âìÙ³9ᄆ†@^^'œ#GŽ â[o½Å çü#sÂ9vì"NŸ>Npp0TTTpÂ9qâ"rÂñóó€o¿ý–Nuu5"zzz@mm-"º¹¹qÂqvv€‹/r¹rå "N™2…ŽܸqƒÎÍ›7ÑÊÊŠŽ¹¹9455qÂinnFDÒzG__îÝ»Ç §­­ µ´´8á…Bèììä„ÓÝ݈¤µ ¹+\?'œ¡¡!D$§HGGG†á„ÃçóqppN__(++sÂQUUEÄ®®.N8¤ÍƒH$â„£­­ˆ<à„ÓÚÚ œpŒñÇn›‘ûüóÏY–eY–ü¥ÌÍÍY–533cÆ‚ÄÄJ,Ëšššr±‰‰ Ã0VVV$kkk–e¹ØÈȈa€­­-˲D÷$&#ù¤I“¸ØÎÎŽeYò_!1&OžÌÅööö,Ëêêêr1ùÏM™2…‹X–ÕÖÖæbòuttäâ©S§²,K†‹D"prrâbggg–eÉ@b2ü¸¸¸ˆÅbuuub[–e¥c²•¸¹¹‰ÅbUUUpwwgYV:&[‡‡‡X,&C—§§'˲ұ²²2xyy‰Åb²…y{{³,+“¡ÎÇÇG,“ “|}}Y–•ŽÉéçç'‹Éý¨üýýY–•ŽÉ– ‹É0Ȳ¬tLf̓‚‚Äb1‰ÉöC¶l–eÉgS“ÃFGb““cY–‹Øßߟa>ŸOb——gY–(ƒÄ¾¾¾ Ã(((˜ì-,Ëúøøp±··7Ã0JJJ$&{˲^^^\ìééÉ0Œ@ 1¨¨¨°,KŽ{HìîîNö:.VSScY–è‰ÄäØH]]‹544X–uqqáb¢0¡PÈÅ"‘ˆeYr,Eâ©S§€¦¦&kii±,K”Gb²‡s±ŽŽ˲D…$&Çaºººb±xòäÉÄ,ËJÇD—úúúb±˜«°,+ÛÚÚ€¡¡¡X,&J522bYV:¶¶¶&6‹ÅDµ&&&,ËZYY1 CbrÌgjjʲ¬……˜™™‘˜œîzZ8À ‡“Œp€'á'N>/p¸ØÕÕUF>œp¸ØÝÝ]F>œp¸ØÓÓSF>œp¸ØÛÛ[F>œp¸Ø××WF>œp¸Øßß_F>œp¸800PF>œp¸˜‡‹e„œp8ùÈ8ápò‘pÂáä#-²Íü¨85GJ¥Ò6IEND®B`‚codequery-0.18.1/gui/000077500000000000000000000000001300045745200143655ustar00rootroot00000000000000codequery-0.18.1/gui/CMakeLists.txt000066400000000000000000000146251300045745200171350ustar00rootroot00000000000000cmake_minimum_required(VERSION 2.8.12) project(CodeQueryGUI) #ADD_DEFINITIONS( -Wall ) # with SET() command you can change variables or define new ones # here we define CODEQUERY_SRCS variable that contains a list of all .cpp files # note that we don't need \ at the end of line SET( CODEQUERY_SRCS sqlqueryadv.cpp std2qt.cpp langtable.cpp fileviewer.cpp listhandler.cpp searchhandler.cpp mainwindow.cpp graphdialog.cpp aboutdialog.cpp fileviewsettingsdialog.cpp themes.cpp main_gui.cpp winmain.cpp ) # another list, this time it includes all header files that should be treated with moc SET( CODEQUERY_MOC_HDRS fileviewer.h listhandler.h searchhandler.h mainwindow.h graphdialog.h aboutdialog.h fileviewsettingsdialog.h ) # some .ui files SET( CODEQUERY_UIS ui/mainWindow.ui ui/graphDialog.ui ui/aboutDialog.ui ui/fileViewSettingsDialog.ui ) # and finally an resource file SET( CODEQUERY_RCS codequery.qrc ) # translation files SET( CODEQUERY_TRANS translations/codequery_de.ts translations/codequery_en.ts translations/codequery_es.ts translations/codequery_fr.ts translations/codequery_id.ts translations/codequery_it.ts translations/codequery_ja.ts translations/codequery_ko.ts translations/codequery_zh-CHS.ts translations/codequery_zh-CHT.ts ) add_definitions( -DNO_QDESIGNER_WIDGET_EXPORT ) INCLUDE_DIRECTORIES( "${SQLITE_INCLUDE_DIR}" ) INCLUDE_DIRECTORIES( "${CMAKE_CURRENT_BINARY_DIR}" ) INCLUDE_DIRECTORIES( "." ) INCLUDE_DIRECTORIES( "./translations" ) INCLUDE_DIRECTORIES( "../querylib" ) INCLUDE_DIRECTORIES( "../makedb" ) INCLUDE_DIRECTORIES( "../showgraph" ) INCLUDE_DIRECTORIES( "/usr/local/include" ) FIND_PACKAGE( Sqlite REQUIRED ) if (BUILD_QT5) # this command finds Qt4 libraries and sets all required variables # note that it's Qt4, not QT4 or qt4 FIND_PACKAGE( Qt5Widgets 5.2.1 REQUIRED ) FIND_PACKAGE( Qt5Core REQUIRED ) FIND_PACKAGE( Qt5Concurrent REQUIRED ) FIND_PACKAGE( Qt5Xml REQUIRED ) FIND_PACKAGE( Qt5LinguistTools REQUIRED ) FIND_PACKAGE( Qt5QScintilla REQUIRED ) add_definitions( -DUSE_QT5 ) set_target_properties(Qt5::Core PROPERTIES MAP_IMPORTED_CONFIG_COVERAGE "RELEASE") SET(CMAKE_AUTOMOC ON) SET(CMAKE_INCLUDE_CURRENT_DIR ON) get_target_property(QT_RCC_EXECUTABLE Qt5::rcc LOCATION) QT5_ADD_TRANSLATION( QM ${CODEQUERY_TRANS} ) # this command will generate rules that will run rcc on all files from CODEQUERY_RCS # in result CODEQUERY_RC_SRCS variable will contain paths to files produced by rcc # QT4_ADD_RESOURCES( CODEQUERY_RC_SRCS ${CODEQUERY_RCS} ) SET( CODEQUERY_RC_NAME codequery ) SET( CODEQUERY_RC_QRC "${CMAKE_CURRENT_SOURCE_DIR}/${CODEQUERY_RC_NAME}.qrc") SET( CODEQUERY_RC_SRCS "${CMAKE_CURRENT_BINARY_DIR}/qrc_${CODEQUERY_RC_NAME}.cxx") # Run the resource compiler (rcc_options should already be set). We can't # use QT4_ADD_RESOURCES because the qrc file may not exist yet. ADD_CUSTOM_COMMAND( OUTPUT ${CODEQUERY_RC_SRCS} COMMAND ${QT_RCC_EXECUTABLE} ARGS ${rcc_options} -name ${CODEQUERY_RC_NAME} -o ${CODEQUERY_RC_SRCS} ${CODEQUERY_RC_QRC} DEPENDS ${QM} ) # this will run uic on .ui files: QT5_WRAP_UI( CODEQUERY_UI_HDRS ${CODEQUERY_UIS} ) # we need this to be able to include headers produced by uic in our code # (CMAKE_BINARY_DIR holds a path to the build directory, while INCLUDE_DIRECTORIES() works just like INCLUDEPATH from qmake) INCLUDE_DIRECTORIES( "${Qt5Widgets_INCLUDE_DIRS}" ) INCLUDE_DIRECTORIES( "${QT5QSCINTILLA_INCLUDE_DIRS}" ) if(WIN32) SET(CQ_WIN_RCS cqwin32.rc) add_executable( codequery WIN32 ${CODEQUERY_SRCS} ${CODEQUERY_MOC_SRCS} ${CODEQUERY_RC_SRCS} ${CODEQUERY_UI_HDRS} ${QM} ${CQ_WIN_RCS} ) target_link_libraries( codequery Qt5::Widgets Qt5::Concurrent Qt5::WinMain ${SQLITE_LIBRARIES} ${QT5QSCINTILLA_LIBRARIES} sqlquery_lib small_lib cqshowgraph-qt5) else() add_executable( codequery ${CODEQUERY_SRCS} ${CODEQUERY_MOC_SRCS} ${CODEQUERY_RC_SRCS} ${CODEQUERY_UI_HDRS} ${QM} ) target_link_libraries( codequery Qt5::Widgets Qt5::Concurrent ${SQLITE_LIBRARIES} ${QT5QSCINTILLA_LIBRARIES} sqlquery_lib small_lib cqshowgraph-qt5) endif() install(TARGETS codequery RUNTIME DESTINATION bin) else (BUILD_QT5) # by default only QtCore and QtGui modules are enabled # other modules must be enabled like this: #SET( QT_USE_QTXML TRUE ) #SET( QT_USE_QTSQL TRUE ) SET( QT_DONT_USE_QTGUI FALSE ) # this command finds Qt4 libraries and sets all required variables # note that it's Qt4, not QT4 or qt4 FIND_PACKAGE( Qt4 REQUIRED ) FIND_PACKAGE( QScintilla REQUIRED ) # add some useful macros and variables # (QT_USE_FILE is a variable defined by FIND_PACKAGE( Qt4 ) that contains a path to CMake script) INCLUDE( "${QT_USE_FILE}" ) QT4_ADD_TRANSLATION( QM ${CODEQUERY_TRANS} ) # this command will generate rules that will run rcc on all files from CODEQUERY_RCS # in result CODEQUERY_RC_SRCS variable will contain paths to files produced by rcc # QT4_ADD_RESOURCES( CODEQUERY_RC_SRCS ${CODEQUERY_RCS} ) SET( CODEQUERY_RC_NAME codequery ) SET( CODEQUERY_RC_QRC "${CMAKE_CURRENT_SOURCE_DIR}/${CODEQUERY_RC_NAME}.qrc") SET( CODEQUERY_RC_SRCS "${CMAKE_CURRENT_BINARY_DIR}/qrc_${CODEQUERY_RC_NAME}.cxx") # Run the resource compiler (rcc_options should already be set). We can't # use QT4_ADD_RESOURCES because the qrc file may not exist yet. ADD_CUSTOM_COMMAND( OUTPUT ${CODEQUERY_RC_SRCS} COMMAND ${QT_RCC_EXECUTABLE} ARGS ${rcc_options} -name ${CODEQUERY_RC_NAME} -o ${CODEQUERY_RC_SRCS} ${CODEQUERY_RC_QRC} DEPENDS ${QM} ) # this will run uic on .ui files: QT4_WRAP_UI( CODEQUERY_UI_HDRS ${CODEQUERY_UIS} ) # and finally this will run moc: QT4_WRAP_CPP( CODEQUERY_MOC_SRCS ${CODEQUERY_MOC_HDRS} ) if(WIN32) SET(CQ_WIN_RCS cqwin32.rc) add_executable( codequery WIN32 ${CODEQUERY_SRCS} ${CODEQUERY_MOC_SRCS} ${CODEQUERY_RC_SRCS} ${CODEQUERY_UI_HDRS} ${QM} ${CQ_WIN_RCS} ) else() add_executable( codequery ${CODEQUERY_SRCS} ${CODEQUERY_MOC_SRCS} ${CODEQUERY_RC_SRCS} ${CODEQUERY_UI_HDRS} ${QM} ) endif() target_link_libraries( codequery ${QT_LIBRARIES} ${SQLITE_LIBRARIES} ${QSCINTILLA_LIBRARIES} sqlquery_lib small_lib cqshowgraph) install(TARGETS codequery RUNTIME DESTINATION bin) endif (BUILD_QT5) codequery-0.18.1/gui/aboutdialog.cpp000066400000000000000000000024751300045745200173730ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ #include "ui_aboutDialog.h" #include "aboutdialog.h" #include "swver.h" cqDialogAbout::cqDialogAbout(QWidget *parent) :QDialog(parent) ,dialog_ui(new Ui::aboutDialog) { dialog_ui->setupUi(this); dialog_ui->labelTitle->setText(CODEQUERY_SW_VERSION_WEBSITE); dialog_ui->labelLicense->setText(CODEQUERY_SW_LICENSE_PARA_LINK); connect(dialog_ui->pushButtonCloseAbout, SIGNAL(clicked()), this, SLOT(accept())); resize(sizeHint()); layout()->setSizeConstraint(QLayout::SetFixedSize) ; setSizeGripEnabled(false) ; } cqDialogAbout::~cqDialogAbout() { disconnect(); delete dialog_ui; } codequery-0.18.1/gui/aboutdialog.h000066400000000000000000000021001300045745200170210ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ #ifndef ABOUTDIALOG_H_CQ #define ABOUTDIALOG_H_CQ #ifdef USE_QT5 #include #else #include #endif namespace Ui { class aboutDialog; } class cqDialogAbout : public QDialog { Q_OBJECT public: Ui::aboutDialog *dialog_ui; cqDialogAbout(QWidget *parent); virtual ~cqDialogAbout(); }; #endif //ABOUTDIALOG_H_CQ codequery-0.18.1/gui/codequery.qrc000066400000000000000000000021621300045745200170750ustar00rootroot00000000000000 images/Search.png images/Arrow2_Left.png images/Arrow2_Right.png images/Arrow2_Up.png images/Arrow2_Down.png images/Clipboard_Copy.png images/Clipboard_Paste.png images/Database.png images/Document2.png images/Flag.png images/Graph.png images/Zoom_Out.png images/Zoom_In.png images/Text_Minus.png images/Text_Plus.png images/logo.png ../build/gui/codequery_de.qm ../build/gui/codequery_en.qm ../build/gui/codequery_es.qm ../build/gui/codequery_fr.qm ../build/gui/codequery_id.qm ../build/gui/codequery_it.qm ../build/gui/codequery_ja.qm ../build/gui/codequery_ko.qm ../build/gui/codequery_zh-CHS.qm ../build/gui/codequery_zh-CHT.qm codequery-0.18.1/gui/cqwin32.rc000066400000000000000000000003121300045745200161750ustar00rootroot00000000000000IDI_ICON1 ICON DISCARDABLE "images/logo6464.ico" IDI_ICON2 ICON DISCARDABLE "images/logo4848.ico" IDI_ICON3 ICON DISCARDABLE "images/logo3232.ico" IDI_ICON4 ICON DISCARDABLE "images/logo1616.ico" codequery-0.18.1/gui/fileviewer.cpp000066400000000000000000000507041300045745200172400ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ #include #include #include #include #include #include #include #include #include #include #include #include "fileviewer.h" #include "mainwindow.h" #include "fileviewsettingsdialog.h" #include "themes.h" #include "std2qt.h" #ifdef USE_QT5 #define QT45_TOASCII(x) toLatin1(x) #else #define QT45_TOASCII(x) toAscii(x) #endif #ifdef _WIN32 #define EXT_EDITOR_DEFAULT_PATH "notepad %f" #else #define EXT_EDITOR_DEFAULT_PATH "gedit %f +%n" #endif filedata::filedata() { linenum = "1"; fileid = -99; } filedata::filedata(const QString& fn, const QString& ln, const int& fi) { linenum = ln; filename = fn; fileid = fi; } bool filedata::compare(const filedata& fd) { bool cmp; if ((fileid < 0)||(fd.fileid < 0)) { cmp = ((linenum.compare(fd.linenum) == 0)&& (filename.compare(fd.filename) == 0)); } else { cmp = ((linenum.compare(fd.linenum) == 0)&& (fileid == fd.fileid)); } return cmp; } bool filedata::compareFilePathOnly(const filedata& fd) { bool cmp; if ((fileid < 0)||(fd.fileid < 0)) { cmp = (filename.compare(fd.filename) == 0); } else { cmp = (fileid == fd.fileid); } return cmp; } bool filedata::compareFileNameOnly(const filedata& fd) { bool cmp; if ((fileid < 0)||(fd.fileid < 0)) { cmp =(strcmp( extract_filename(filename.QT45_TOASCII().data()), extract_filename(fd.filename.QT45_TOASCII().data())) == 0); } else { cmp = (fileid == fd.fileid); } return cmp; } filedata::filedata(const filedata& fd) { linenum = fd.linenum; filename = fd.filename; fileid = fd.fileid; } filedata& filedata::operator=(const filedata& fd) { if (&fd != this) { linenum = fd.linenum; filename = fd.filename; fileid = fd.fileid; } return *this; } fileviewer::fileviewer(mainwindow* pmw) :mw(pmw) ,m_pushButtonPrev(NULL) ,m_pushButtonNext(NULL) ,m_pushButtonOpenInEditor(NULL) ,m_pushButtonPaste(NULL) ,m_pushButtonGoToLine(NULL) ,m_labelFilePath(NULL) ,m_textEditSource(NULL) ,m_textEditSourceFont("Courier New", 12) ,m_externalEditorPath(EXT_EDITOR_DEFAULT_PATH) ,m_timestampMismatchWarned(false) ,m_lexer(NULL) ,m_fontsize(0) ,m_currentlang(enHighlightCPP) ,m_currentline(1) ,m_annotline(1) { m_iter = m_fileDataList.begin(); m_textEditSourceFont.setStyleHint(QFont::TypeWriter); } fileviewer::~fileviewer() { disconnect(); if (m_lexer != NULL) delete m_lexer; } void fileviewer::createFontList(void) { QFontDatabase fontdb; QStringList fontlst = fontdb.families(QFontDatabase::Latin); QStringList fixedpitch; QStringList::iterator it; for(it = fontlst.begin(); it != fontlst.end(); it++) { if (fontdb.isFixedPitch(*it)) { fixedpitch << (*it); } } fixedpitch.sort(); m_fontlist = fixedpitch; } void fileviewer::init(void) { m_pushButtonPaste->setEnabled(false); m_pushButtonPrev->setEnabled(false); m_pushButtonNext->setEnabled(false); m_pushButtonTextShrink->setEnabled(false); m_pushButtonTextEnlarge->setEnabled(false); m_pushButtonGoToLine->setEnabled(false); m_pushButtonOpenInEditor->setEnabled(false); m_labelFilePath->clear(); m_textEditSource->clear(); m_textEditSource->setWrapMode(QsciScintilla::WrapNone); m_textEditSource->setReadOnly(true); m_markerhandle = m_textEditSource->markerDefine(QsciScintilla::Background); m_markerhandle2 = m_textEditSource->markerDefine(QsciScintilla::RightArrow); m_textEditSource->setMarginType(0, QsciScintilla::NumberMargin); m_textEditSource->setMarginType(1, QsciScintilla::SymbolMargin); m_textEditSource->setBraceMatching(QsciScintilla::SloppyBraceMatch); m_textEditSource->setAnnotationDisplay(QsciScintilla::AnnotationBoxed); setLexer(enHighlightCPP); createFontList(); connect(m_textEditSource, SIGNAL(copyAvailable(bool)), this, SLOT(AbleToCopy(bool))); connect(m_pushButtonGoToLine, SIGNAL(clicked(bool)), this, SLOT(GoToLine_ButtonClick(bool))); connect(m_pushButtonPaste, SIGNAL(clicked(bool)), this, SLOT(Paste_ButtonClick(bool))); connect(m_pushButtonPrev, SIGNAL(clicked(bool)), this, SLOT(Prev_ButtonClick(bool))); connect(m_pushButtonNext, SIGNAL(clicked(bool)), this, SLOT(Next_ButtonClick(bool))); connect(m_pushButtonOpenInEditor, SIGNAL(clicked(bool)), this, SLOT(OpenInEditor_ButtonClick(bool))); connect(m_pushButtonTextShrink, SIGNAL(clicked(bool)), this, SLOT(TextShrink_ButtonClick(bool))); connect(m_pushButtonTextEnlarge, SIGNAL(clicked(bool)), this, SLOT(TextEnlarge_ButtonClick(bool))); connect(m_listWidgetFunc, SIGNAL(currentItemChanged(QListWidgetItem *, QListWidgetItem *)), this, SLOT(funcItemSelected(QListWidgetItem *, QListWidgetItem *))); connect(m_comboBoxFuncListSort, SIGNAL(currentIndexChanged(int)), this, SLOT(FuncListSort_indexChanged(int))); m_fileDataList.clear(); setLexer(); } void fileviewer::clearList() { //printf("Fileview clearlist\n"); m_pushButtonPaste->setEnabled(false); m_pushButtonPrev->setEnabled(false); m_pushButtonNext->setEnabled(false); m_pushButtonTextShrink->setEnabled(false); m_pushButtonTextEnlarge->setEnabled(false); m_pushButtonGoToLine->setEnabled(false); m_pushButtonOpenInEditor->setEnabled(false); m_labelFilePath->clear(); m_textEditSource->clear(); m_fileDataList.clear(); m_iter = m_fileDataList.begin(); m_timestampMismatchWarned = false; m_listWidgetFunc->clear(); } void fileviewer::recvDBtimestamp(QDateTime dt) { m_DBtimestamp = dt; } void fileviewer::fileToBeOpened(QString filename, QString linenum, int fileid) { filename.replace(QString("$HOME"), QDir::homePath()); #ifdef _WIN32 filename.replace("/", "\\"); #endif if (!(QFile::exists(filename))) { m_labelFilePath->setText(tr("File not found")); handleFileCannotBeOpenedCase(); return; } QFile file(filename); if (!file.open(QIODevice::ReadOnly | QIODevice::Text)) { m_labelFilePath->setText(tr("File could not be opened")); handleFileCannotBeOpenedCase(); return; } file.close(); QFileInfo fi(filename); if ((m_DBtimestamp < fi.lastModified())&&(m_timestampMismatchWarned == false)) { m_timestampMismatchWarned = true; QMessageBox msgBox((QWidget*)mw); msgBox.setIcon(QMessageBox::Warning); msgBox.setStandardButtons(QMessageBox::Ok); msgBox.setText(tr("The source file to be viewed is newer than the CodeQuery database file. You are recommended to manually regenerate the CodeQuery database file.")); msgBox.exec(); } filedata fd(filename, linenum, fileid); if (m_fileDataList.isEmpty()) { //printf("Fileviewer: empty list\n"); m_fileDataList.push_back(fd); m_iter = m_fileDataList.end() - 1; m_pushButtonPrev->setEnabled(false); m_pushButtonNext->setEnabled(false); updateTextEdit(); return; } else if (m_iter == m_fileDataList.end()) { // previous file not found //printf("Fileviewer: previous file not found %d, %d\n", m_fileDataList.end(), m_fileDataList.end() - 1); m_fileDataList.push_back(fd); m_iter = m_fileDataList.end() - 1; m_pushButtonPrev->setEnabled(m_iter != m_fileDataList.begin()); m_pushButtonNext->setEnabled(false); updateTextEdit(); } else if (m_iter->compare(fd)) { // the same filename and line number //printf("Fileviewer: same filename and line number\n"); updateFilePathLabel(); return; } else if (m_iter->compareFilePathOnly(fd)) { // same file, different line number //printf("Fileviewer: same file, different line number\n"); m_fileDataList.push_back(fd); m_iter = m_fileDataList.end() - 1; m_pushButtonPrev->setEnabled(true); m_pushButtonNext->setEnabled(false); highlightLine(fd.linenum.toInt()); updateFilePathLabel(); } else { // different file //printf("Fileviewer: different file\n"); m_fileDataList.push_back(fd); m_iter = m_fileDataList.end() - 1; m_pushButtonPrev->setEnabled(true); m_pushButtonNext->setEnabled(false); updateTextEdit(); } if ((m_fileDataList.isEmpty())||(m_iter == m_fileDataList.end())) return; QVector::iterator it = m_fileDataList.begin(); while ((it != m_fileDataList.end() - 1)&&(it != m_fileDataList.end())) { if (it->compare(fd)) it = m_fileDataList.erase(it); else it++; } if (m_fileDataList.size() > 20) m_fileDataList.erase(m_fileDataList.begin()); m_iter = m_fileDataList.end() - 1; } void fileviewer::updateTextEdit(void) { if (m_iter == m_fileDataList.end()) return; QApplication::setOverrideCursor(QCursor(Qt::WaitCursor)); m_textEditSource->clear(); QFile file(m_iter->filename); if (!file.open(QIODevice::ReadOnly | QIODevice::Text)) { QApplication::restoreOverrideCursor(); return; } QTextStream in(&file); int lang = enHighlightCPP; // default QRegExp rx1("\\.py$", Qt::CaseInsensitive); int pos = rx1.indexIn(m_iter->filename); if (pos != -1) lang = enHighlightPython; QRegExp rx2("\\.java$", Qt::CaseInsensitive); pos = rx2.indexIn(m_iter->filename); if (pos != -1) lang = enHighlightJava; QRegExp rx3("\\.rb$", Qt::CaseInsensitive); pos = rx3.indexIn(m_iter->filename); if (pos != -1) lang = enHighlightRuby; QRegExp rx4("\\.js$", Qt::CaseInsensitive); pos = rx4.indexIn(m_iter->filename); if (pos != -1) lang = enHighlightJavascript; m_currentlang = lang; setLexer(lang); QString alltext; while (!in.atEnd()) { alltext = in.readAll(); } m_textEditSource->setText(alltext); m_textEditSource->setMarginWidth(0, QString::number(m_textEditSource->lines() * 10)); highlightLine(m_iter->linenum.toInt()); updateFilePathLabel(); m_pushButtonGoToLine->setEnabled(true); m_pushButtonOpenInEditor->setEnabled(true); m_pushButtonTextShrink->setEnabled(true); m_pushButtonTextEnlarge->setEnabled(true); m_listWidgetFunc->clear(); if (m_iter->fileid < 0) {emit requestFuncList_filename(m_iter->filename);} else {emit requestFuncList_fileid(m_iter->fileid);} QApplication::restoreOverrideCursor(); } void fileviewer::updateFilePathLabel(void) { QString labeltext = m_iter->filename; labeltext += ":"; labeltext += m_iter->linenum; m_labelFilePath->setText(labeltext); m_pushButtonGoToLine->setEnabled(true); } void fileviewer::AbleToCopy(bool copy) { int lineFrom, indexFrom, lineTo, indexTo; m_pushButtonPaste->setEnabled(copy); if (copy) { m_textEditSource->copy(); m_textEditSource->getSelection(&lineFrom, &indexFrom, &lineTo, &indexTo); m_annotline = lineTo; QString str = (QApplication::clipboard())->text(); m_textEditSource->clearAnnotations(); if (str.length() > 0) emit requestAnnotation(str); } } void fileviewer::GoToLine_ButtonClick(bool checked) { if (!checked) highlightLine(m_iter->linenum.toInt()); } void fileviewer::Prev_ButtonClick(bool checked) { if (m_fileDataList.isEmpty()) { m_pushButtonPrev->setEnabled(false); m_pushButtonNext->setEnabled(false); return; } if(m_iter == m_fileDataList.begin()) { m_pushButtonPrev->setEnabled(false); return; } if (!checked) { QVector::iterator it = m_iter; m_iter--; if ((it != m_fileDataList.end())&&(m_iter->compareFilePathOnly(*it))) { highlightLine(m_iter->linenum.toInt()); updateFilePathLabel(); } else { updateTextEdit(); } m_pushButtonPrev->setEnabled(m_iter != m_fileDataList.begin()); m_pushButtonNext->setEnabled(m_iter != m_fileDataList.end() - 1); } } void fileviewer::Next_ButtonClick(bool checked) { if (m_fileDataList.isEmpty()) { m_pushButtonPrev->setEnabled(false); m_pushButtonNext->setEnabled(false); return; } if((m_iter == m_fileDataList.end() - 1)|| (m_iter == m_fileDataList.end())) { m_pushButtonNext->setEnabled(false); return; } if (!checked) { QVector::iterator it = m_iter; m_iter++; if (m_iter->compareFilePathOnly(*it)) { highlightLine(m_iter->linenum.toInt()); updateFilePathLabel(); } else { updateTextEdit(); } m_pushButtonPrev->setEnabled(m_iter != m_fileDataList.begin()); m_pushButtonNext->setEnabled(m_iter != m_fileDataList.end() - 1); } } void fileviewer::handleFileCannotBeOpenedCase(void) { //printf("handleFileCannotBeOpenedCase\n"); m_textEditSource->clear(); m_pushButtonTextShrink->setEnabled(false); m_pushButtonTextEnlarge->setEnabled(false); m_pushButtonGoToLine->setEnabled(false); m_pushButtonNext->setEnabled(false); m_pushButtonPrev->setEnabled(m_fileDataList.isEmpty() == false); m_iter = m_fileDataList.end(); } void fileviewer::Paste_ButtonClick(bool checked) { if (!checked) { m_textEditSource->copy(); if (m_checkBoxSymbolOnly->isChecked()) emit searchCopiedTextSymbolOnly(); else emit searchCopiedText(); } } void fileviewer::fileViewSettings_Triggered(bool checked) { cqDialogFileViewSettings cqdg((QWidget*)mw, this, m_fontlist, themes::getThemesList()); m_fonttemp = m_textEditSourceFont.family(); m_fontwidthtemp = (m_textEditSource->tabWidth()); m_themetemp = m_theme; cqdg.setCurrentFontType(m_fonttemp); cqdg.setTabWidth(m_fontwidthtemp); cqdg.setCurrentTheme(m_themetemp); cqdg.setModal(true); cqdg.exec(); if (cqdg.result() == QDialog::Accepted) { m_textEditSourceFont.setFamily(m_fonttemp); //m_lexer->setFont(m_textEditSourceFont); m_textEditSource->setTabWidth(m_fontwidthtemp); m_textEditSource->zoomTo(m_fontsize); m_theme = m_themetemp; m_themelast = "1234"; setLexer(); } } void fileviewer::OptionsExtEditor_Triggered(bool checked) { bool ok; QString inptext; QInputDialog qinp(mw); qinp.setCancelButtonText(tr("Cancel")); qinp.setOkButtonText(tr("OK")); qinp.setInputMode(QInputDialog::TextInput); qinp.setWindowTitle(tr("External Editor Configuration")); QString exted = tr("Please enter the path and arguments for the external editor. Replace as follows:"); exted += "\n%f - "; exted += tr("for file path"); exted += "\n%n - "; exted += tr("for line number"); exted += "\n"; exted += tr("For example:"); #ifdef _WIN32 exted += "\n\"C:\\Program Files\\Notepad++\\notepad++.exe\" -n%n %f"; #else exted += "\ngedit %f +%n"; #endif qinp.setLabelText(exted); qinp.setTextEchoMode(QLineEdit::Normal); qinp.setTextValue(m_externalEditorPath); qinp.exec(); ok = (qinp.result() == QDialog::Accepted); inptext = qinp.textValue(); if (ok && (inptext.isEmpty() == false)) m_externalEditorPath = inptext.trimmed(); } void fileviewer::OpenInEditor_ButtonClick(bool checked) { QMessageBox msgBox(mw); msgBox.setIcon(QMessageBox::Warning); msgBox.setStandardButtons(QMessageBox::Ok); if (!checked) { QFile file(m_iter->filename); if (!file.open(QIODevice::ReadOnly | QIODevice::Text)) { msgBox.setText(tr("File could not be opened!")); msgBox.exec(); return; } file.close(); QStringList arguments; QString program; QRegExp rx("^\"([^\"]+)\" (.*)"); int pos = rx.indexIn(m_externalEditorPath); if (pos != -1) { program = rx.cap(1); arguments = (rx.cap(2)).split(QRegExp("[ ]+")); } else { arguments = m_externalEditorPath.split(QRegExp("[ ]+")); program = arguments.takeFirst(); } arguments.replaceInStrings(QRegExp("%f"), m_iter->filename); arguments.replaceInStrings(QRegExp("%n"), m_iter->linenum); if (QProcess::startDetached(program, arguments) == false) { msgBox.setText(tr("External editor could not be started. Please check Options!")); msgBox.exec(); return; } } } void fileviewer::TextShrink_ButtonClick(bool checked) { if (!checked) { textSizeChange(0-1); //m_textEditSource->zoomOut(); } } void fileviewer::TextEnlarge_ButtonClick(bool checked) { if (!checked) { textSizeChange(1); //m_textEditSource->zoomIn(); } } void fileviewer::textSizeChange(int n) { //m_fontwidthtemp = (m_textEditSource->tabWidth()); //m_lexer->setFont(m_textEditSourceFont); m_fontsize += n; m_textEditSource->zoomTo(m_fontsize); m_textEditSource->setMarginWidth(0, QString::number(m_textEditSource->lines() * 10)); //m_textEditSource->setTabWidth(m_fontwidthtemp); } void fileviewer::fontSelectionTemporary(const QString &fonttxt) { m_fonttemp = fonttxt; } void fileviewer::themeSelectionTemporary(const QString &themetxt) { m_themetemp = themetxt; } void fileviewer::tabWidthSelectionTemporary(const QString &width) { m_fontwidthtemp = width.toInt(); } void fileviewer::highlightLine(unsigned int num) { m_textEditSource->markerDeleteAll(); if (num <= 0) { num = 1; } else { num = num - 1; // not sure why it's one off m_textEditSource->markerAdd(num, m_markerhandle); m_textEditSource->markerAdd(num, m_markerhandle2); } m_textEditSource->ensureLineVisible(num); m_currentline = num; } void fileviewer::setLexer(int lang) { if (lang == -1) lang = m_currentlang; if (m_lexer == NULL) { m_lexer = new QsciLexerCPP(m_textEditSource); //m_lexer->setFont(m_textEditSourceFont); m_textEditSource->setLexer(m_lexer); m_textEditSource->zoomTo(m_fontsize); m_themelast = "1234"; } switch(lang) { case enHighlightCPP: replaceLexer("C++", lang); break; case enHighlightPython: replaceLexer("Python", lang); break; case enHighlightJava: replaceLexer("Java", lang); break; case enHighlightRuby: replaceLexer("Ruby", lang); break; case enHighlightJavascript: replaceLexer("JavaScript", lang); break; default: replaceLexer("C++", lang); break; } } void fileviewer::replaceLexer(const char* langstr, int lang) { QColor markerlinebgcolor; QColor linenumfgcolor; if ((strlen(m_lexer->language()) != strlen(langstr)) || (strcmp(m_lexer->language(), langstr) != 0)) { m_textEditSource->setLexer(NULL); delete m_lexer; switch (lang) { case enHighlightCPP: m_lexer = new QsciLexerCPP(m_textEditSource); break; case enHighlightPython: m_lexer = new QsciLexerPython(m_textEditSource); break; case enHighlightJava: m_lexer = new QsciLexerJava(m_textEditSource); break; case enHighlightRuby: m_lexer = new QsciLexerRuby(m_textEditSource); break; case enHighlightJavascript: m_lexer = new QsciLexerJavaScript(m_textEditSource); break; default: m_lexer = new QsciLexerCPP(m_textEditSource); break; } //m_lexer->setFont(m_textEditSourceFont); m_textEditSource->setLexer(m_lexer); m_textEditSource->zoomTo(m_fontsize); m_themelast = "1234"; } if (m_themelast.compare(m_theme) != 0) { m_themelast = m_theme; themes::setTheme(m_theme, lang, m_lexer, m_textEditSourceFont, markerlinebgcolor, linenumfgcolor); m_textEditSource->setMarkerBackgroundColor(markerlinebgcolor, m_markerhandle); m_textEditSource->setMarkerBackgroundColor(linenumfgcolor, m_markerhandle2); m_textEditSource->setMarginsFont(m_textEditSourceFont); //m_textEditSource->setLexer(m_lexer); m_textEditSource->zoomTo(m_fontsize); m_textEditSource->setMarginWidth(0, QString::number(m_textEditSource->lines() * 10)); m_textEditSource->recolor(); } } void fileviewer::annotate(QString annotstr) { m_textEditSource->clearAnnotations(); m_textEditSource->annotate(m_annotline, annotstr, 29); } void fileviewer::recvFuncList(sqlqueryresultlist* reslist) { m_listWidgetFunc->clear(); if ((m_fileDataList.isEmpty())||(m_iter == m_fileDataList.end())) return; m_funclist = *reslist; filedata fd(str2qt(m_funclist.resultlist[0].filename), "1", -99); if (m_iter->compareFileNameOnly(fd) == false) { if (m_iter->fileid < 0) {emit requestFuncList_filename(m_iter->filename);} else {emit requestFuncList_fileid(m_iter->fileid);} return; } if (m_comboBoxFuncListSort->currentIndex() == 0) {m_funclist.sort_by_linenum();} else {m_funclist.sort_by_name();} for (int i=0; i < m_funclist.resultlist.size(); i++) { m_listWidgetFunc->addItem(new QListWidgetItem( str2qt(m_funclist.resultlist[i].symname), 0, atoi(m_funclist.resultlist[i].linenum.c_str()))); } } void fileviewer::funcItemSelected(QListWidgetItem * curitem, QListWidgetItem * previtem) { if (curitem == NULL) return; int num = curitem->type(); if (num <= 0) { num = 1; } else { num = num - 1; // not sure why it's one off } m_textEditSource->ensureLineVisible(num); } void fileviewer::FuncListSort_indexChanged(const int& idx) { recvFuncList(&m_funclist); } codequery-0.18.1/gui/fileviewer.h000066400000000000000000000075301300045745200167040ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ #ifndef FILEVIEWER_H_CQ #define FILEVIEWER_H_CQ #ifdef USE_QT5 #include #else #include #endif #include "sqlquery.h" Q_DECLARE_METATYPE(sqlqueryresultlist*) class mainwindow; class QsciScintilla; class QsciLexer; class filedata { public: QString filename; QString linenum; int fileid; filedata(); filedata(const QString& fn, const QString& ln, const int& fi); filedata(const filedata& fd); bool compare(const filedata& fd); bool compareFilePathOnly(const filedata& fd); bool compareFileNameOnly(const filedata& fd); filedata& operator=(const filedata& fd); }; enum langtypes { enHighlightNone = 0, enHighlightCPP, enHighlightPython, enHighlightJava, enHighlightRuby, enHighlightGo, enHighlightJavascript }; class fileviewer : public QObject { Q_OBJECT public: QPushButton *m_pushButtonPrev; QPushButton *m_pushButtonNext; QPushButton *m_pushButtonOpenInEditor; QPushButton *m_pushButtonPaste; QPushButton *m_pushButtonGoToLine; QPushButton *m_pushButtonTextShrink; QPushButton *m_pushButtonTextEnlarge; QCheckBox *m_checkBoxSymbolOnly; QLabel *m_labelFilePath; QsciScintilla *m_textEditSource; QListWidget *m_listWidgetFunc; QComboBox *m_comboBoxFuncListSort; QString m_externalEditorPath; QFont m_textEditSourceFont; QsciLexer* m_lexer; int m_fontsize; QString m_theme; fileviewer(mainwindow* pmw); ~fileviewer(); void init(void); void updateTextEdit(void); void updateFilePathLabel(void); void handleFileCannotBeOpenedCase(void); public slots: void fileToBeOpened(QString filename, QString linenum, int fileid); void AbleToCopy(bool copy); void GoToLine_ButtonClick(bool checked); void Paste_ButtonClick(bool checked); void Prev_ButtonClick(bool checked); void Next_ButtonClick(bool checked); void OpenInEditor_ButtonClick(bool checked); void TextShrink_ButtonClick(bool checked); void TextEnlarge_ButtonClick(bool checked); void OptionsExtEditor_Triggered(bool checked); void fileViewSettings_Triggered(bool checked); void clearList(); void recvDBtimestamp(QDateTime dt); void fontSelectionTemporary(const QString &fonttxt); void themeSelectionTemporary(const QString &themetxt); void tabWidthSelectionTemporary(const QString &width); void annotate(QString annotstr); void recvFuncList(sqlqueryresultlist* reslist); void funcItemSelected(QListWidgetItem * curitem, QListWidgetItem * previtem); void FuncListSort_indexChanged(const int& idx); signals: void searchCopiedText(); void searchCopiedTextSymbolOnly(); void requestAnnotation(QString searchstr); void requestFuncList_filename(QString filename); void requestFuncList_fileid(int fileid); private: mainwindow *mw; QVector m_fileDataList; QVector::iterator m_iter; QDateTime m_DBtimestamp; bool m_timestampMismatchWarned; QStringList m_fontlist; QString m_fonttemp; QString m_themetemp; QString m_themelast; int m_currentlang; int m_fontwidthtemp; int m_markerhandle; int m_markerhandle2; long m_currentline; long m_annotline; sqlqueryresultlist m_funclist; void createFontList(void); void textSizeChange(int n); void highlightLine(unsigned int num = 0); void setLexer(int lang = -1); void replaceLexer(const char* langstr, int lang); }; #endif codequery-0.18.1/gui/fileviewsettingsdialog.cpp000066400000000000000000000050631300045745200216500ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ #include "ui_fileViewSettingsDialog.h" #include "fileviewsettingsdialog.h" #include "fileviewer.h" #include cqDialogFileViewSettings::cqDialogFileViewSettings(QWidget *parent, fileviewer* fv, const QStringList& fontlst, const QStringList& themeslst) :QDialog(parent) ,m_fv(fv) ,dialog_ui(new Ui::fileViewSettingsDialog) ,m_tabwidthvalidator(1,64) { dialog_ui->setupUi(this); dialog_ui->lineEditTabWidth->setValidator(&m_tabwidthvalidator); dialog_ui->comboBoxFont->addItems(fontlst); dialog_ui->comboBoxTheme->addItems(themeslst); connect(dialog_ui->pushButtonOK, SIGNAL(clicked()), this, SLOT(accept())); connect(dialog_ui->pushButtonCancel, SIGNAL(clicked()), this, SLOT(reject())); connect(dialog_ui->comboBoxFont, SIGNAL(currentIndexChanged(const QString &)), fv, SLOT(fontSelectionTemporary(const QString &))); connect(dialog_ui->comboBoxTheme, SIGNAL(currentIndexChanged(const QString &)), fv, SLOT(themeSelectionTemporary(const QString &))); connect(dialog_ui->lineEditTabWidth, SIGNAL(textEdited(const QString &)), fv, SLOT(tabWidthSelectionTemporary(const QString &))); resize(sizeHint()); layout()->setSizeConstraint(QLayout::SetFixedSize) ; setSizeGripEnabled(false) ; } cqDialogFileViewSettings::~cqDialogFileViewSettings() { disconnect(); delete dialog_ui; } void cqDialogFileViewSettings::setCurrentFontType(const QString& fonttype) { int idx = dialog_ui->comboBoxFont->findText(fonttype, Qt::MatchContains); dialog_ui->comboBoxFont->setCurrentIndex(idx); } void cqDialogFileViewSettings::setCurrentTheme(const QString& theme) { int idx = dialog_ui->comboBoxTheme->findText(theme, Qt::MatchContains); dialog_ui->comboBoxTheme->setCurrentIndex(idx); } void cqDialogFileViewSettings::setTabWidth(const int& width) { dialog_ui->lineEditTabWidth->setText(QString::number(width)); } codequery-0.18.1/gui/fileviewsettingsdialog.h000066400000000000000000000027051300045745200213150ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ #ifndef FILEVIEWSETTINGSDIALOG_H_CQ #define FILEVIEWSETTINGSDIALOG_H_CQ #ifdef USE_QT5 #include #else #include #endif namespace Ui { class fileViewSettingsDialog; } class fileviewer; class cqDialogFileViewSettings : public QDialog { Q_OBJECT public: Ui::fileViewSettingsDialog *dialog_ui; cqDialogFileViewSettings(QWidget *parent, fileviewer* fv, const QStringList& fontlst, const QStringList& themeslst); virtual ~cqDialogFileViewSettings(); void setCurrentFontType(const QString& fonttype); void setCurrentTheme(const QString& theme); void setTabWidth(const int& width); public slots: private: QIntValidator m_tabwidthvalidator; fileviewer* m_fv; }; #endif //FILEVIEWSETTINGSDIALOG_H_CQ codequery-0.18.1/gui/graphdialog.cpp000066400000000000000000000110631300045745200173530ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ #include "ui_graphDialog.h" #include "graphdialog.h" #include "showgraph.h" cqDialogGraph::cqDialogGraph(QWidget *parent) :QDialog(parent) ,dialog_ui(new Ui::DialogGraph) ,m_scaleFactor(5.0) { dialog_ui->setupUi(this); connect(dialog_ui->pushButtonClose, SIGNAL(clicked()), this, SLOT(accept())); connect(dialog_ui->pushButtonZoomOut, SIGNAL(clicked()), this, SLOT(zoomout())); connect(dialog_ui->pushButtonZoomIn, SIGNAL(clicked()), this, SLOT(zoomin())); connect(dialog_ui->pushButtonSave, SIGNAL(clicked()), this, SLOT(savetoimagefile())); connect(dialog_ui->pushButtonSaveDot, SIGNAL(clicked()), this, SLOT(savetodotfile())); connect(dialog_ui->comboBoxNbrOfLevels, SIGNAL(currentIndexChanged(int)), this, SLOT(numberOfLevelsChanged(int))); } cqDialogGraph::~cqDialogGraph() { disconnect(); delete dialog_ui; } void cqDialogGraph::setupGraphFromXML(QStringList& grpxml, QStringList& grpdot, QString& desc) { m_grpxml = grpxml; m_grpdot = grpdot; m_img = showgraph::convertToImage(grpxml[0]); dialog_ui->labelGraph->setPixmap(QPixmap::fromImage(m_img)); dialog_ui->labelGraph->setMask(dialog_ui->labelGraph->pixmap()->mask()); if (desc.length() > 0) dialog_ui->labelDesc->setText(desc); for (unsigned int i=0; i < grpxml.size(); i++) dialog_ui->comboBoxNbrOfLevels->addItem(QString::number(i+1)); dialog_ui->comboBoxNbrOfLevels->setCurrentIndex(0); show(); adjustScrollBar(dialog_ui->scrollArea->horizontalScrollBar(), m_scaleFactor/5); adjustScrollBar(dialog_ui->scrollArea->verticalScrollBar(), m_scaleFactor/5); } void cqDialogGraph::numberOfLevelsChanged(int num) { m_img = showgraph::convertToImage(m_grpxml[dialog_ui->comboBoxNbrOfLevels->currentIndex()]); dialog_ui->labelGraph->setPixmap(QPixmap::fromImage(m_img)); dialog_ui->labelGraph->setMask(dialog_ui->labelGraph->pixmap()->mask()); adjustScrollBar(dialog_ui->scrollArea->horizontalScrollBar(), m_scaleFactor/5); adjustScrollBar(dialog_ui->scrollArea->verticalScrollBar(), m_scaleFactor/5); } void cqDialogGraph::zoomout() { scaleImage(-1); } void cqDialogGraph::zoomin() { scaleImage(1); } void cqDialogGraph::savetoimagefile() { QString filetype = tr("Images"); filetype += " (*.png *.jpg *.bmp *.tiff)"; QString fileName = QFileDialog::getSaveFileName( this, tr("Export Image"), QDir::currentPath(), filetype); if (fileName.isEmpty()) return; QMessageBox msgBox(this); msgBox.setIcon(QMessageBox::Warning); msgBox.setStandardButtons(QMessageBox::Ok); QImageWriter writer( fileName); if ((writer.canWrite() && writer.write(m_img)) == false) { msgBox.setText(tr("File could not be saved!")); msgBox.exec(); } } void cqDialogGraph::savetodotfile() { QString fileName = QFileDialog::getSaveFileName( this, tr("Export DOT file"), QDir::currentPath(), "Graphviz DOT (*.dot)"); if (fileName.isEmpty()) return; QFile outfile(fileName); QMessageBox msgBox(this); msgBox.setIcon(QMessageBox::Warning); msgBox.setStandardButtons(QMessageBox::Ok); if (outfile.open(QIODevice::WriteOnly | QIODevice::Text) == false) { msgBox.setText(tr("File could not be saved!")); msgBox.exec(); return; } QTextStream out(&outfile); out << m_grpdot[dialog_ui->comboBoxNbrOfLevels->currentIndex()]; outfile.close(); } void cqDialogGraph::scaleImage(double factor) { QPixmap p = QPixmap::fromImage(m_img); m_scaleFactor += factor; m_scaleFactor = (m_scaleFactor < 1.0) ? 1.0 : m_scaleFactor; dialog_ui->labelGraph->setPixmap(p.scaled((m_scaleFactor/5) * p.size(), Qt::KeepAspectRatio)); adjustScrollBar(dialog_ui->scrollArea->horizontalScrollBar(), m_scaleFactor/5); adjustScrollBar(dialog_ui->scrollArea->verticalScrollBar(), m_scaleFactor/5); } void cqDialogGraph::adjustScrollBar(QScrollBar *scrollBar, double factor) { int minim = scrollBar->minimum(); scrollBar->setValue((scrollBar->maximum() - minim)/2 + minim); } codequery-0.18.1/gui/graphdialog.h000066400000000000000000000027261300045745200170260ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ #ifndef GRAPHDIALOG_H_CQ #define GRAPHDIALOG_H_CQ #ifdef USE_QT5 #include #else #include #endif namespace Ui { class DialogGraph; } class cqDialogGraph : public QDialog { Q_OBJECT public: Ui::DialogGraph *dialog_ui; cqDialogGraph(QWidget *parent); virtual ~cqDialogGraph(); void setupGraphFromXML(QStringList& grpxml, QStringList& grpdot, QString& desc); void scaleImage(double factor); void adjustScrollBar(QScrollBar *scrollBar, double factor); public slots: void zoomout(); void zoomin(); void savetoimagefile(); void savetodotfile(); void numberOfLevelsChanged(int num); private: double m_scaleFactor; QImage m_img; QString m_dot; QStringList m_grpxml; QStringList m_grpdot; }; #endif //GRAPHDIALOG_H_CQ codequery-0.18.1/gui/images/000077500000000000000000000000001300045745200156325ustar00rootroot00000000000000codequery-0.18.1/gui/images/Arrow2_Down.png000066400000000000000000000014731300045745200205100ustar00rootroot00000000000000‰PNG  IHDR szzôIDATX…­—½kaÆŸÝ{“\.A‚þ vbgcÀVÒjek'¤±Ð"¦PAŒ6)‚ÍIŒˆæÔ‹^Ì%&hB<“@! ‚`c¡Ñ»›±¸ýx¿w/:°¹Ý}o÷y~3s³›àÕØÑ1Çà Nþ´?8Þg÷±ºÏÊ1¥ëu‰ŸôXÅ¢E»x$ªÇß™äû"ŽÙ$Í„Ó€NÕ95;©ÉgàSÛLPr«þ•š˜MC> – ø¨£sƒçfvõÚÓ`~|Æž‡Z2Ë€ˆ‰\têî¾CÝ%½rI0™‚)5+Y²¸‹Z_óE"î¡– µaDÊ”/ˆ5jÀ’‹¹Ãs ôZ™š4ŠK P[º\®]þ ¸©•ADQ×ï:ÓeS§÷ã¨2¨åµ¬`fƒ’ô}é~"µ|Q®Z‚ƒT‚´V&µl"—› vÿtZ¨‰gïâÀá#†@AŸ‚Zœ¹X1œþþõå«C 2GuHÌ æ¨yRg[ÕÛ =¥e ‚Àk X@±/ݺ‹ýX»"NÊëPÛ@J-/~ÿ²¥òy4ÿüÌ‘x{0^NŽàãû \:¡>:åÅoŸÞa±<Œfc¯sqf,<¼Œµ9#»Z ÌñI”ùºûµÉ hµ‰×_Ãöê#+˜QYå/ƒˆñy§†¥—@ÔÊe`en õŲ“Ú˜„úI‚ôsŒn²»YAØÕ‹ÁÓW¡Süͳq¬¿˜ß|¶­š©áˆÜLׇµi¬L_;&ÒÆÂ=¬>ϤV2R[¦Ÿel-߇èéÃñSÊøæë)ÔžÜPž„yrž£^Ñ瀣QXë“õù;بN$â;k³¨Nª#ع©ÃHÄŽýãÓ|8-ÏÜ„èéG©ÿ ž—GÐ"ó5ˆ€Bn#íZÃèçªS£@P@«ÙÊH;;߸…«ÖµÅdûùÑÌM- Ç!Ôק jÍà~©åSgÊ¦Ö ÔÕ”v ¨P§¦•fóˆ¨ÿŽ‰Ø„¿8"IEND®B`‚codequery-0.18.1/gui/images/Arrow2_Left.png000066400000000000000000000015121300045745200204650ustar00rootroot00000000000000‰PNG  IHDR szzôIDATX…­WKhA}3Û1ˆ  Š(B$ø!!q…  T ¯zàÅxñsS!ˆ`"È!xð$Q4 "(@D HðàA$ÆÕ­ò°Ó3ý©žì&Û°»ý™é÷^UuUo4:Ð> 9Ó¯êë>‡ÇvŸ­1eë%•€ïÉ#`Á’E<uÆú5¯ò)ÖcöÉ!$પ_5USF«–HPúÛ«š˜}By$ˆ9fŒ\°äEb`ùš6ì:õŒÄ\g€){F˜òæÄ€ÒŠBf—T¯XWÄöÞ;PÍËìc%šÙUÍ–U” î™Þ! ¬Ü°Å£(4-`(Ìõµá"g]…T{DXµq7¶õÜBA5§q“šYÌN„ )Ë f`õ¦ýè<ܸÐdbÛäìaª¶\MÀUíúÀÚ­‡Ð~ð⸷頫Gµ9VÕýõÇÐvà ¢(öÀ çò;qÞmÃW‹B&ä$Ä@K× lÞ{Q7.¨%5ʼn’T3€Öîshí>“ ^OóÝTMZ© ´¯`˾‹hé:Þ`Ÿ[±`X@×ì‚mÑ(Sma¬Óhš*‰1þì&&^6”'©×MɱæâÇ—w1þü6Xûe‘-„›çØ]œx3Œ±‘ë`¢†j† §ÏêüäØC”çf±³÷₺ÔJ¥"Fx(;šý8UíZ"‰"ÆTé Fô¡ò¯ì+³J-§eÖ´¤«Ú BÐÝ,#ôåÓ+¼>¿åߢi‰Ø“Îÿ0bñ¢@,¾<=ùO‡Î¢<÷Ë!PŸjË̺ °§:µˆ±ñ·Ïï12xf&8_µhN’&cÇ=3_?àѽ“ø13e]ÁjSm¨"‚P¥B—‹ìÎ÷é Üï?"VPkŒ Æœ.€Ê<"r]×›°0WÙjéÆ­<Ðjd½ªM`ÝRÔ¤Ú] j³2áTÀó©v ”² ìZ]Ÿ¯3ÒV°å€(ýLp‹y,¤ÀÓIEND®B`‚codequery-0.18.1/gui/images/Arrow2_Right.png000066400000000000000000000014551300045745200206560ustar00rootroot00000000000000‰PNG  IHDR szzôôIDATX…­–?hAÆ¿ÛKˆ)„€  ˆ…`P‚pg ÑBÑô"b ¹BPlÅ&1‚hÔBJ  ±‰J0Ia,Dµ±Ñ“÷,ngçÿnîröngæv¾ï7óæíEãƒÝƒ¶ #8ý¨±¼çpÛ¼g£Mj¼'â;² èF¼bÉ _<µÚò7q.ySIJ͎ Y&‚lªÆ©9HMYZMí3AéslX.51»†²L0 8fÙbɃòâH ÷ج\³¹.Γù’}N?ƒ°÷(àÔGÆ¡³k=J}CèZד)Èœôׯ¤_è{¾j’1ƒ’}ŠÛ;Q껆UÊ® ‡Z7)BÔŽÒÇ85"#.v |ä VoìuÍZÔú%Ø'"gVUT¢Ê(ÄíØ~xk7íV« QiWÒÛÉçËòúdìä‚/D¡ˆò¡ËˆDjïGœà" ˆî©LúØ{kš”^@TìÀì›û•‡¨E¡-0ýÒ"ŠJûÏ¢P\éW·=EHÖÀ^·"¢(¶½§°ug¿ÿ82 Hs–f8åOÞˆ‰ž]'PÚW1Y&eì«áÔš0ˆ8”„lì}V†7“cCxûüª·ª¦§ÀlE03&F0õòV°´ÇLª¡.[œãÏcfâA൭­€>(MÜ;×í!k! 8z©êˆÓâÆîžÁÇwÏÂ/4ÀթúØyØ0à9- ó® 6ý"H6 )¦ÖWÌŽóñôæI|ž}I­î1‘5C­·!”øüÜo<¾Ñ¯µ©\j3 SjöŠøʧ‹’‚1÷ç]?ŽoŸf2Nõן3êÀR©åÒ€Ÿßk½s?¾|ð“:Xý·d¨-ð :Ôæ+y‘1|ñ@ÃÔ©èIϲ{¨s)ó¨µvNA&µÇd£Ôº° ãäRÛ¢MR먄MPkÂyÔ¶ªšÀ: íµ2m$[†8€êË‚—€ïªIEND®B`‚codequery-0.18.1/gui/images/Arrow2_Up.png000066400000000000000000000015361300045745200201650ustar00rootroot00000000000000‰PNG  IHDR szzô%IDATX…­–MkQ†ß¹™¤iÚhjÚTQcQ µÒ*VRD¤H‹Òº(M?âp§® j¥*T»Wpå^þ¡t¯‚+QÜh›Â=.2wæ~ÎM«’™;_ïûœsÏ Þ/[0Š” ø¯µ!±OOʘ'ç×ÂHülšÙˆU,:iDµ±¸&ô’ïˆXŒÉäš §jûÔä¤æiþ7µÍï#ÕÀ¿Rs"ÓPš EÂdãºXt£ø Ï vò:8QKœâê5\3Ž8¡ r¥ÝEÝx#î"2ØjþƧ¯iÖ©IÉ “ÅÛ¡æ”Ô1vqŒ…‚#Ów°ïè¬JMnj9+̘¥òCd#¼µ-UGqbn ,ÌÅs'ŽÏÞÃÀÐ9Ã,ççÔúY`˜+]6òbeã—ž"ÌumËXãs‹Ø;x:&S5£f† a9u:5' «|§®¬ ›/â"2™,&.?B¥6n¥V xëùL5ÓD(”ª¨7ž££Ðãfó8su½ûÇœÔò³­s€¤ :ºûQo¬"_¬xÅEdsL^{†=ÕaƒZ7Â\ÔD„\W/&VQ(UÛ‘Ë1us¥þ#öîˆÊÃŒÚs ÛÙƒ‰…Ut—n[\DG¡„ó·^`w_Í€Iº :!Æc3÷±«opÇâ":»Ë˜¾±¬P+/£x ÕZqýíC¬¿{l´çÔí—³y§à›' l57,/)åCD6€Ì“¿¾VÛ2zˆ§ÿøú[›Ô¥êä–uBâÉÀæ01‘|V¥…,¬è‰3`”Ó–”É¢ÖiÔ¦í L­ßì5`¹Çš«á*µ|߀Ÿ:Ù'„œëNMŀDŽ­Œ©H¨µo9}¿íX^jÐ Pl6^Ò¨å±/ôrš(ùÊ"$%° B7àw¿jS¨c'!,i×& 'àÕƒy‚8:ess#Z*¥Ñ.jYäç·/ÞÅÅE- ‹PºÀEíëeo­â€s%T©ÛYReaµn`-y€Ö>A…Z]®ãÉ–"`í/!Ó~Ðtˆ‡IEND®B`‚codequery-0.18.1/gui/images/Clipboard_Copy.png000066400000000000000000000015011300045745200212260ustar00rootroot00000000000000‰PNG  IHDR szzôIDATX…­W¿kAþfvŽ !……ÑBQÁÊ‹…H•CË€"xØhc› …Xø/!)´°WB°H!B$……r‚D"b D ‰wûžÅîìÎϽۋ6Ù¹™›÷}ßûÞL"Þ.´œAEpñ#ûÅúãcû­1•ó]•'oW0“å“áäyRg¬×¨ÌGb¬Çì%$D€Ëª>kŽ²¦*ÿ›ußc€É BBª±êÄDè÷vÙT‚Å&#Ù¹Û/1qðd¬Bù:ÆÖÆ;|^›ÇŸ_߆dm€e@­Qþ JB:q—î,còøNDŠ±fKqöäŸ ¸µvcmñ<úw¡JJM ¥ÔsxŒµ9¯¢w"Mû b@DÒ³A$Hã˜4EÚÛ3q°4K…J ,\¾û ãŽT–†Ò>®>Æ—÷KkK!dc©Y“³ÀÛ”R L2iàìÌ#´®Ìù>Ðe^QÄ(¢LÃqº= bƇ7O"'!C†: ¬@Ü UÑjÏâÔôÍ‚µÛÒ’¥xüLÌ4!¦g†Û‘”åˆ"\›!"i4ýŽ`}u·ÝêÃV€(Åë§üÞ\:|òè®Í=7ÖçÉa—ZY‡âà€Ìl¹ÛöGךyÊ8“n„ÑR&¸zo¥Z{óû.PèP90'C ð¨&@@! ˜’ÄÚ!¬Ï‰R¬,ÞÀöæ×À5Ë8|l û/ŒõþYà H·?õ&[ß?y ¸æô{›óÇ';o”ož¬%WŸÝòTi4'Š ¥LÐyPÓž åIp«©Ì¨áº¿4aÁÚ¿«­w쀭 dQ·À9íŸ{»;Øþ¹^;ù®¥°}Pè– ý50¥Xš¿î·­+¯9°fúVf½=Ùà •0€£ÿg¨P­Ýž67Ýk3±« ²Ž8¹.k3"'á¬ÄƒX»ºåö]]¯Ö%hËlÉtÿ)þâ^O0hIEND®B`‚codequery-0.18.1/gui/images/Clipboard_Paste.png000066400000000000000000000012631300045745200213750ustar00rootroot00000000000000‰PNG  IHDR szzôzIDATX…½V¿OAþî2µ5"(ÆÂJã ­ì, 4Øú'XXÈ_ ‰=„(ÿÐ@B¨´1wö£Pù+1±»›g±;³oÞ¼Ù½ãöxÉÜîììÎû¾÷½÷æGë­uPbä² ¹{JÏÃ{ æ¶Xï˜Üùã2ˆê,_ÔçNÅܽc*™Ÿ‹±›SäÐ I’Õð¬)ÉÚ–”õÝ'¯q³µ øùõ>î¼PYk ¬ß“ÐTY'†C~éú}ÌÜ{ê¿»z{×î<ÊXçï¹Añ3¬Í†!@°œ_y‡‰™6ààÍl¿‡…•M\ž‹$[xö¿O;8Þz4 –^}üúÞÅáÆ*cíÈd‘j–1vΠßïø÷ç›–2€¿?N` è÷zþٕٶ`MÙÈ£á# iÍÍmòyo ÝݵJ­µok.i3¥µ›LL·ØZBë\ïÉ­€`͇ñ%Å(x¸ú>ú*³Œ˜,GÃëšQí×aÜqÔˆ¬pšŠÀHlªR&@æÀHd˜/£¶Ñ<ÃÇ ²ÃÈIP”QqtÖÀr‚ä‚‘¬ùb]&Y‹$$¨2Ô*AÈ:È/²X¥ á$`úÈÅÚØ8º@|J1HÇ‘„ƒpQ@–±uY:ëC‚u|V×eqÈ3©u£ÑhŒäÜwVvàþ‰y ´~ý¥»©[m½-SpIÚÙIדq¬=ð$DÜ0¶_ȵŠ©œKÖ(ò+ª½'„!„²æŽUoN‘4Z&Ëš[¢žƒ5s\ÅZ舊Jëtl%Îtþ÷øT>0B IEND®B`‚codequery-0.18.1/gui/images/Database.png000066400000000000000000000030371300045745200200470ustar00rootroot00000000000000‰PNG  IHDR szzôæIDATX…¥–YlU†¿±Ç[;ûâ—‚B¥@›hÕ°Ä¢ ÔJ€@}AðÄ"@€¨R¨‚²½ðÂ*–‚Ø´¶@Eiš6m¥Mš4K›Õ‰í8qßËC<öÌx’¸’í¹3ãûÿÿ9ç?÷*ûw®Ú \ÍC¦¾~¤v-Ÿ¯¥a.ÒÏ[Õ$øÆ¥è‰X‚%Zƒ'AMsíuYåÿI±6—€ÂDbQfU–ªQ,C¬Ý[LµXŠ€Y5(øuä–×ã+®Æ“Äå-Buû±ÙˆÄ,s3aâѦB}Lb´·™±þ6„”$DŠ¬4ЫF±S~Í}W?ˆÛWºT¦°«.ìÙE¸³‹È)­¡ìÊMÄÂè:ô!g‚‰LT©[HêšÛvPzåK/7²ü¥¬ºõrJkøs÷ó†i‘QSŠMü¥uÿ \?ò/©Ó©–WØôà©Ú~xŽØDßÿŒ÷qðËgIÕB#"@P«ðÉ üñþfŠ+n¤¤òfòƒkpe^ètt”‘žε說ãW„‘é !“ QHΫžâÌï0xj{œÞ|²ò.Å•]„Ó“‹ÍîB‰¹8ñرðá±^¦#c)1ŠÝÁÕ7?Æ‘Ÿv{“z­&.©½‹²Ú»lÿÁS{8ÁtdŒXdlK¥ç SRIyuõ÷àpy9üãNcÖ\ t †Ž†ÄéÉeeýý¬¬¿ŸÄ\œðH‘Ñn¦&Î…˜Ÿ›lª§'¯˜ì‚ä•TáôøR)‰Ç&ªÊd XèoûŽË×=˜ZÄîp‘WVK^Yí¿.Ä3-ߦ€ÍS-û8’“M¯ õSµþQ\Yyÿ`f*ÄѦ÷h?ø‰AyÊŽèR®ÐŸú‹+ènþ”³Ç¾"PuÊ /]ƒg'Ä"£\8ÛBoû>zN617'¯´‚Ñó]†õEf¤áµ[ߢëðGtù‚Þœ=Þ¸à„¬<¼¹å¸}…ؤ„¹Ùé¤ú™Ž†R¹V;•õ›Y}Ë£|øòm)Õ¦"”X¥AuzYuË3TßðçNþÄ@ç†{Ž2 ‹ŒgäSSdW]ëV¯çŠkîÄ›SL|:²°;Zá¤R`z ŸÇéñãôø©X»•Šµ[‘R ë#b6@uxpgà/â/XÍnÜd#¡AcêpT)2UH௯·³áwñøÒ9W¾ü ¾üàEâTx„=¿á Ó¦õf=C! <ÚKãÛ÷Òyøsó³ ¨ùùYÚ~ÎǯÞÃøPB¤qôû–%Û¤d¥ž•pÝæôu죷½‰Îæ/ˆ†‘\Y9¨·%èÌÔý]Ñzà#š>}‘Îc?#„ aËvºNì³:¾õ(Ÿ½T·OJ6Ú+°åùß™Ÿqlï.º7’˜O¤þèöàñãpe#øôщ!¦"£:…Ëj7²þî'ñæñæÓ×[ûU¡«ͧ Ûeon€¶¼ÂêMOÐÝÚHOû~†Î #2©m8éêVlvŠƒ5¬¬Ù@õš;È-ZrEÒ}@˜N°Í»YÕð0Yþbê6l£nÃ6ó³LŒô\°§Û‡/7@^Ée¨WFjŽüÒÔ‚%h´>`¶Ç‘=»Àî nýC(Š-µ˜]uR¨¤ P¹l!J)hþå~ûv—>ì鳧Õz—Z8½úþuζýʺÛ'pùšeõ£¯«…ß¼A_×Ñ Õ)$‘þ€`Ü0`ðïc|ýö6ò•T\µ‰òÊë(,«Êõü\œáÓôž:DGËÏ ÷Ÿ¶V$¡K 3‰…ôŸf¸ÿ4âû7A±‘å+Äéñƒ„™X˜Èä(BS±UëµapùÈdèßúûB #CÖÝm9Õú¡.¥Ú*5FËZYkyÕf­éä"‘¸ˆ¹ÎƆb[hý𬠳ÅþIEND®B`‚codequery-0.18.1/gui/images/Document2.png000066400000000000000000000015641300045745200202060ustar00rootroot00000000000000‰PNG  IHDR szzô;IDATX…­VMHTQþfxæ8æ8á*h!SDB­ ÊUd‹Ün-ZÔ¾UáVbÔ"èvdD¸qQ1šÑÊ@TȈd2­LÏi1ïÞwîߺpgÞ}÷½{¾ïœïœó2ãƒÅA‡‘2XÿTþX]sxm^³±¦d¿ÅÆO¦@¼ÆâM¿ñبµVÏDU™o‰±Z³c,A6«Í³æ kJð¿Yû@~MÛeMÌ. 4 D,xŒvôÜCSë¡P¤Œ±¶º‚‰×1óáy k–,ìYs£Æ Ú‘Ç‘®8Ö¢ŠQl‰"®Ìø¾ö€7ÖÂ=o\Àâüdj¬[vâè¹h?uDŒO¯ïzYK¯d}¬5jÁnqnRì±ÁŽ`f?ŽáգˠõU;¯¢­xÆËZά/>ˆ¤Ä,È=Œø2ýïFÉdÐqöš –ÄÔ`±–“$vãj¦æôû'ZŽ& "Fjj©¡ÖÇ{Fм·Ýß÷ù)Œß¿(j}ò"Q¸13" øf ×P@m¾ÙP×XÐÏ+AJàÒ¨îÈ[Ñ„Âmc·ºÕ6®þZ2îjÇW„*EK‡ ©Vfë4\ €‰°¶\‡&¬½ÈfÍV%ô°ýÚñÀ‰ÞìÚgj@¹úÛÜ^Þé÷¾'YKoDFq°6%µ®kt5 F¾©E4°CLˆCàÙôÅrt¸5¹^QýYYr;gJ;Dú„ÓH±XÇÚrÙQ· Æí] ÀíRæCöA§ûnb·Gðuv Ïn÷é"f°nJ…Ûòäêý¨ojÑéèx`C”' AeïñÐyÔä¼Eå÷Ê`ýð`DDÖ³7 ÷ì/bafL„¿?ËÆ!¶‘B[ò á‹»)BÍÚíÕ’I×¥‡^·WA$$¸l¥]²Ó&Õ\˜™Ø’a˜ÿ\rÂk#‚PJ=î5+™W¬á4ó±fªF2ÞNײ³!ƒ^ü⎣°A˜¥z;¬¥a5Œ,¨Ê: äͲ–#P ·ÀZ®ÆÚPJ°ºÖ¦bm~ÄÈ:2 ô¬ÈtSZ©;IEND®B`‚codequery-0.18.1/gui/images/Flag.png000066400000000000000000000016241300045745200172140ustar00rootroot00000000000000‰PNG  IHDR szzô[IDATX…µ—ËKTQÇ¿÷ÎUóýuHŒ¢(eŠ"ÚD´ˆ’Vm¬m‹hÓ*è/hãªh%-Ú´00H(làeA8fŽ£éŒ£iç×bîã¼î‡v`fî9÷žóû|/¯ÆøPtÀ1 r¿ ?ä\“ÿ\¼&aμû1Ë6~&€Ñ³oêÛF¥¹óŒUTyEŠ9)™á «*_5ùªfA;­ZÁÜ}$ðª:¢·ôäÒ ¬$ãEU3"(‚‹x{nîÁñ«`¦½Îðfx¿Ò3¨k?ˆHße4uEa˜!dSS˜‰=E&9Q¢j–ËQÄT׶¹ÆÀ0LTínG-Lœºö†rï5vôbïÑ+H~~øØ=ü^[ÒôT“iòÆùQrƒ€êÚVÁ¸h räÎÝÁþëÕÔÙç™èØ'.ÞE¸±ŒÌac€å›áÝ:?ªvÕ#zþ6úÎÞB.;špªÃ €™É—Ȧ“ŠG,’B@(à 3T…ú–namkóSËÑâU¡åZ*@7äìwûsŒB¤“Jwn?y¾YY¤`~!ØQ!éäê°ü:ÚË\¼æA %ç¹J#©¨ ¢ØÜX/\3†å¹ dR_ADhé:ŒÖH/ ÃöS[µå´D> º`,Ï}Âøã›XYø†µô!ž­‘>ô_ºƒ=ÝQ½ ¼ˆ¸6M>.n’øxà/³S¯±jw÷0`qv#÷ñöù¶6óÂÞüz+?g;…>ÀDåUÀHP-×4#†¯†ñåý(@]s'¿ObêÃ(6ò9éÏ6×äÔy@èãÜ!*°šIáÝØCµùÀ@ó€6‰´ªù½¤êTû„@ÈÇœº.E5l1&“R vBµà—˜ȩ̈)¥¨æçðö9¢Ü>Ào^_[^Ér«Kð¼U†j€¼wK‚þÀÌBÏ ¢±m@fqé…|ÿÃ)Sµ > %ˆT"Žùéxe±Rm¯s!b¨ÄTlÕÛQÍv†Pêá¤Ô½`´BÕüð鄨æ S-ļ¤Š(+Ö´lÆÄþ©›@sÏOIEND®B`‚codequery-0.18.1/gui/images/Gear.png000066400000000000000000000024041300045745200172160ustar00rootroot00000000000000‰PNG  IHDR szzôËIDATX…­–mlSUǽ»v-{…1†#,ãMq†,¼^L jB$*ñ!&&¿øA?hÂB4DýbŒ$FIÔ„P³"3AP ¤/u³cëZÚÛóø¡íí}k7ˆ'¹½=çÜóüÿÿç<ÏsŽïøÞŽ½ÀBÊ41r/)ü—Ò}û±õUq>¬çÁW•#`%â –Ÿôσ:ú…oôq•?âB_\€ÊA¢$§ªûW-%U«rþoÕ^$”¹NìîGuUcíË_CDè=ù1£ƒ×Q"nBåHèb%PNµƒÈÌ%›˜6ïišÔHÏ—¯NPu¡Ÿó”†s<Vø«©Þa¯ŸÞaohé@Ðr >©m˘Tׂʯ/¨U ”’Ü“7=PJuCë_÷þ`=7/ãÂ;Ñ+k¨ž<Ë$P¡WR×¼€D&OŸË¢5›Mû"bÆÅÅÕôʲÁ¥¬*,Ê5 :ç5ì1§)”ˆ-H®…’‰yjžý$">DÙ× é´ÌYá¹f4~‹Kg™ª­¨«|Zn)Äþ>Gמ§ÔL¥vêVnüÄ4VßÔ΢µoræÈn”(DÀ§é,]·•ÚÉÛ€»÷o¥ÿ$Ž ´Äœ.ªØqN&†ï \ŠY¾‰æöeDzOR¡˜1w…  5v—±B8\opŸRÅÿ>M§sý6O·64µÓÐÔî9WhO½¼ƒ;‘—ˆ¸I`Æ€½PX3¢eÞj›ç—)×UuÌï\_ö´Õl•ÉV±„Xä"F&e3šNJÄ]`™tŠ¬‘¶)¥èÿó XÄÐÜ%2^+¸;4@ÏwQ* ÀÀ•ßØÿÞ3|÷éf£ûÞ`߶µ ô‡sàYƒî¯·½z¾¬Ì: œw¹ü»ïl±h/uSÚè¿ØMÖ002Y뽿bd2|óÑ+ÌZ°š¡Û׈Eû\7)É×0ƒP<3ÀŒƒ}6c©äÉÑ!‚Õ¹;Ajl#“AŒŒÁås?zF|î-Å»¥€®”õðqx§GŠõ¿ë³×yté|šÆ¥Ó‡]ëË©6 PHCq“p^ õ»0½&r%ìOu~ܲTíA²<¨[µ¸ÐÌ-˜ˆêRÅä~U[[‰Jøª-Àã©v 82b<@›ê"i[°•Âÿ°,…Å,"agIEND®B`‚codequery-0.18.1/gui/images/Graph.png000066400000000000000000000022651300045745200174060ustar00rootroot00000000000000‰PNG  IHDR szzô|IDATX…­–[leÇ3;Û¥ô&µviÀv±’R¬"’(Rë­*˜hI°áUã›1Æĉ© ¼ <™Ôh Fð$¨ÅKJ›I mZbhZéívç;>ÌîÌ7³³[ŠLÒî|s¾9ÿÿÿ;ÿsv3[÷ç÷Ÿó!™{ɽöß‹o­¼xŸ•oËG@' –†ƒ§AëÌkIå7¥8³–,@ ‘“@PÕòUKNÕ*[­:Œ„rß?ÿ«Z‰dÊGBÀ@>Õ"7¯Z#+`eå"u*¦EÑŠÕZÜOÌMb'¡€žjñ‘´tðQ½å¹©^û@Ð:ÌNŽòý¡Î%Uëq+—ê,"éç%å1¦¯3Úÿ5JÙÔÝý8•±J+×øîÝûUgðµ˜à—£ÝØv ¸øûÇlÞñ6k7=‹RþwuÕ* F ˜ÞÆì!!J J9D£Å«ˆ•# ”‚H´„â•5€—G)qþ¹½¸“ßR’¿µÂ¦Yie=/}Õ¡ŸQ¶Mm|…%åÞQ/¡ÚË'i„ЫÇÆþ:M݆ꛟBD˜ûwœÅ…9&FûÕ¡î7¦qò½–^Úò©Îv³óùÂ[ý|úfË2TkâàŒ[µ“Ȉú=Ä”™«xUmÎ=ÌÏL’LϯL™9¢Z <øüaV¯ ï÷àµëÕSyã×&Fø¤§3£ÚGÐò -¸¢¼€ùé;…„$.­pöÌL¶A€²Ê:ʪbˆˆþCD'.A ˆaðãGÝÌNgS »g€/Þ}"g­_>0€a˜¾6Ôq,QúÐ 3Z8L«Œ*=tƒH´Ø%)(qÞO&P¢ÒL¬h¡{VA‰ã¥|Œ/÷mìhË°~dïªëïõåìÔÇtbÛ6í/bMÓöÐZO^â³ý»º^ûŠªÚ¸/>1>Ä‘ž:§ t”ÝÖˆˆ0üç1®OÓ´u7¥u˜ÑS3”×4:uŸg¸ï;”m³nc•·7PYwÛ±ª6ŽR6~ý;µHëöÝTßÏò›¬ÀÈàœ;±X\˜§µãw|"01ö7'>ØÃb2øãÔa:öì§qÓc¾<ƒçŽóÓ±wÜö»ÿѽ¦RÚ|N¿hF,2Ï 3ê8Z‹G¬(†õLiDÜzûóD]B¦Uàæñµ¡ëX¼±kjãá®÷Y˜¿F|óάÄ5 t½þ-—.œÆV)îlngeE­ÓjÊëÈ [žÃÀN-Ò¼u‡ÖŠâ’qç@æhƇλk±õ9À©$WGH\ŸC)¹x–xë“D¬BÖß÷´k°dbŽ±Ëç]—#ÖÐJ¼¥€T2Áè¥óî0"g}£¹W -t^X‹ÿË)hààö?÷T»л€o­€an0”€è ®I³º ¯ê’ËU­g.K&a^ÕAЛT­_Ö-S­/¥:H ÏKàïˆåÕÚ#í3[p ï?æ4çÖ6aòåIEND®B`‚codequery-0.18.1/gui/images/Search.png000066400000000000000000000023511300045745200175460ustar00rootroot00000000000000‰PNG  IHDR szzô°IDATX…­V[O\UþöÌa˜2Àt(#·Z+ÒBð6CRZïÖšñÁÄŸLšª`ü>4ÆÄ4šø iÑöÁćFCS« 6A4œb©öÂ}*a¸ Ì9gööᜳgŸÛ¦'Ùpö¬µ×÷}{­½ö!}g[ÎhEž‡ñ?Ú?f¼3÷¹ù™æ4gOH:x{>"G0Ýè ®ƒZ憴­òÿ¥Ø˜3 µp%`Uµ{ÕÌU5ÍGàA«v"Aù:f&°j_0 _IhVEziJ&m"@³ÊG‚ 8€„šÖ8j#ªËùÒ,§1ö[R»P-e€d(v"P£õ¥OQi²ÕñxQYÿ *êb˜þ#?~ʨ+`N53‘”Dpqë½<ñÊVì×í K3CX…§ á†çÕ€‚†'_cÀWÏìHµh—Ü*ü`Û).o,cø»N,Nq xö <Ö~Z'ÇýÛ¿`ö^¿-ÏVÕ¢ÝãÄTò•"Úò²NŒbèÛ,L é ô`YŠ¿ûÏãί]ZJAÓ‘·@)´!¨¦:·évrlŒE¡Ú¼’°01€…éa-°2€QàÖõÏ¡l­Ê£Í(.«ÖÁ˜6,±E2Œkg¢ ðï©áŶ˜LpÕ¦úP2[Xúç&ß…²ª¦mUçÓkÀV±âá$¶öiMˆ‡{øKý]ÖzœT­/Nñ€uO;³×Uy (æþ™Íµ¼ª_«íO¸-©Éß¡Ê›€ÊÚ§9Ðf &ú·¼ð6 ‹ùQŸu$*ÆgFŠ¨x „ —·Òüšç5vü#T?zÌŒx ñø‹ïâ`,ÎÕ§Wç°¾š²ÕŠUµ˜Ò}¦¹—1´›úˆäÑ׿Byõ!°2w‹÷Gá•|ˆìÁ¬°uÈäí~\»øäÌ–íƒDø1pú¼ñc‘“`¨·i6‹ä­„¢‡ EEÁ ”ïkDYä¾íÖ§´²ûŽal¤Š,kàp(Hí·Ioühä$êªJ‰ËX[J¢¨$Œâ’0!l+½‚åÔ¥{M$‚eU¨mlÃØHä̦Uµ‰¹ôAs/ƒžK~̈·ÀÉ^0È™ ¤ÿ!žícÔ:jÛå¹ \úìM¬­¤ì$´÷>µRÍÝJïfºMÎlby~ Ë©I¬¯¤@³ Š¢àÚÅNLÜìµEpâôöDl×3ïîG†™ å9ÛŠ¢àê…Œÿù³DYe Nœ:o¡ß±zìͪÝI.=”1¨Š‚+_vàÞÈO6å‘„£Î;À˜v)P=ÐNUó ÁTUÅ•®NܽÑc" *2fÇmÍHOËÝt»TÍI ~ªªâòù÷ð×à÷4ßëÝŸ`c}5ׄb”(«=ß×Lî4ð^a?VÚPUtw½ÎAÎlbi~†_p†¯qJâÙ·ÝZ¦àÌÐe>—¼Ã׊ :}vªÚ¤+ þ»Yµl<<;RmÍKÀ]µøHLµ¼j+D.€åÖÚa®Åµ" é ñï¸=BeS›IEND®B`‚codequery-0.18.1/gui/images/Text_Minus.png000066400000000000000000000023121300045745200204350ustar00rootroot00000000000000‰PNG  IHDR szzô‘IDATX…­WßOU=3;Ëî²tù±eʯ–¬ÐB˶V[•¨1}ÐTmK±jü|òŇ&¾Ó싾Mµ6AS0ÆHkcš®B*Ð&,µ@ P„n¶,ìÜχݹsïÌìPÑ› ³wî½ß9çÞó}3(—{÷öè€K#þ'w#ã7îË¿Iê3s|X˃w¹‰8‚åÁó –¾1GÛTù–}²2 ‰‚¬ªþ½j*¨š¹ø¿U;‘`|Éþ«jFd'äF‚Dnª…gŠÇ e³[P-%@3" ª”Õ¢íè”×ìˆpÿÎ5ŒôŸA:5Ï«šâpãÉÝÓ©E°Œ¼›ªV½è<þ)‚ ¹ i<‚Øñ^\ù¢‡+z郯Q‰Z­%µåù ô}ŒÕæÒüvY·¬ºõ5\håÕm¨jyÄÆ×ï ÍÇ14¾ÍªEõÝ6èÁÔèÏ ~:wÁ²®™’\šX·ßÁåµ1„"-pei þ’íЊŠáºý(­zK÷Æ°–~ˆG«a”_«!­…Hµ>`¶‹Ð;%)žŒƒé?x_Q4:̓3"s=.‡ØŽ a‚?T'›º8˜ž]Ç_#? ¿ ‘ªk}þm0Fˆ$ʈZHµ±… '¡¨4{{V–±83Š¥Ù1þ\õxÑüL÷¦ª‰çˆª6–D|¡ªPßþ–¤4ÿŽÏŸ¸!ïBSìTo@µɉ3ÆTÓ¦jc°fÏë( „Ló-Ï`.1ăM÷c#³ÊÇ}Å¥hÜÌæ%«jÑwjÎ0$±4Üßx@N½Dü"tF`Œ@ŒY[ÅäH¿4§õð; R\UKŽ@¬Üù,B•<0Ó³HüÞ';œ€[CßJJ·×£vwWAÕV˜™÷¢úèÁ)pr!P$Šm•Q[ÍXMÎ#XúŸ»ç…ÓHÜüEÎy8¿4û[ (©¨CUÓ‰@yU ^yÿ§UïŠ!¼c7¦Çm¬T«S‰€èÁn(ŠúX`NMQt¼ø®ÍpN—fûFó±kß1)`:µˆµæ{Cìq’ >ÔÔq¿öõ"õ`ÁùË<1y`gÇðúJL b¸ôÙ{H.NÙëy># RÛŠ·?<Ï×y4/ÚŸ?…«ßŸu!`¼Ž™ù9Õ|HN½Ù‰!<¸?åP-M‡swG1w÷¦´vïáP…W¯S¥•ê@¸¦¡pdìÚy!¥Ì¢ÅÓQH©?®|%­ ËPÿÔs–s—¿U)'…­€äâîŒZÊ´©Z*·ŒÇüûžÃë ÚT‹ÇÀ³€˜¾ýn ]c:Ö×R¸zñèY&¨–­ŽÖ³Y |ù1Ò+Ë`Œaôú%ŒßøQVm¹+ŸÔ6H„.n.ª§ºž…®3™5,À€ME…êÑ°±žÉYî.KY`×õuÉáN nˆt=Sðÿ ±9V­¨ÓrÕ6Ãf’vbS@éLMÒ"7pÃÿ†Â¬‘ Ú7 IEND®B`‚codequery-0.18.1/gui/images/Text_Plus.png000066400000000000000000000024651300045745200202760ustar00rootroot00000000000000‰PNG  IHDR szzôüIDATX…­—]lUÇ;;K·í¶…–V[h ´¡|(ˆ‚ÒDbxÀ †(â׋ï¾è‹$>i"·'ú‰¢e)ñºG\––Oíª7 ¥Ýí?ºóo\4½Ðм+”oºÙ§Z߉ä˜e0JærjpþŠ×˜•_œ¾¡;ÜënsõtœdzrÔÏ+(¡nÍvß~‹KDŒwÉ CµvX n™zÝíÇp” ” J˜œ¥çÒIcNãÆw äT­“3·@,_øÅåu®aåÄéþó¸ቫ«íˆA dn-ÕK[²ªöâØ¢Ò¨«¯_¿Ç0}ÐMqE=Eåõ¾š1½OaÉ3îÜ/ï¥ûò3ø01Õ·½%W DJk¨lØd˜S¹„-ïäIZÕ¢fÊæ-åÁík>a^–7RE ~ý.ë‰À2µ@ @Óæw}—é²}g´¼B­Þn‹ 0=1¤¿zG€pA1ù‘Rw¨¡i+çŽï'öøAæm ‘y¶RæÀÂ¦× åEÒ¢8ñõ{Dú|§™”%PQÝÈÛv×í«^ÚÍùŸä ¬¢ÒÇ©ÅÌÔë¿ÑÆã‡}êx:ÂEà^o'÷z/kWnÜ¥}z½ié«eóWQ\Vc¹zá°–Ré¢å¦£–RývÈX›_8›Úç^ôì»yn´ŒœÔ\èãfg«§L§UåVàZû)¢î6By…>Õú6¸Y ·¯ÿNWÛQ”r˜šˆqþØç8q¥©6½íÄãœúþ3ÆF†PJÑùÇ ®]ÿpi˜ÁkóPø3'ýƒ›A]ckñHæÿ‹±5–ž€Â"€›Õg-Y‹|7k?ÂÞ'ÅÚˆÌ [šÎè@;cýBJ/ | $RÀzvù&­}“Ø‚Uhšn®‘ ÷Ü!ÕtŒ{É“99EÖ X †ÅØ€¦¬|i?ó«^ñxDÓ4fÌ© zÛ'̯ÚÁåŸ>`l¤?0`Žµt€ÔÕà¶AÌqåÖŽàÃ=-¤šŽÑrù(}÷“Hñ¬…OS³ç0Z(‚PÒ+öX˜¬íy‘7‚>wé ”VîÈΉInÔ$Õt<ǘ[þ<Ïìù‘‰Šgß \8Óf.]¬…P.94Ö¦p´„âyU¤Ç†¸séhö WJ¥€Íèº{ #\Hé²Z3˜Ì^®³U0R€!¤³ô¤„™ehš@Ç 2é1^ÝwÍcD€÷'èJ5/¯ ¤´!ö‘Á¯JÓîÂáv!}cƒy èö8-ö´[á¾Wb~m¸¯)š¦›W…nD9ñi"Uü©õ6€‰Ñ¡lzY+åèm¤düá}­É¬®‘"–oØëÐ_]_Vù"sž\cè¾ÝYz.ÓYF¶æt"«\$ܼpÄv÷²õu¬Ü¸4ÃáðE‰—yn×g¶_¤”tÝûÃEHé Š)­lh§>¯>+%µn¤„UÛ÷Q±vÍîá`]©&3f/L0sÎ'†úÚøõÈ;ôw·z^H”+ƹÐî-ñ:$‹}&io¾€)bVYMÓGŠˆÅ—ñDé ‹J|M‰SžØJë­ßìµµöø'û[*´{s¼NÂb„’Íéh¹DA4FQ¬=”{€N¦Çé¼w…é±ù¶ áÈ4*Vo§íN#ƒÿtzˆ©´ªÏJL ë6›BM7ˆÇÑC¤'Æì&“I³ªömÖmß`b|„S_¿Gksƒ¦¯×Æë¤ÌfÀZ öp5+BÆ1:ÜÏøèbR $´·\!“§liDÈ(`éšm<¸{•ž6?)=¸d¤³ä|ú¸z5ÕÃÅ_Ù•cËQPÈkï~ÅìË}öItßG¦ðö}oIåä±À6žþ–ó§¾ð€(ˆLcIÕ&§¤« ÷»œûÞÏÉ>o8ýBH6îüÐ!GgëMÇ>Ì}†õj䮀À~ŽË>o¨ÿžL&Íæ]£ë!n]=Ãíë¿9@ce@ˆ<ýÚÃ:à?gà¯ä¢E1:þþ¡°¶`>Ž%tx~Ö~ãÞvú{Û¬ÍuŠSdí2„ÒÈpý†ò ŠSbíš@0kõc<6ÖJàG±vHæpUĵV÷ª­˜AÁä¿7íBÀ 3&IEND®B`‚codequery-0.18.1/gui/images/axialisReadMe.txt000066400000000000000000000020041300045745200210770ustar00rootroot00000000000000Free Icons by Axialis Software http://www.axialis.com Here is a library of icons that you can freely use in your projects. All the icons are licensed under the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.5/). It means that you can use them in any project or website, commercially or not. The icons have been created by Axialis IconWorkshop, the professional icon authoring tool for Windows. For more info visit this page: http://www.axialis.com/iconworkshop TERMS OF USE The only restrictions are: (a) you must keep the credits of the authors: "Axialis Team", even if you modify them; (b) link to us if you use them on your website (see below). LINK TO US If you use the icons in your website, you must add the following link on EACH PAGE containing the icons (at the bottom of the page for example). The HTML code for this link is: Icons by Axialis Team codequery-0.18.1/gui/images/logo.png000066400000000000000000000166461300045745200173150ustar00rootroot00000000000000‰PNG  IHDR€€Ã>aËbKGDÿÿÿ ½§“ pHYs  šœtIMEÝ¿ç93IDATxÚí}y|SUÚÿ÷fOš¤mÒ-¥ ¥{aÚ2¬BÙQPTeTDe}TTÔá7¢À¨¨,"ðŽÊ(0: ¼ƒJÙÊ"[in)-IÓì˽ç÷GMLš¥I›BÁûý|î§KnÎÉ=Ï÷<çyžó<'!„€ÅovX°` À‚% –,X°` À‚% –,X°` À‚% –,X°` À‚% –,X°` Àâv/œB@Q”ó/˜Íõ i‰$%t{ÅmC§ÐiÚ ½þ:N:ˆ’’8{ö"jk¡Ñ4!/¯Ö¯ÿ €ˆñvM&ï¿» ,–üøãwØ°a+NŸ.—+DJJ¢¢¢’’ ©TƒêêzX,:ˆÅ,‚ÃXðÉ'+«DZZw$'çA à!""Ž8l„ Ú“NØqáÂ1<ÿük¨¯×¡°°‘‘‘ i„×e6›QUu_ý%ÄâxV²A¢±±±±= ½^Š”ÈÌLÁ¨QwàÁÿ¹<\®øÆ„д6¬ÄÌBjj† )‚L&MÓ`Æëb:ìvTÈÎÎÄï_ˆÂÂÄÅ%¢®®Ë–ý={ÀSO=†«WºäÒép Ù²ÅX»v+ÆŽ ¡Pèz­õÅ0Ì/¿³ Y5S(ŠãšT4Mƒ¦iðù|¨T ÈÎÎFiéYÜqÇxlÜøhÚÒ.„D†±`ãÆ÷±mÛÿ¡¨h°«ÃbÐ.3 ‡Ã†a`2™° h¯!è¾; œã””,X°óçÿ4m ™!gΔ`ùò¸ûî»=Ô»»à !hhhÀÅ‹—`·[ÑܬÀù #Y‰†l2.·þÝyB’’Œ/¿Ü ‡ã üýï«Á劂6ƒ2 !0™Ô˜0a*ÒÒ²! ½T=Ã0¨©©Áå˸ë®"<ðÀÈÊꇂD"‚HßáÙð[Š#44T ..}ûö…X,—ËõI÷«¦¦¯¼òæÌY´q” ( ûö} ­Ö„¬,¾ÇŒš¦qäÈQŒÕë׿ƒØØLÜ Íù^Bì0`µ:põêTV^V«ƒN§—ËX,Bbb}õõPQQQ‹E (¦eMÔéšÑÔ¤ƒD"@jj7 ð;<ôÐD¤¥e@&Kº%µ‡çg¦¡×«QUU‰%KÞÁþýG¡R%¸&Ÿûr`³Ù—×_}õoðx’Ž€­¶ ƒÁèÑ£=:sþ~ñâÏؾý+H¥ª ´ÃaBEEV®\}ûJ!K‘–ÖR©„Øív/ƒÓÝ@j!« Z­W¯V!5U…iÓîÁÌ™³!—'ÝˈÃaÆþó¿˜;w ”J¥‡pj„«W«pôè÷ÈÍ-ê¸@QŠ‹w!22‡ÃkÒh4(,̆L–Ø®ÁmiË‚ÊÊRÌž=<0 jµ ƒáw¿ë…ˆˆ—WáÞoká»ß#—Ë‘››‘H†•+¿@~þ`¬Xñ2 †º[~iàrE¸ï¾G0oÞ h4Z/œa(• ¬YóIøÜÀ³gË£ðx†a`6›!—KÛý@&S=Þ{o ÆŽ}f3ƒöˆ(Ò4í"žór Ûùš»‹äN†a•J…wßý #GÞÇ¿‡Ãa­z.FK|@€Gy ãð ¾BÀçóñãGa0Ô„‡Zp8/«“‘HF×®‡¹zõ(zèa|óM1† ©Têåó:ûò%`w2¸ßך4Í &F »Â˜1S°|ù iË-$âñ8P©b½&¤sâTTTÁn§ÃCwõÒZ@B¡µµ °XBzˆãÇ÷àþû…B¡BFFºGýýÖD°Ûíp8ZÁßýî?FkRR7,[¶3gNNW~ ‰ZÂÅ­ï?N³Ù7P(zmò8;âr¹¨«k€Ýnƒ(È;ƒ¿Å¬Y/`РA¯Ölv0‡Ã­V ­¶ :V« Ã@(B.—C&“º>§/ÁÝHR*Ø¿ÿ(&Mš…M›VA©Ì½å@Ó4®C"‘º…Ü=/£Q(‘p8h—¥ÝÚ»~½v;”•}âÄ^Ìš5wÜ1ÈÇžÁ¯FžÃáTWWC­V#'' C‡öF~~.T‰qˆ‹EQ¨©©ÆÅòË8qüg?~/^EBB„BÏv‹DBœ>]ŽéÓŸÆ—_n‚XwKyzýu\¿Þ‘HâSø„ˆÅQá!€J ³Ùìs@[T.ƒÊÊ“P(R¶S]} <2Þá1ó[/1„0¸t©|>Á”)÷bÊ”{ à@A·è>ò‹™ž†áÃÒŒƒ^oDMM>øð lÛ¶ryx<ž_ïA àãС2,\øV¬-„z³qäÈ!…BŸ³ß©™‚¶c2AÙYYéhl¼îÓÀjq;¢qüø逮žÅrÏ<³¹¹=ýƹív;ŒF#Nž,ßÿ<»¿_…gŸ‡8% ‰ÈÐ`œ{KTËEÐò?ÆY…œ¬h¼÷÷§qèà—4¨uuu®€‘¯M«ˆ Ö®ý6o^uKi€“'ÏA"ûÝ…‹Eàñ¸'!iiù Ä·ð†L&Ù3´bǺu@£1A$y¨}w7®¦¦„˜ñÝwëðè£Ã -BGh‚árh$w`ͪç±~ý2èt:—±õ²£T*ðôÓoàÊ•#·ˆhŹsàóù>µhK(9\.¯ã ( ÑÑ2õß}@…B!**jüzUU§°jÕfdd¤{-N˾²²}údã‹Ï—"%IÐÚQàrÆï…öü/ÚËpÿÏ`þü×`·»<L& *+«Ù+ñοp.Û|>/Ÿï¾;½¾¦Ë ¶¶|~KbŽÑh„Z­†V«…Ùlö„PÈ J£½DDÄ ==f³ÙçF ŸÏ‡Áà{Þ¾}/’’’<6lœd¨«ScâıGrn¨ÿMh``ÿtôîçaE»k„sç.A­®î²hɈÒáÚµk^cYAgEq‚Ÿ=|dfv‡^¯÷«œá[0jqêT9$±—ç@Ó4êëÕ˜:e,@ßغŠ¤ràþûï‚ÅbõØðrÚB¡;vìì’Âw8ô°Zí°Ùl~ï0 wÐí…”ž••ƒÁàs“…¦=׻ݎ†­Ï͆a••Š¨HaÈAžðì¤0˜øÇÑ0 6€sÃÉb1ãرÓ]Ò i ÌfkûÎ!@RR‚Ëj½žÛlVW‘H‹šªÿÅ3pxE zöÌF„ìf 0…Ø)ºwOrÍþ¦¦&hµZ—«¨¨‚ÉTߣ€$`µŸÏƒB‘Ð9èÖ-6›Ýg¢†ÉdFBBœ›¥z2™ÔËòw8hjÒ!777³dH à#9YƒÁ€ÆÆF/•ªV7tɲ6‡0ÆŸÔ€¼P˜Çã‰ÁáP> Bx<’“{º|Q¦Éµ[Õ:„¬×ë‘”œpS5¬XÄEBB¬Ërn–XA×#€@°Ê::Z.·@Q 5hÚw,=.N€ë²è­V+( >·{- ä2éÍI®ÀÄÀjë¢yƒ”Jÿûü"Qhq„Tvñb9Äb‘WbMÓÈÌL…Túkì™Ëå¦}W°p8ØlŽ›½šú ]ÿªj»îé9YYi'jHKJ(7ÿôÓQÈå2¯0°F£Å˜1CÀáüš€)…Åbñ¹$‹q­¡ñ¦8®nB¯×ˆ{Hº, îï÷5ƒÁ’ít(¸¹¹ß_ @à#gÆÔ©z¨ÌîÝSÑܬw~ÜI  qñÂeÜLØíV\¹â?ØÒZz#½€ŒŒB¿Ë@EÅUWz^Ø@ÓV|øá»hhhòòL&3¦N½r¹Òc ))<ÇgʲH$©SgA;87mívÎœ¹è÷žîÝ“ t½#mZÂÙ Ü{ï(Ÿ¯›ÍôRÀq”Ö`34šKX¼x>V­úd2©Wz8‡Ã`áÂyêß™Dý h¯àÑ™3a0ÚnŠ'Hq)üß³UeVVwðùQèŠàrŘ7ïi¿¯¿ýöÇ0ÕAiÞ¯³ÜŒÍ›WÃfkP}}#ΫÀáç@Ó@TT¤‡ëGÓ4®]kÀgŸ-CLL®5T=’påJƒ‡×à$õk”¹ŒÑ#Óo¸;H;8Øü¯ÿ¼gØ°èÊÈËëiÓîÃ?ÿùµ×k”bñâW±xñ눈PÌÖ¦H  Ñ\ALL222ðx|=g÷Ëáp@£ÑâÅgcîÜ—ýfÓ®^ý&Þ}w“‡áè^î•——†Ïÿ¹<îdAÚŽÔÔ¡~ý|>Ÿ‡úúJDEuëÒ‰¢55'PP0ׯký‹}ñ—¿ÌÀˆãÁãqÀáp@Q€D¢pÛÈqªl½¾ÑÑJÈå2Èår`Cë£_´Ú&<õÔC…ãÇ߇æfG8ؽŒkß¾C8{þ@Ý8Ð Ë–m ä5j°‡MÓUÑ­[!>ÿü}¿¯ÁÄ‰Ï 66¹¹}Яßôé3Ó§Or=Ç}Ýn­ª[BÀ0 ¬V+ž}v:^}õí6óè•Ê$ôéÓÓe´Î^‰ŽŽÆ /¼‹Etc‚.P~Iƒ•+7¼mÆŒ a9çàF³#G>ˆO>YÚÆ}@]Ý5œ?_ *pêÔß^€¯¼ùÖiGb±=z¤5;„BfÍšˆšš:Ÿ¥å„””œÄ†ìC8j¶”Jq0ó‘®@–/$%© —GbãÆwðé§ËñóÏ ×Wû5”o¶GÀáˆ0}ú3øàƒÅíjƒç¾6ú+2pZË„X­6<ýôbðxL˜ð8ÿ¡Ç†Þƒ´´5Ðë->‰)ÇË/½^=ó0dˆ  ;Gø4MáåWVáСãïÕju7nf+ -šƒ)Sæ€Çw9p¹"<öØhµ¼òʲöEù| ŒF£+[×iìµÞΉD‚I“žÁîÝ_ÔEA&KÄ‚C­®÷YËNT*Åĉ£´´  $aÖ hšÂÿ[ºï½×ö¡ F£wFð… ˜>ýðÀ÷ ªêX—ÓÅàðáÿâ­·> ý½Î#b,–<ÿüü† ›ÍÔýùùY(+;ïI€Ö°Ù´°ZM¸r¥/¾øW””œŸÏCmm­Ç}ýû`ïÞHjƒòò݉Dâ·b—a47ëñä“S±è姡PÚAí©  i.Ný\‹3àäɳaô™3ÄÒ¥‹×릞=T^~}ûŽN§ú=ýû磤¤Ì5CÛ„ÉtLŸþG‚_êr[_}ôz­ÐäóÏß#‘‘‘$))‰$''“ÄÄD’˜˜HT*‰'qqq$&&†ÈårÒ#-•¬Y³”4iÆq‚ú0aì‡ qø»Ja‡õ©¸´<>{ªßÏ®«[·x²{÷gÄá0†aÈÃ0Ä`¨%ýúåûý|R©„<þød²cÇzR]}Š\»VA+‰ÑXëjÁv¨VŸ"Je”ÏŽRRº®:à 0 Cìvyíµ¹$22Ê%ø„„—ðcccILL Q(D¡P>_@RS“ÈSs&{ö|N®7“fÝab2%fãqb2#ýÒ¤9D®^9@Ö~¼”Œ;²Óßúš7ï¢××ÜP8&òúëÏúýLEEýHuõ bµê¶ƒàg#sæ<ì·ÃmÛVÅZ»ÝDæÎAd2™KðîÂW*•D¡Pèèh¢P(ˆP(tõÁãñHNN:9r¹ûîádôè"Ò¯_‰i—àø|ÉÌìä䤓cÇöÜ0mP]}œðù<ŸŸ%99‘¨Õ'ƒj¡tºeË*¿0mÚ}„¦ÍA“ॗæ±XBbbb\—R©$ÑÑÑ.á‹ÅâN›µ"‘ˆlÛ¶ŠÜyçරdÉóÄ`¨ít,\ø„ßÏðþû¯ÝNH8wn¿ßN³²z­$xÿý׈X,&J¥Â¥öJ¥&|•*žœ8±‡BÈ›o>ööìMΟ/& címÐÜ\ErrÒýö¯Vÿ~0 CÔêò€~ýú匇ÃDØB²²zˆ)‰ŠŠ"QQQD.—wšð'O¾ÇC=ÖÖ–@ö~>Y½ú¯Än7…‡ýöÛ£G Ñéª;GTWŸøÐ/ Ù’%„­¶œ¼ðÂl"‘HˆL&ëÁ§¥%“­[?ò!;Y»vI§nܸäÊ•#ÏÛQ¬_¿Ôoýúƒ¡®spìØö€»gÏg²j+*JɬY^ËþpX®ÌÌîdåÊWIssµO!8—£+^î4Èå2²yóûaÓÏ=÷˜ß¾ ($Fc'à›o>ø [·®‹{£VŸ!o¿½€ Ü·]£ S¦ÜKvî\ïWð¾Hðßÿn!))Ý:Ó§Op-?ÑS§Ž÷ÛGïÞ=C2BCJ ¿téj››.áHwŠÏÃüùoaÎœZzìß¿ %%e¨¬¬BU•z½F£B¡b±ññ1HJŠG¯^Ù1¢JàrÅ^õÿ6T† ™€£GsðÒKoâã¿{ÔîÿØŠ={Š±qã2Œù`»¶œív-Ìfÿ…¡:>´Š¦P˜÷Ä“2ü›oÖvªëCÓfb4Ö½¾†47W“ææjb0Ô“©Î§mÑ^Øí&²mÛ*¿¯ð%MM—Bþlfs=7ndÀèŸFs%üK€ÑXK†ð¡víú”Üp¨¦æ8yðÁ»:YYiäèÑÝÄn>xd±\#÷Ü3*`»UUeA?kÐyÙ6›'Nüðžèh9n8—‹ÄÄB|ñÅVlØðv§|ëé… •èÓçXºtL&uK¤"‘ à=¥¥?…žÐjk/£©©¹µ ÜnàrE˜9óyœ:µÆ ì”>-ZQ£ÆáüùŸ@HàšD/²ÍóÿJJŽ‡Ÿ{öì ܇‚PqÛ Epž>;vlÃòå/uJÉXIÉqäçÇš5Ka³5¼W& <Îeeçƒ>¾?Èï °¢´ôdÀ{BªK¿!ÇãÙg¡¬l/òósÂÞ¾ÍfÇSO½Š Dmí ¿÷©TqÛ9~ü ¬VKø`2]GYYऊôôTðù·7ZÜE1zõ†ââ½xñÅ';¥Ÿ;ö¡oß1¸|¹ÔçëiiÉß__߈ÆƺðÀf³ãìÙKm b± ¿DD$à7VàÀ-HMM {ûuu×ð§?ÍÉä]âÕ»wA›ïß·ooø ÑÔyœæ ={fá·gð¨¨hŽÝ'ž˜ö>Š‹`×®¯=‚X-…·Ùm.·¥¥eá#@YYÛVeAA.~kp F©ÌÁ¬Ã×_¯RÖ>6mú cñè“Ïç!=½{À÷•—_…Ù\TW·ÝPaá[ö«ØÂå.Ž?'OîÃĉw‡­Ýsç*`6{z"‘8à)!PYY‡ƒ 4møÿ-ÀoéËý °iÓlÜø$’Ž§·œ^æ9±øüh¤§6kjÔÀ ‰¾Š%Ü‘‘Ñ,~Õ3f<‡S§öcĈ;:ÔVrr¢Ïoþ((ÈkÓpoËn )©©‰‹ãYÉ· õèÑß~û5V¬XÔîàѨQw@$Šõú¿~½ƒÐæð ­ÈSB‚7õħ. ‘(s羄²²}mÎÚÖP*£1{öã^ÿ'„@¥ÊlÓ0›uá!@VV€¯clü–µAKðh(Š‹÷àå—çýÞ߆B‘é³MƒnÝ +qc0[†W® ¸ý8fÌPb4ÖÝðê˜[q›Ùn7’ƒw¬¬4¿ã)“IÉ¿ÿ½:`Ass ÉËË (—ÆÆÊðäèõÕä÷¿ï°³¶„5ññv‡^_CV¯~“Œ3”¤¥%“ääDRTÔ¼öÚ\¢VŸ 8– í¶ŠÄÅ)ýÊ£{÷$W:\XBV¬x) ”Ê(òÛ\‰,‚K:±Z¯ÿ’áTãQ³×¶oœŸ9uêø  uì‡ÕéªIbb|›Y.“&#?ý´•45U£±Î•®Å"|¤©¨(!IIª€rعs}ø³‚¿úêàÓbIQQ?2vì²dÉs„+ÁWU“O?]Fbc•Ç>??—èõ5AMº*ƒìv™3gZȹoÇ$&“š•`°Z›É… ‡Hqñ—䫯>$óæ=J²²z5ÞÛ·¯ëœº†aˆÉtŒ;"$ Æ ThµWÛ•húøã“CJ2å„êӊűشi-&O¾‡uò;î_h, r±téëàñÄ¡Ÿ "#3ðé§ÿš5…H$b¥ÕЫW6vîüÑÑ¡åe´{/€ËaöìQ^~Ï<311öÁ +¡NÄ´i÷cÿþ­P© Bs¸*vtºjòß’¹sg?üaéÖ-ÞÍ@¬Övauuƒ(|M#[¶|Ô¡¢S¿§„µƒH®uÇl®‡Ýn‡ÝNÃj5€Ë">>ƒª!@­¾•*ÃçÑСýñðÃ÷aôèû “%v蔲° Xr°&S¦L™ŽÈH)TªXôꕃAƒŠ£‚Tã*|íè¸Þ°h/„)e#üF ‹ÎmЋß8ÅX°`Á€K,X°`Á€K,X°`Á€K,X°`Á€K,X°`qãðÿ¨óÚts¦ß¾IEND®B`‚codequery-0.18.1/gui/images/logo1616.ico000066400000000000000000000021761300045745200176120ustar00rootroot00000000000000 h(    ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿûûûÿÚÛÛÿïððÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëììÿº»»ÿðññÿÿÿÿÿÿÿÿÿŸŸÿLOOÿÒÔÔÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøùùÿÑÓÓÿZ]]ÿvyyÿûûûÿôõõÿILLÿ©««ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÛÜÜÿ`bbÿACCÿ¢¥¥ÿACCÿìííÿùúúÿRTTÿœžžÿÿÿÿÿÿÿÿÿûûûÿüýýÿÿÿÿÿùúúÿ«­­ÿ+,,ÿÿ\^^ÿ•˜˜ÿMOOÿö÷÷ÿÿÿÿÿqttÿ“••ÿõööÿ—˜˜ÿVXXÿ_bbÿ¬®®ÿvxxÿ ÿÿŽÿöööÿ¦¨¨ÿdffÿþþþÿ¾ÁÁÿ\__ÿÄÆÆÿ†ˆˆÿN\]ÿ‰ª¬ÿz˜™ÿ,45ÿ ÿGIIÿÆÈÈÿþþþÿÿÿÿÿàááÿLOOÿ‹ÿ¢¥¥ÿceeÿ¹»»ÿZbbÿ´ÞßÿÎÿÿÿÏÿÿÿ‡¨©ÿ?BBÿçééÿÿÿÿÿÿÿÿÿÿÿÿÿÖ××ÿPSSÿ¤¦¦ÿÿÿÿÿÿ{~~ÿmxxÿÃòôÿËýÿÿÍÿÿÿ£ÊÊÿGKKÿðññÿÿÿÿÿÿÿÿÿÿÿÿÿ¢¤¤ÿceeÿþÿÿÿüüüÿ…‡‡ÿ›ÿ{€€ÿŸ¿ÁÿÈùüÿÃóõÿj€‚ÿvxxÿýþþÿÿÿÿÿÿÿÿÿÿÿÿÿ°²²ÿRTTÿôôôÿõööÿ€‚‚ÿÅÇÇÿÍÎÎÿx}}ÿu„…ÿeqrÿhkkÿÞßßÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÂÄÄÿUWWÿíîîÿýþþÿ«­­ÿŽÿãååÿèééÿÃÄÄÿÇÈÈÿïððÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿãääÿsvvÿŸŸÿýýýÿÿÿÿÿöööÿÌÎÎÿéëëÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿóôôÿÜÝÝÿùúúÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿcodequery-0.18.1/gui/images/logo3232.ico000066400000000000000000000102761300045745200176060ustar00rootroot00000000000000  ¨( @   ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþþþÿþþþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþþþÿãææÿº½½ÿØÛÛÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÊÌÌÿgkkÿšžžÿèêêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýýýÿ¤¨¨ÿ*--ÿÿ‡ŒŒÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿµ¸¸ÿÿÿIMMÿâääÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÁÄÄÿÿÿmqqÿÉÍÍÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ÷øøÿåççÿëííÿÈËËÿVZZÿÿ}ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿswwÿÿ€„„ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÙÜÜÿdggÿ#&&ÿimmÿõööÿ±µµÿÿEHHÿ÷øøÿÿÿÿÿÿÿÿÿþþþÿ`ddÿÿ„ˆˆÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿùúúÿª­­ÿ,//ÿÿÿ ÿÅÈÈÿ¡¡ÿÿEHHÿ÷øøÿÿÿÿÿÿÿÿÿÿÿÿÿw{{ÿÿ_ccÿýþþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâååÿnrrÿ ÿÿÿÿ+..ÿÜßßÿw{{ÿÿbffÿþþþÿÿÿÿÿÿÿÿÿÿÿÿÿ¡¥¥ÿÿCFFÿö÷÷ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüüüÿ·ººÿ7::ÿÿÿÿÿEIIÿÇÊÊÿüþþÿ[__ÿÿ““ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÇÊÊÿ ÿ8;;ÿñóóÿÿÿÿÿÿÿÿÿúûûÿÒÕÕÿœ  ÿ‚††ÿŽ’’ÿ»¿¿ÿïññÿÿÿÿÿëííÿ|ÿÿÿÿÿÿƒƒÿêììÿÿÿÿÿûüüÿVYYÿÿ²¶¶ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÖÚÚÿÿBEEÿõ÷÷ÿÿÿÿÿçééÿz~~ÿ ÿÿÿÿ ÿEHHÿ·¼¼ÿcggÿÿÿÿÿ9<<ÿ¹¼¼ÿüüüÿÿÿÿÿÿÿÿÿÿÿÿÿpttÿÿ³¶¶ÿÿÿÿÿÿÿÿÿþÿÿÿýþþÿ¬°°ÿ ÿy}}ÿÿÿÿÿêëëÿ`ccÿÿ#''ÿTefÿp‰Šÿdyzÿ.88ÿÿÿ ÿÿÿÿpttÿãææÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ»¿¿ÿÿZ^^ÿÐÔÔÿíïïÿÈËËÿkooÿ688ÿADDÿÜßßÿÿÿÿÿŠŽŽÿÿBJKÿ¦ËÍÿÊûýÿÍÿÿÿÍÿÿÿ¼éëÿavwÿÿÿÿ588ÿ«¯¯ÿùúúÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüýýÿ~ƒƒÿÿÿ…‡‡ÿ¯³³ÿ577ÿ'''ÿv{{ÿùúúÿâääÿGIIÿ477ÿ£ÆÇÿÍÿÿÿÊüÿÿÊüÿÿÊüÿÿÌþÿÿÃñòÿBPQÿÿtyyÿêííÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðññÿY]]ÿÿ?BBÿ¡££ÿïððÿÏÒÒÿ‚‚ÿ133ÿ±µµÿÁÄÄÿ9::ÿ_lmÿÆ÷øÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÎÿÿÿˆ¦§ÿÿ]aaÿýþþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿŸ££ÿÿ„ˆˆÿöøøÿüýýÿÿÿÿÿÿÿÿÿÔØØÿ:<<ÿnqqÿ«°°ÿ???ÿu‡ˆÿËüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÍÿÿÿžÂÃÿ ÿGJJÿøùùÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿcffÿÿ¸¼¼ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÖÙÙÿCEEÿ^aaÿ¯µµÿLKKÿn}}ÿÈøúÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÍÿÿÿ‘±²ÿ ÿZ]]ÿûüüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿûüüÿUYYÿÿª®®ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÃÃÿEEEÿehhÿÑÖÖÿacbÿY]]ÿ¯Ö×ÿÌÿÿÿÊüÿÿÊüÿÿÊüÿÿËýÿÿÇ÷øÿYijÿÿ“——ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþþþÿhllÿÿƒ‡‡ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¢¦¦ÿJJJÿx||ÿõ÷÷ÿ”˜˜ÿVVVÿp|}ÿ¶ßâÿËþÿÿÌÿÿÿÍÿÿÿÄôöÿ~—˜ÿ !!ÿ799ÿÛÞÞÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ‰ÿÿaddÿûüüÿÿÿÿÿÿÿÿÿýþþÿ’’ÿRRRÿ”˜˜ÿÿÿÿÿãææÿz||ÿYYYÿdklÿ†œÿ™¶¸ÿ¨©ÿ_mnÿ,--ÿ-//ÿ©­­ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¬°°ÿÿQSSÿö÷÷ÿÿÿÿÿÿÿÿÿýýýÿ““ÿ[[[ÿ¨¬¬ÿÿÿÿÿÿÿÿÿßââÿ‰ÿ^__ÿRQQÿJJJÿA@@ÿ9:9ÿQSSÿ±´´ÿûüüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ®²²ÿ$$$ÿ_bbÿùúúÿÿÿÿÿÿÿÿÿÿÿÿÿ³··ÿcddÿ„„ÿÐÓÓÿñóóÿÿÿÿÿõööÿÉÍÍÿŸ££ÿ‹ÿŽ’’ÿ¯²²ÿäççÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿáããÿ˜œœÿPSSÿ///ÿ§««ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïññÿŽ’’ÿeffÿaccÿ©®®ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþþþÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿº½½ÿ?@@ÿIKKÿ“——ÿõööÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîððÿµ¹¹ÿ‘‘ÿº¿¿ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿãååÿ¹½½ÿÚÜÜÿûüüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüüüÿüýýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿcodequery-0.18.1/gui/images/logo4848.ico000066400000000000000000000226761300045745200176330ustar00rootroot0000000000000000 ¨%(0` $  ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïññÿáääÿóööÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíððÿÀÅÅÿ˜žžÿ´ººÿýþþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿž¢¢ÿ$((ÿCGGÿ‚ˆˆÿÝááÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýýýÿ·¼¼ÿAFFÿÿÿTZZÿùüüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ””ÿÿÿÿ599ÿÄÊÊÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ²··ÿÿÿÿÿ`ggÿúüüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÅÅÿ\ccÿ)--ÿÿÿ;@@ÿãççÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäèèÿ6::ÿÿ ÿ^ddÿ®µµÿ×ÜÜÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøúúÿâææÿêííÿþþþÿüýýÿÛààÿLQQÿÿÿ”››ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿª°°ÿÿÿKPPÿðóóÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ×ÛÛÿgmmÿ&**ÿ5::ÿ¢¨¨ÿüýýÿÿÿÿÿ˜ÿÿÿ_ccÿýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ‡ŒŒÿÿÿdiiÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøùùÿ§­­ÿ-11ÿÿÿÿÿÌÑÑÿÿÿÿÿ‹‘‘ÿÿÿV[[ÿûýýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿˆŽŽÿÿÿIMMÿöùùÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàääÿnssÿÿÿÿÿÿÿ¢¨¨ÿÿÿÿÿfllÿÿÿ_ddÿýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ ¦¦ÿÿÿ,11ÿåééÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿúûûÿ´ººÿ7<<ÿÿÿÿÿÿÿÿÄÉÉÿøúúÿEIIÿÿÿ~„„ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÅÅÿÿÿÿÏÔÔÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿçëëÿ|‚‚ÿÿÿÿÿÿÿÿÿ‹’’ÿûüüÿæééÿ,00ÿÿÿª°°ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâææÿ'++ÿÿ ÿ¾ÄÄÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýþþÿÁÆÆÿCHHÿÿÿÿÿÿÿÿ:>>ÿ·½½ÿûüüÿÿÿÿÿÚÞÞÿ ##ÿÿÿÏÔÔÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿõ÷÷ÿHMMÿÿ ÿ°¸¸ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿöøøÿÛààÿÀÅÅÿµººÿ¾ÃÃÿÚÞÞÿõ÷÷ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîññÿŠÿÿÿÿÿÿÿÿÿpvvÿâååÿÿÿÿÿÿÿÿÿÿÿÿÿÕÚÚÿÿÿ-00ÿèììÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÿÿÿellÿÿ ÿ³¹¹ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòõõÿ¬²²ÿSYYÿ!$$ÿÿ ÿ ÿ""ÿMRRÿ¡§§ÿîððÿÿÿÿÿÚÝÝÿRWWÿÿÿÿÿÿÿÿ/33ÿª°°ÿøúúÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÞááÿ$''ÿÿ:>>ÿïòòÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿouuÿÿÿÆËËÿÿÿÿÿÿÿÿÿÿÿÿÿÚÞÞÿaggÿÿÿÿÿÿÿÿÿÿMRRÿÅÌÌÿ^ddÿÿÿÿÿÿÿ ÿbggÿÚÞÞÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñôôÿAFFÿÿ144ÿéííÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿóööÿKPPÿÿ266ÿæêêÿÿÿÿÿÿÿÿÿÖÚÚÿJNNÿÿÿÿ %%ÿ?KKÿN\\ÿAMNÿ"''ÿÿÿÿ $$ÿÿÿÿÿÿÿ&))ÿ¢¢ÿôööÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ‹‘‘ÿÿ ÿ¦¬¬ÿûýýÿÿÿÿÿÿÿÿÿüýýÿåççÿÕÚÚÿ••ÿÿÿŒ’’ÿÿÿÿÿÿÿÿÿëîîÿZ__ÿÿÿ'++ÿu‹Œÿ²ÚÜÿÇöøÿÊùüÿÇöùÿµßáÿy’“ÿ##ÿÿÿÿÿÿÿÿTYYÿÏÔÔÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿçêêÿHMMÿÿÿZ__ÿ|ÿÙÜÜÿçëëÿY^^ÿ8::ÿ&&&ÿÿdjjÿîððÿÿÿÿÿÿÿÿÿ—ÿ%&&ÿ ÿ266ÿšº»ÿÌüýÿÌþÿÿÊüÿÿÊüÿÿÊüÿÿËþÿÿÍþÿÿ¡ÅÆÿ'..ÿÿÿÿÿ(++ÿ••ÿïòòÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÏÔÔÿ&**ÿÿÿ ÿ·¸¸ÿâççÿBDDÿ(((ÿ(((ÿ022ÿ¶½½ÿÿÿÿÿÿÿÿÿçëëÿOSSÿ)))ÿ***ÿ‰¤¤ÿÌþÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÍÿÿÿ‘°±ÿÿÿÿ¥­­ÿàääÿýýýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýþþÿ˜žžÿÿÿ ÿ ##ÿ¾ÀÀÿïññÿƒŠŠÿejjÿ>@@ÿ(((ÿJNNÿÖÛÛÿÿÿÿÿ¾ÃÃÿ9;;ÿ0//ÿOYYÿÀíïÿËýÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊýÿÿÆõ÷ÿGTTÿÿÿ¤ªªÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÁÆÆÿÿÿTYYÿºÀÀÿÐÕÕÿòôôÿÿÿÿÿûüüÿøùùÿÂÇÇÿADDÿ'''ÿu{{ÿüþþÿž¤¤ÿ999ÿ655ÿxÿÌýÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÍÿÿÿ|•–ÿÿÿtzzÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿûýýÿbggÿÿ ##ÿÕÚÚÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿúüüÿqwwÿ,,,ÿACCÿÜááÿ——ÿ@@@ÿ;::ÿ¨¨ÿÌÿÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÍÿÿÿ‘±²ÿÿÿaeeÿýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿçëëÿ/33ÿÿ9==ÿîòòÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ‚‡‡ÿ222ÿ466ÿÂÈÈÿ•œœÿFFFÿBAAÿ‹¥¥ÿÌÿÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÍÿÿÿ®¯ÿ ÿÿdiiÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿØÜÜÿ!!ÿÿ599ÿíññÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿúüüÿv||ÿ999ÿ799ÿ¸ÀÀÿ«°°ÿLMMÿJJIÿu‡ˆÿÊûýÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÌÿÿÿu‹Œÿÿ ÿ‚‡‡ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÖÛÛÿ ÿÿ$''ÿàääÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðòòÿdhhÿBBBÿ<>>ÿ¼ÃÃÿÏÔÔÿWYYÿRRRÿY__ÿ·àáÿÌþÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿËýÿÿ¾êëÿ@IIÿÿÿ¶»»ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿßââÿ-11ÿÿÿ¾ÃÃÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÙÞÞÿTWWÿJIIÿEGGÿÊÏÏÿô÷÷ÿvzzÿXWWÿRRRÿ}‘ÿÇ÷øÿËýÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿËýÿÿÊûüÿz‘’ÿÿÿCGGÿéììÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíððÿDHHÿÿÿ—ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¿ÄÄÿQRRÿQPPÿSVVÿÙÝÝÿÿÿÿÿºÀÀÿ[]]ÿ]\\ÿUWWÿ…œÿÁïñÿÌÿÿÿÌþÿÿËýÿÿËþÿÿÍÿÿÿÅóõÿƒœÿ*,,ÿÿÿŸ¤¤ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿùûûÿaeeÿÿÿtyyÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¨®®ÿTTTÿUUUÿdhhÿìððÿÿÿÿÿ÷ùùÿ“˜˜ÿ\\\ÿ^^^ÿVVVÿjvvÿ—³´ÿ±ØÚÿ¼åçÿ³ÛÜÿ˜¶·ÿ_lmÿ.//ÿ%$$ÿÿkppÿòôôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ‡‡ÿÿÿbffÿüþþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿœ¡¡ÿZ[[ÿZZZÿzÿøúúÿÿÿÿÿÿÿÿÿîððÿ’’ÿ]^^ÿ^^^ÿXWWÿQQQÿSVVÿQVVÿKNNÿ===ÿ444ÿ0//ÿ)**ÿhmmÿäèèÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿŸ¥¥ÿ!!!ÿÿ`ddÿûýýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¤ªªÿ^__ÿ___ÿ‡ŒŒÿüýýÿÿÿÿÿÿÿÿÿÿÿÿÿòôôÿ§­­ÿhkkÿZZZÿYYYÿTSSÿNMMÿGGGÿAAAÿ999ÿEHHÿ‘––ÿíïïÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿŽ““ÿ&&&ÿ ÿ|ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÇÌÌÿceeÿgggÿmqqÿÒ××ÿüýýÿÿÿÿÿÿÿÿÿÿÿÿÿýþþÿÞââÿ¦¬¬ÿ}ÿgllÿ`ddÿ`ddÿossÿ˜žžÿÖÚÚÿüýýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëííÿÉÎÎÿ•››ÿ@CCÿ,,,ÿ133ÿÀÅÅÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿóõõÿ…‹‹ÿgggÿhhhÿillÿ†ŒŒÿ±··ÿüýýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøúúÿìððÿåééÿêîîÿ÷ùùÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¤©©ÿACCÿ;<<ÿ666ÿ122ÿˆÿøúúÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÝááÿ{€€ÿfggÿihhÿ_^^ÿx~~ÿ÷úúÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¡¡ÿ;;;ÿABBÿLOOÿ–››ÿòôôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæééÿ¡§§ÿw{{ÿehhÿˆˆÿùûûÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÇÌÌÿ’™™ÿ±¶¶ÿÜààÿüýýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþþþÿðóóÿÛßßÿáååÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿcodequery-0.18.1/gui/images/logo6464.ico000066400000000000000000000410761300045745200176220ustar00rootroot00000000000000@@ (B(@€ @  ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÇÌÌÿ¢¨¨ÿÂÉÉÿâççÿúûûÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿô÷÷ÿÌÓÓÿš¢¢ÿx~~ÿ‰‘‘ÿïóóÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿtyyÿÿÿ,00ÿnvvÿÏÕÕÿþþþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþþþÿÊÐÐÿ[bbÿÿÿÿ-22ÿáççÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿqvvÿÿÿÿÿ(,,ÿ¨±±ÿüþþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ³»»ÿ(,,ÿÿÿÿÿ.22ÿáççÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ}ƒƒÿ ÿÿÿÿÿ!!ÿ¹ÁÁÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÏÕÕÿ,11ÿÿÿÿ ÿ$((ÿZbbÿêïïÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâèèÿ½ÆÆÿ’™™ÿ9>>ÿÿÿÿEKKÿéîîÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøúúÿgnnÿÿÿÿ=CCÿ¬³³ÿÜããÿëïïÿþþþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøúúÿâççÿàååÿöøøÿÿÿÿÿÿÿÿÿÿÿÿÿÙßßÿ>ÿÿÿÿÿÿÿÿÿ†ÿÿÿÿÿêîîÿ;AAÿÿÿÿ|‚‚ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÄÌÌÿÿÿÿÿ¸ÀÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿåêêÿ{ƒƒÿÿÿÿÿÿÿÿÿÿ ÿ«³³ÿÿÿÿÿÚààÿ ##ÿÿÿÿ˜ŸŸÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÛááÿ"%%ÿÿÿÿ–ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüýýÿ¾ÅÅÿDJJÿÿÿÿÿÿÿÿÿÿÿW^^ÿìððÿÿÿÿÿÀÈÈÿÿÿÿÿÁÈÈÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïòòÿEKKÿÿÿÿz€€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëïïÿ‰‘‘ÿ ÿÿÿÿÿÿÿÿÿÿÿqxxÿãèèÿÿÿÿÿÿÿÿÿ§­­ÿ ÿÿÿ)--ÿßååÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÿÿÿpwwÿÿÿÿhppÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþþþÿÊÑÑÿQWWÿ ÿÿÿÿÿÿÿÿÿÿ155ÿ©°°ÿöùùÿÿÿÿÿÿÿÿÿÿÿÿÿš  ÿÿÿÿNVVÿóööÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ—žžÿÿÿÿZccÿøûûÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿúûûÿìïïÿßååÿÜââÿáççÿðòòÿüýýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñôôÿ–ŸŸÿ%))ÿÿÿÿÿÿÿÿÿÿ ÿbjjÿ×ÜÜÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ’››ÿÿÿÿqxxÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¶¾¾ÿ ÿÿÿW``ÿ÷úúÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýþþÿÞããÿ¥¥ÿcjjÿCCÿ³ÛÜÿÌþÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÍÿÿÿ¾¿ÿÿÿÿ*..ÿáååÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿáææÿBHHÿÿÿ!!ÿbhhÿ~……ÿœ££ÿôõõÿÿÿÿÿØÞÞÿ·¿¿ÿ©°°ÿmssÿ011ÿ*))ÿ*,,ÿ ¨¨ÿþÿÿÿÿÿÿÿ™  ÿ788ÿ777ÿ...ÿn€ÿÊúýÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿËýÿÿÄñóÿCNNÿÿÿ ÿ²ººÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÿÿÿ‚‰‰ÿÿÿ""ÿ´¼¼ÿúüüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðóóÿrxxÿ,--ÿ***ÿGLLÿâççÿþÿÿÿ……ÿ888ÿ<<<ÿ777ÿ­®ÿÍÿÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÍþÿÿm‚ÿÿÿÿ••ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâççÿ055ÿÿÿellÿúüüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¶¾¾ÿ366ÿ000ÿ-..ÿ«±±ÿøûûÿpxxÿ???ÿ@@@ÿ;<<ÿ¥ÆÇÿÌÿÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÎÿÿÿƒžÿÿÿÿ|‚‚ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¼ÄÄÿÿÿÿ†ŽŽÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÑØØÿ:;;ÿ444ÿ+++ÿ„ŠŠÿôøøÿpxxÿEDDÿFEEÿ>@?ÿ¨ÊËÿÌÿÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÍÿÿÿ…¡¢ÿÿÿÿz€€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ ¦¦ÿÿÿÿ‡ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÍÕÕÿ;==ÿ999ÿ/..ÿnvvÿóùùÿ|„„ÿGGGÿKKKÿDEEÿ™·¸ÿÌÿÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÍÿÿÿxŽÿ ÿÿÿ‡ŽŽÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ“››ÿÿÿÿz€€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¸ÀÀÿ>AAÿ>>>ÿ544ÿjssÿöûûÿ“™™ÿLLLÿPPPÿFFFÿ~’“ÿÌýÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊýÿÿÇ÷ùÿWeeÿÿÿÿ©¯¯ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ•ÿÿÿÿ]eeÿùûûÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¤¤ÿBCCÿCCCÿ888ÿmvvÿúýýÿ¹ÀÀÿPRRÿUUUÿNMMÿ[ddÿ½èéÿËýÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÌþÿÿ®ÒÓÿ+//ÿÿÿ*--ÿÔÚÚÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ£©©ÿÿÿÿ6;;ÿèììÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿûýýÿ††ÿDCCÿHHHÿ<;;ÿ|ƒƒÿþÿÿÿäééÿcggÿXWWÿWWWÿLLLÿ‹££ÿËüþÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿËýÿÿÉ÷ùÿgxxÿÿÿÿ]ccÿõ÷÷ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¶¾¾ÿ ÿÿÿ!!ÿÍÕÕÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìïïÿekkÿMLLÿLLLÿBBBÿ““ÿÿÿÿÿýÿÿÿ—ŸŸÿTUUÿ\\\ÿVVVÿTXXÿ¢ÃÅÿÌþÿÿÊýÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿÊüÿÿËýÿÿËüýÿŠ¥¦ÿ$&&ÿÿÿÿ¯µµÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÓÚÚÿ*,,ÿÿÿÿ§¯¯ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÛááÿUXXÿTTTÿQQQÿHIIÿ£««ÿÿÿÿÿÿÿÿÿßååÿgllÿ\\\ÿ^^^ÿVUUÿX^^ÿœº»ÿÈøùÿÌÿÿÿËýÿÿÊüÿÿÊüÿÿÊýÿÿËýÿÿÌÿÿÿÄòôÿ†žŸÿ.11ÿÿÿÿ^ddÿñôôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿåééÿAEEÿÿÿÿˆÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÄÍÍÿQTTÿYYYÿVVVÿJLLÿÂÊÊÿÿÿÿÿÿÿÿÿÿÿÿÿ¸ÀÀÿ[^^ÿ```ÿ___ÿWWWÿRUUÿv‡‡ÿ¨ÊËÿ¿ëíÿÈ÷úÿÌûþÿÇöøÿ¾èêÿž½¿ÿ_lmÿ,--ÿ&%%ÿ$##ÿÿ:>>ÿÍÓÓÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿôööÿZbbÿÿÿÿx~~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ´ººÿUWWÿ^^^ÿZZZÿUXXÿÛááÿÿÿÿÿÿÿÿÿÿÿÿÿúüüÿ¦¬¬ÿ[]]ÿ```ÿ```ÿZZZÿQQQÿNPPÿ]eeÿmzzÿr€€ÿhttÿPXXÿ8::ÿ000ÿ///ÿ,,,ÿ$$$ÿ6::ÿ³»»ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿy€€ÿÿ ÿÿpvvÿýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¯µµÿXZZÿbbbÿ]]]ÿejjÿèììÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿùúúÿ«³³ÿ_ccÿ]]]ÿa``ÿ]]]ÿXXXÿRQQÿIHHÿBBBÿ@@@ÿ@@@ÿ===ÿ:99ÿ433ÿ+++ÿHLLÿºÁÁÿüþþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿŠ‘‘ÿ"##ÿ###ÿÿx~~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ½ÅÅÿZ\\ÿfffÿ`__ÿkppÿîððÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüýýÿÈÐÐÿy€€ÿY[[ÿYYYÿ\\\ÿZYYÿVUUÿQQQÿLLLÿGGGÿ@@@ÿ788ÿ=??ÿw~~ÿØÝÝÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿóööÿlrrÿ&&&ÿ'''ÿ"##ÿ›¢¢ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÞääÿcggÿhhhÿgggÿ]``ÿÂÉÉÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñôôÿ½ÄÄÿ„‹‹ÿdhhÿSUUÿORRÿMPPÿIKKÿIKKÿ[``ÿ„‹‹ÿÆÍÍÿ÷ùùÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ÷ùùÿìïïÿÔÚÚÿ‚‰‰ÿ466ÿ.--ÿ(((ÿ=@@ÿØÞÞÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿùûûÿ••ÿbbbÿlllÿdddÿdhhÿœ¤¤ÿÎÕÕÿáææÿüýýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿùûûÿåêêÿÑØØÿ½ÆÆÿ·¾¾ÿ¾ÆÆÿÔÛÛÿéííÿüýýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿž¤¤ÿW\\ÿFIIÿ666ÿ555ÿ111ÿ,--ÿ”››ÿýþþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÛááÿmrrÿhhhÿnnnÿhggÿ]^^ÿVXXÿbhhÿçëëÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿ€„„ÿ;::ÿCCCÿ???ÿ888ÿ233ÿ~„„ÿñóóÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿËÑÑÿmrrÿdddÿlllÿlllÿgggÿ`eeÿàææÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿ……ÿ:99ÿAAAÿ>??ÿNRRÿ›££ÿñóóÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÜââÿ——ÿfkkÿ^``ÿ^__ÿ\aaÿáççÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ£««ÿnvvÿ‹‘‘ÿ®µµÿáååÿüþþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿúûûÿáææÿÀÇÇÿ¡¨¨ÿ¤¬¬ÿóööÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿùûûÿøûûÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿcodequery-0.18.1/gui/langtable.cpp000066400000000000000000000030231300045745200170200ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ #include #include #include "small_lib.h" #include "langtable.h" #define BASE_LANG_PATH ":/mainwindow/build/gui/" typedef struct { const char* langName; const char* langFile; }langTableType; static const langTableType langTable[]= { #include "tslist.txt" }; QStringList langtable::getLangNameList(void) { QStringList lst; for(int i=0; i. * */ #ifndef LANGTABLE_H_CQ #define LANGTABLE_H_CQ // Forward declarations class QString; class QStringList; class langtable { public: static QStringList getLangNameList(void); static QString getLangFilePath(const QString& lang); }; #endif // LANGTABLE_H_CQ codequery-0.18.1/gui/listhandler.cpp000066400000000000000000000207121300045745200174040ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ #include "std2qt.h" #include "listhandler.h" listhandler::listhandler(mainwindow* pmw) :mw(pmw) ,m_treeWidgetSearchResults(NULL) ,m_pushButtonUp(NULL) ,m_pushButtonDown(NULL) ,m_noclick(false) { } listhandler::~listhandler() { disconnect(); } void listhandler::prepareToExit(void) { disconnect(); m_noclick = true; for(int i=0; iclear(); m_sqlist.resultlist.clear(); } void listhandler::init(void) { connect(m_treeWidgetSearchResults, SIGNAL(currentItemChanged(QTreeWidgetItem *, QTreeWidgetItem *)), this, SLOT(listItemClicked(QTreeWidgetItem *, QTreeWidgetItem *))); connect(m_pushButtonUp, SIGNAL(clicked(bool)), this, SLOT(Up_ButtonClick(bool))); connect(m_pushButtonDown, SIGNAL(clicked(bool)), this, SLOT(Down_ButtonClick(bool))); m_pushButtonUp->setEnabled(false); m_pushButtonDown->setEnabled(false); m_treeWidgetSearchResults->setSelectionMode(QAbstractItemView::SingleSelection); m_sqlist.resultlist.clear(); m_sqlist.result_type = sqlqueryresultlist::sqlresultFULL; m_noclick = true; updateListHeaders(); m_noclick = false; m_sqlist.result_type = sqlqueryresultlist::sqlresultERROR; } void listhandler::populateList(sqlqueryresultlist resultlist, int selectitem) { bool headersChanged = (m_sqlist.result_type != resultlist.result_type); m_sqlist = resultlist; m_noclick = true; QApplication::setOverrideCursor(QCursor(Qt::WaitCursor)); clearList(); if (headersChanged) updateListHeaders(); updateList(); resizeColumns(); QApplication::restoreOverrideCursor(); m_noclick = false; m_treeWidgetSearchResults->setCurrentItem(m_treeWidgetSearchResults->topLevelItem(selectitem)); emit listRowNumUpdated(selectitem); } void listhandler::listItemClicked(QTreeWidgetItem * current, QTreeWidgetItem * previous) { if (current == NULL) return; if (m_noclick) return; checkUpDown(); emit listRowNumUpdated(m_treeWidgetSearchResults->indexOfTopLevelItem(current)); emit openFile(str2qt(m_sqlist.resultlist[current->data(0,Qt::UserRole).toInt()].filepath), str2qt(m_sqlist.resultlist[current->data(0,Qt::UserRole).toInt()].linenum), m_sqlist.resultlist[current->data(0,Qt::UserRole).toInt()].fileid); } void listhandler::requestToProvideResultCurrentListItemSymbolName() { QString symName(""); if (m_treeWidgetSearchResults->topLevelItemCount() > 0) { QTreeWidgetItem* current = m_treeWidgetSearchResults->currentItem(); symName = str2qt(m_sqlist.resultlist[current->data(0,Qt::UserRole).toInt()].symname); } emit sendResultCurrentListItemSymbolName(symName); } void listhandler::updateList(void) { if (m_sqlist.resultlist.empty()) return; unsigned int n = m_sqlist.resultlist.size(); QStringList strList; for (unsigned int i=0; i < n; i++) { strList.clear(); if (m_sqlist.result_type == sqlqueryresultlist::sqlresultFULL) strList += str2qt(m_sqlist.resultlist[i].symname); strList += str2qt(m_sqlist.resultlist[i].filename); if ((m_sqlist.result_type == sqlqueryresultlist::sqlresultFULL)|| (m_sqlist.result_type == sqlqueryresultlist::sqlresultFILE_LINE)) strList << str2qt(m_sqlist.resultlist[i].linenum) << str2qt(m_sqlist.resultlist[i].linetext); m_itemlist += new QTreeWidgetItem(m_treeWidgetSearchResults, strList); m_itemlist[i]->setData(0, Qt::UserRole, QVariant(i)); } m_treeWidgetSearchResults->addTopLevelItems(m_itemlist); } void listhandler::updateListHeaders(void) { QStringList headers; if (m_sqlist.result_type == sqlqueryresultlist::sqlresultFULL) headers += tr("Symbol"); headers += tr("File"); if ((m_sqlist.result_type == sqlqueryresultlist::sqlresultFULL)|| (m_sqlist.result_type == sqlqueryresultlist::sqlresultFILE_LINE)) headers << tr("Line") << tr("Preview"); m_treeWidgetSearchResults->setHeaderLabels(headers); if (m_sqlist.result_type == sqlqueryresultlist::sqlresultFULL) { m_treeWidgetSearchResults->setColumnCount(4); } else if (m_sqlist.result_type == sqlqueryresultlist::sqlresultFILE_LINE) { m_treeWidgetSearchResults->setColumnCount(3); } else if (m_sqlist.result_type == sqlqueryresultlist::sqlresultFILE_ONLY) { m_treeWidgetSearchResults->setColumnCount(1); } } void listhandler::resizeColumns(void) { int n = m_treeWidgetSearchResults->columnCount(); for(int i=0; i < n; i++) {m_treeWidgetSearchResults->resizeColumnToContents(i);} } void listhandler::clearList() { bool noclick = m_noclick; m_pushButtonUp->setEnabled(false); m_pushButtonDown->setEnabled(false); m_noclick = true; int n = m_itemlist.size(); for(int i=0; iclear(); m_noclick = noclick; } void listhandler::retranslateUi(void) { m_noclick = true; if (m_treeWidgetSearchResults->topLevelItemCount() <= 0) { m_sqlist.result_type = sqlqueryresultlist::sqlresultFULL; updateListHeaders(); m_noclick = false; } else { int curItemIdx = m_treeWidgetSearchResults->indexOfTopLevelItem(m_treeWidgetSearchResults->currentItem()); clearList(); updateListHeaders(); updateList(); resizeColumns(); m_treeWidgetSearchResults->setCurrentItem(m_treeWidgetSearchResults->topLevelItem(curItemIdx)); m_noclick = false; listItemClicked(m_treeWidgetSearchResults->topLevelItem(curItemIdx), NULL); } } void listhandler::Up_ButtonClick(bool checked) { QTreeWidgetItem *item = NULL; tStr curFilepath; tStr itemFilepath; if ((!checked)&&(m_treeWidgetSearchResults->topLevelItemCount() > 0)) { item = m_treeWidgetSearchResults->currentItem(); curFilepath = m_sqlist.resultlist[item->data(0,Qt::UserRole).toInt()].filepath; while (item != NULL) { item = m_treeWidgetSearchResults->itemAbove(item); if (item == NULL) break; itemFilepath = m_sqlist.resultlist[item->data(0,Qt::UserRole).toInt()].filepath; if (strrevcmp(curFilepath, itemFilepath)) { m_treeWidgetSearchResults->setCurrentItem(item); break; } } } } void listhandler::Down_ButtonClick(bool checked) { QTreeWidgetItem *item = NULL; tStr curFilepath; tStr itemFilepath; if ((!checked)&&(m_treeWidgetSearchResults->topLevelItemCount() > 0)) { item = m_treeWidgetSearchResults->currentItem(); curFilepath = m_sqlist.resultlist[item->data(0,Qt::UserRole).toInt()].filepath; while (item != NULL) { item = m_treeWidgetSearchResults->itemBelow(item); if (item == NULL) break; itemFilepath = m_sqlist.resultlist[item->data(0,Qt::UserRole).toInt()].filepath; if (strrevcmp(curFilepath, itemFilepath)) { m_treeWidgetSearchResults->setCurrentItem(item); break; } } } } void listhandler::checkUpDown(void) { QTreeWidgetItem *item = NULL; QTreeWidgetItem *curItem = NULL; tStr curFilepath, itemFilepath; bool upArrow=false, downArrow=false; if (m_treeWidgetSearchResults->topLevelItemCount() <= 0) return; item = m_treeWidgetSearchResults->currentItem(); curItem = item; curFilepath = m_sqlist.resultlist[item->data(0,Qt::UserRole).toInt()].filepath; while (item != NULL) { item = m_treeWidgetSearchResults->itemAbove(item); if (item == NULL) break; itemFilepath = m_sqlist.resultlist[item->data(0,Qt::UserRole).toInt()].filepath; if (strrevcmp(curFilepath, itemFilepath)) { upArrow = true; break; } // for now, assume items with same file path are grouped together // This is to speed up the search else break; } item = curItem; while (item != NULL) { item = m_treeWidgetSearchResults->itemBelow(item); if (item == NULL) break; itemFilepath = m_sqlist.resultlist[item->data(0,Qt::UserRole).toInt()].filepath; if (strrevcmp(curFilepath, itemFilepath)) { downArrow = true; break; } // for now, assume items with same file path are grouped together // This is to speed up the search else break; } m_pushButtonUp->setEnabled(upArrow); m_pushButtonDown->setEnabled(downArrow); } codequery-0.18.1/gui/listhandler.h000066400000000000000000000035211300045745200170500ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ #ifndef LISTHANDLER_H_CQ #define LISTHANDLER_H_CQ #ifdef USE_QT5 #include #else #include #endif #include "sqlquery.h" class mainwindow; class listhandler : public QObject { Q_OBJECT public: QTreeWidget *m_treeWidgetSearchResults; QPushButton *m_pushButtonUp; QPushButton *m_pushButtonDown; listhandler(mainwindow* pmw); ~listhandler(); void init(void); void updateList(void); void prepareToExit(void); void updateListHeaders(void); void resizeColumns(void); void retranslateUi(void); void checkUpDown(void); public slots: void populateList(sqlqueryresultlist resultlist, int selectitem); void listItemClicked(QTreeWidgetItem * current, QTreeWidgetItem * previous); void clearList(); void requestToProvideResultCurrentListItemSymbolName(); void Up_ButtonClick(bool checked); void Down_ButtonClick(bool checked); signals: void openFile(QString file, QString linenum, int fileid); void listRowNumUpdated(int row); void sendResultCurrentListItemSymbolName(const QString symName); private: mainwindow *mw; sqlqueryresultlist m_sqlist; QList m_itemlist; bool m_noclick; }; #endif codequery-0.18.1/gui/main_gui.cpp000066400000000000000000000022751300045745200166670ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ #ifdef _WIN32 #include #endif #include "mainwindow.h" int main(int argc, char *argv[]) { QApplication app(argc, argv); QMainWindow *wndw = new QMainWindow; mainwindow mw(wndw, &app); mw.show(); #ifdef _WIN32 ShowWindow( (HWND) mw.winId(), SW_HIDE); SetWindowLongPtr( (HWND) mw.winId(), GWL_EXSTYLE, GetWindowLongPtr( (HWND) mw.winId(), GWL_EXSTYLE) | WS_EX_APPWINDOW); ShowWindow( (HWND) mw.winId(), SW_SHOW); #endif return app.exec(); } codequery-0.18.1/gui/mainwindow.cpp000066400000000000000000000305511300045745200172510ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ #include "mainwindow.h" #include "ui_mainWindow.h" #include "fileviewer.h" #include "listhandler.h" #include "searchhandler.h" #include "langtable.h" #include "aboutdialog.h" #include "swver.h" #include #include mainwindow::mainwindow(QMainWindow *parent, QApplication *app) :QMainWindow(parent) ,m_app(app) ,ui(new Ui::MainWindow) ,m_translator(this) ,m_fileviewer(NULL) ,m_listhandler(NULL) ,m_searchhandler(NULL) ,m_currentLanguage("English") { ui->setupUi(this); init(); } mainwindow::~mainwindow() { disconnect(); delete m_fileviewer; delete m_listhandler; delete m_searchhandler; delete ui; } void mainwindow::init(void) { m_fileviewer = new fileviewer(this); m_listhandler = new listhandler(this); m_searchhandler = new searchhandler(this); setup_fileviewer(); setup_listhandler(); setup_searchhandler(); connect(m_searchhandler, SIGNAL(searchresults(sqlqueryresultlist, int)), m_listhandler, SLOT(populateList(sqlqueryresultlist, int))); connect(m_searchhandler, SIGNAL(DBreset()), m_fileviewer, SLOT(clearList())); connect(m_searchhandler, SIGNAL(sendDBtimestamp(QDateTime)), m_fileviewer, SLOT(recvDBtimestamp(QDateTime))); connect(m_searchhandler, SIGNAL(DBreset()), m_listhandler, SLOT(clearList())); connect(m_listhandler, SIGNAL(openFile(QString, QString, int)), m_fileviewer, SLOT(fileToBeOpened(QString, QString, int))); connect(m_listhandler, SIGNAL(listRowNumUpdated(int)), m_searchhandler, SLOT(updateListItemRowNum(int))); connect(m_fileviewer, SIGNAL(searchCopiedText()), m_searchhandler, SLOT(newSearchText())); connect(m_fileviewer, SIGNAL(searchCopiedTextSymbolOnly()), m_searchhandler, SLOT(newSearchTextSymbolOnly())); connect(m_searchhandler, SIGNAL(updateStatus(const QString&, int)), ui->statusbar, SLOT(showMessage(const QString&, int))); connect(m_searchhandler, SIGNAL(getResultCurrentListItemSymbolName()), m_listhandler, SLOT(requestToProvideResultCurrentListItemSymbolName())); connect(m_listhandler, SIGNAL(sendResultCurrentListItemSymbolName(QString)), m_searchhandler, SLOT(resultCurrentListItemSymbolName(QString))); connect(m_searchhandler, SIGNAL(searchDeclarationResultsReady(QString)), m_fileviewer, SLOT(annotate(QString))); connect(m_fileviewer, SIGNAL(requestAnnotation(QString)), m_searchhandler, SLOT(searchDeclaration(QString))); connect(m_searchhandler, SIGNAL(searchListFuncResultsReady(sqlqueryresultlist*)), m_fileviewer, SLOT(recvFuncList(sqlqueryresultlist*))); connect(m_fileviewer, SIGNAL(requestFuncList_filename(QString)), m_searchhandler, SLOT(searchFuncList_filename(QString))); connect(m_fileviewer, SIGNAL(requestFuncList_fileid(int)), m_searchhandler, SLOT(searchFuncList_fileid(int))); connect(ui->actionExit, SIGNAL(triggered(bool)), this, SLOT(ExitTriggered(bool))); connect(ui->actionAbout, SIGNAL(triggered(bool)), this, SLOT(AboutTriggered(bool))); connect(ui->actionAbout_Qt, SIGNAL(triggered(bool)), this, SLOT(AboutQtTriggered(bool))); connect(ui->actionLanguage, SIGNAL(triggered(bool)), this, SLOT(LanguageTriggered(bool))); connect(ui->actionOpenDB, SIGNAL(triggered(bool)), m_searchhandler, SLOT(OpenDB_ButtonClick(bool))); connect(ui->actionOptionsExtEditor, SIGNAL(triggered(bool)), m_fileviewer, SLOT(OptionsExtEditor_Triggered(bool))); connect(ui->actionFileViewSettings, SIGNAL(triggered(bool)), m_fileviewer, SLOT(fileViewSettings_Triggered(bool))); m_app->setQuitOnLastWindowClosed(false); connect(m_app, SIGNAL(lastWindowClosed()), this, SLOT(prepareToExit())); readSettings(); } void mainwindow::setup_fileviewer(void) { m_fileviewer->m_pushButtonPrev = ui->pushButtonPrev; m_fileviewer->m_pushButtonNext = ui->pushButtonNext; m_fileviewer->m_pushButtonTextShrink = ui->pushButtonTextShrink; m_fileviewer->m_pushButtonTextEnlarge = ui->pushButtonTextEnlarge; m_fileviewer->m_pushButtonOpenInEditor = ui->pushButtonOpenInEditor; m_fileviewer->m_pushButtonPaste = ui->pushButtonPaste; m_fileviewer->m_pushButtonGoToLine = ui->pushButtonGoToLine; m_fileviewer->m_labelFilePath = ui->labelFilePath; m_fileviewer->m_textEditSource = ui->textEditSource; m_fileviewer->m_listWidgetFunc = ui->listWidgetFunc; m_fileviewer->m_comboBoxFuncListSort = ui->comboBoxFuncListSort; m_fileviewer->m_checkBoxSymbolOnly = ui->checkBoxSymbolOnly; m_fileviewer->init(); } void mainwindow::setup_listhandler(void) { m_listhandler->m_treeWidgetSearchResults = ui->treeWidgetSearchResults; m_listhandler->m_pushButtonUp = ui->pushButtonUp; m_listhandler->m_pushButtonDown = ui->pushButtonDown; m_listhandler->init(); } void mainwindow::setup_searchhandler(void) { m_searchhandler->m_pushButtonOpenDB = ui->pushButtonOpenDB; m_searchhandler->m_comboBoxDB = ui->comboBoxDB; m_searchhandler->m_checkBoxAutoComplete = ui->checkBoxAutoComplete; m_searchhandler->m_checkBoxExactMatch = ui->checkBoxExactMatch; m_searchhandler->m_pushButtonSearch = ui->pushButtonSearch; m_searchhandler->m_pushButtonClipSearch = ui->pushButtonClipSearch; m_searchhandler->m_comboBoxSearch = ui->comboBoxSearch; m_searchhandler->m_comboBoxQueryType = ui->comboBoxQueryType; m_searchhandler->m_pushButtonSearchPrev = ui->pushButtonSearchPrev; m_searchhandler->m_pushButtonSearchNext = ui->pushButtonSearchNext; m_searchhandler->m_pushButtonGraph = ui->pushButtonGraph; m_searchhandler->m_checkBoxFilter = ui->checkBoxFilter; m_searchhandler->m_comboBoxFilter = ui->comboBoxFilter; m_searchhandler->init(); } void mainwindow::LanguageTriggered(bool checked) { QStringList items(langtable::getLangNameList()); bool ok; int curLangIdx = items.indexOf(m_currentLanguage); curLangIdx = curLangIdx != -1 ? curLangIdx : 0; QInputDialog qinp(this); qinp.setCancelButtonText(tr("Cancel")); qinp.setOkButtonText(tr("OK")); qinp.setInputMode(QInputDialog::TextInput); qinp.setWindowTitle(tr("Language")); qinp.setLabelText(tr("Select language:")); qinp.setComboBoxEditable(false); qinp.setComboBoxItems(items); qinp.setTextValue(m_currentLanguage); qinp.exec(); ok = (qinp.result() == QDialog::Accepted); QString item = qinp.textValue(); if (ok && (item.isEmpty() == false)) { m_currentLanguage = item; retranslateUi(); } } void mainwindow::retranslateUi(void) { QApplication::setOverrideCursor(QCursor(Qt::WaitCursor)); m_translator.load(langtable::getLangFilePath(m_currentLanguage)); m_app->installTranslator(&m_translator); ui->retranslateUi(this); QString langtxt = ui->actionLanguage->text(); if (m_currentLanguage.compare("English") != 0) langtxt += " (Language)"; ui->actionLanguage->setText(langtxt); m_searchhandler->retranslateUi(); m_listhandler->retranslateUi(); QApplication::restoreOverrideCursor(); } void mainwindow::ExitTriggered(bool checked) { prepareToExit(); } void mainwindow::AboutQtTriggered(bool checked) { QMessageBox::aboutQt(this); } void mainwindow::AboutTriggered(bool checked) { cqDialogAbout cqdg(this); cqdg.setModal(true); cqdg.exec(); } void mainwindow::prepareToExit() { writeSettings(); m_listhandler->prepareToExit(); m_app->quit(); } void mainwindow::writeSettings() { QSettings settings("ruben2020_foss", "CodeQuery"); settings.beginGroup("MainWindow"); settings.setValue("Size", size()); settings.setValue("Pos", pos()); settings.setValue("Maximized", isMaximized()); settings.setValue("AutoComplete", ui->checkBoxAutoComplete->isChecked()); settings.setValue("ExactMatch", ui->checkBoxExactMatch->isChecked()); settings.setValue("SymbolOnly", ui->checkBoxSymbolOnly->isChecked()); settings.setValue("FilterCheckBox", ui->checkBoxFilter->isChecked()); settings.setValue("QueryType", ui->comboBoxQueryType->currentIndex()); settings.setValue("LastOpenDB", ui->comboBoxDB->currentIndex()); settings.setValue("Language", m_currentLanguage); settings.setValue("ExtEditorPath", m_fileviewer->m_externalEditorPath); //settings.setValue("FileViewerFontSize", m_fileviewer->m_textEditSourceFont.pixelSize()); settings.setValue("FileViewerFontSize", m_fileviewer->m_fontsize); settings.setValue("FileViewerFontType", m_fileviewer->m_textEditSourceFont.family()); settings.setValue("FileViewerTabWidth", m_fileviewer->m_textEditSource->tabWidth()); settings.setValue("FileViewerTheme", m_fileviewer->m_theme); settings.setValue("FuncListSortType", ui->comboBoxFuncListSort->currentIndex()); settings.endGroup(); settings.beginWriteArray("SearchHistory"); for (int i=0; i < ui->comboBoxSearch->count(); i++) { settings.setArrayIndex(i); settings.setValue("hist", ui->comboBoxSearch->itemText(i)); } settings.endArray(); settings.beginWriteArray("OpenDBHistory"); for (int i=0; i < ui->comboBoxDB->count(); i++) { settings.setArrayIndex(i); settings.setValue("db", ui->comboBoxDB->itemText(i)); } settings.endArray(); settings.beginWriteArray("FilterHistory"); for (int i=0; i < ui->comboBoxFilter->count(); i++) { settings.setArrayIndex(i); settings.setValue("filter", ui->comboBoxFilter->itemText(i)); } settings.endArray(); } void mainwindow::readSettings() { QSettings settings("ruben2020_foss", "CodeQuery"); int sizee = settings.beginReadArray("OpenDBHistory"); QStringList dbhist; for (int i=0; i < sizee; i++) { settings.setArrayIndex(i); dbhist << settings.value("db").toString(); } settings.endArray(); if (dbhist.isEmpty() == false) ui->comboBoxDB->addItems(dbhist); int sizef = settings.beginReadArray("FilterHistory"); QStringList filterhist; for (int i=0; i < sizef; i++) { settings.setArrayIndex(i); filterhist << settings.value("filter").toString(); } settings.endArray(); if (filterhist.isEmpty()) filterhist << "*.h" << "*.c" << "src"; ui->comboBoxFilter->addItems(filterhist); ui->comboBoxFilter->setCurrentIndex(0); settings.beginGroup("MainWindow"); resize(settings.value("Size", size()).toSize()); move(settings.value("Pos", pos()).toPoint()); if (settings.value("Maximized", false).toBool()) showMaximized(); else showNormal(); ui->checkBoxAutoComplete->setChecked(settings.value("AutoComplete", true).toBool()); ui->checkBoxExactMatch->setChecked(settings.value("ExactMatch", false).toBool()); ui->checkBoxSymbolOnly->setChecked(settings.value("SymbolOnly", false).toBool()); ui->checkBoxFilter->setChecked(settings.value("FilterCheckBox", false).toBool()); ui->comboBoxQueryType->setCurrentIndex(settings.value("QueryType", 0).toInt()); ui->comboBoxDB->setCurrentIndex(settings.value("LastOpenDB", ui->comboBoxDB->currentIndex()).toInt()); m_currentLanguage = settings.value("Language", QString("English")).toString(); retranslateUi(); m_fileviewer->m_externalEditorPath = settings.value("ExtEditorPath", m_fileviewer->m_externalEditorPath).toString(); //m_fileviewer->m_textEditSourceFont.setPixelSize(settings.value("FileViewerFontSize", 12).toInt()); m_fileviewer->m_fontsize = settings.value("FileViewerFontSize", 0).toInt(); m_fileviewer->m_textEditSource->zoomTo(m_fileviewer->m_fontsize); m_fileviewer->m_textEditSourceFont.setFamily(settings.value("FileViewerFontType", "Courier New").toString()); m_fileviewer->m_textEditSource->setFont(m_fileviewer->m_textEditSourceFont); m_fileviewer->m_textEditSource->setTabWidth(settings.value("FileViewerTabWidth", 4).toInt()); m_fileviewer->m_theme = (settings.value("FileViewerTheme", "Eclipse Default").toString()); ui->comboBoxFuncListSort->setCurrentIndex(settings.value("FuncListSortType", ui->comboBoxFuncListSort->currentIndex()).toInt()); settings.endGroup(); int sizeh = settings.beginReadArray("SearchHistory"); QStringList searchhist; for (int i=0; i < sizeh; i++) { settings.setArrayIndex(i); searchhist << settings.value("hist").toString(); } settings.endArray(); if (searchhist.isEmpty() == false) { ui->comboBoxSearch->addItems(searchhist); ui->comboBoxSearch->setCurrentIndex(-1); } } codequery-0.18.1/gui/mainwindow.h000066400000000000000000000032211300045745200167100ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ #ifndef MAINWINDOW_H_CQ #define MAINWINDOW_H_CQ #ifdef USE_QT5 #include #else #include #endif namespace Ui { class MainWindow; } class fileviewer; class listhandler; class searchhandler; class mainwindow : public QMainWindow { Q_OBJECT public: Ui::MainWindow *ui; mainwindow(QMainWindow *parent = NULL, QApplication *app = NULL); virtual ~mainwindow(); void setup_fileviewer(void); void setup_listhandler(void); void setup_searchhandler(void); void retranslateUi(void); void writeSettings(); void readSettings(); public slots: void AboutQtTriggered(bool checked); void AboutTriggered(bool checked); void ExitTriggered(bool checked); void LanguageTriggered(bool checked); void prepareToExit(); private: QApplication *m_app; fileviewer* m_fileviewer; listhandler* m_listhandler; searchhandler* m_searchhandler; QString m_currentLanguage; QTranslator m_translator; void init(void); }; #endif codequery-0.18.1/gui/searchhandler.cpp000066400000000000000000000555541300045745200177120ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ #include #include "std2qt.h" #include "graphdialog.h" #include "searchhandler.h" #ifdef USE_QT5 #include #define QT45_TOASCII(x) toLatin1(x) #else #define QT45_TOASCII(x) toAscii(x) #endif sqlqueryadv* searchhandler::sq = NULL; bool searchhandler::m_grepExactMatch = false; QRegExp* searchhandler::m_grepRegExp = NULL; searchitem::searchitem() :exactmatch(false) ,qtype(sqlquery::sqlquerySYMBOL) ,rownum(1) { } searchitem::searchitem(const searchitem& otheritem) { searchterm = otheritem.searchterm; filterterm = otheritem.filterterm; exactmatch = otheritem.exactmatch; qtype = otheritem.qtype; rownum = otheritem.rownum; } searchitem& searchitem::operator=(const searchitem& otheritem) { if (&otheritem != this) { searchterm = otheritem.searchterm; filterterm = otheritem.filterterm; exactmatch = otheritem.exactmatch; qtype = otheritem.qtype; rownum = otheritem.rownum; } return *this; } // return value: 0=same, 1=completely different, 2=only linenum changed int searchitem::compare(const searchitem& otheritem) { if ((searchterm.compare(otheritem.searchterm, Qt::CaseSensitive) != 0) || (exactmatch != otheritem.exactmatch) || (qtype != otheritem.qtype) || (filterterm.compare(otheritem.filterterm, Qt::CaseSensitive) != 0)) return 1; if (rownum != otheritem.rownum) return 2; return 0; } searchhandler::searchhandler(mainwindow* pmw) :mw(pmw) ,m_pushButtonOpenDB(NULL) ,m_comboBoxDB(NULL) ,m_checkBoxAutoComplete(NULL) ,m_checkBoxExactMatch(NULL) ,m_pushButtonSearch(NULL) ,m_comboBoxSearch(NULL) ,m_comboBoxQueryType(NULL) ,m_checkBoxFilter(NULL) ,m_comboBoxFilter(NULL) ,m_srchStrLstModel(QStringList()) ,m_typeOfGraph(1) ,m_autocompBusy(false) ,m_declarBusy(false) ,m_funcListBusy(false) { sq = new sqlqueryadv; m_completer = new QCompleter(&m_srchStrLstModel, (QWidget*)mw); m_grepRegExp = new QRegExp(); m_iter = m_searchMemoryList.begin(); } searchhandler::~searchhandler() { disconnect(); delete sq; delete m_completer; delete m_grepRegExp; } void searchhandler::OpenDB_ButtonClick(bool checked) { if (!checked) perform_open_db(); } void searchhandler::Search_ButtonClick(bool checked) { if (!checked) perform_search(m_comboBoxSearch->lineEdit()->text().trimmed().QT45_TOASCII().data(), m_checkBoxExactMatch->isChecked()); } void searchhandler::ClipSearch_ButtonClick(bool checked) { if (!checked) newSearchText(); } void searchhandler::Graph_ButtonClick(bool checked) { if (!checked) { emit getResultCurrentListItemSymbolName(); } } void searchhandler::PrevSearch_ButtonClick(bool checked) { if (!checked) goBackInSearchMemory(); } void searchhandler::NextSearch_ButtonClick(bool checked) { if (!checked) goForwardInSearchMemory(); } void searchhandler::Search_EnterKeyPressed() { perform_search(m_comboBoxSearch->lineEdit()->text().trimmed().QT45_TOASCII().data(), m_checkBoxExactMatch->isChecked()); } void searchhandler::searchTextEdited(const QString& searchtxt) { if (m_checkBoxAutoComplete->isChecked()) { if ((m_autocompBusy)||(m_declarBusy)||(m_funcListBusy)) { m_autocompSrchTerm = searchtxt; } else { m_autocompBusy = true; m_autocompSrchTerm.clear(); m_autocompFutureWatcher.setFuture( QtConcurrent::run(search_autocomplete_qt, searchtxt)); } } m_autocompBusy = (!m_autocompFutureWatcher.isFinished()); } void searchhandler::autoCompleteFinished() { if (!m_autocompBusy) return; m_srchStrLstModel.setStringList(m_autocompFutureWatcher.result()); if (m_autocompSrchTerm.isEmpty()) { m_autocompBusy = false; } else { m_autocompBusy = true; m_autocompFutureWatcher.setFuture( QtConcurrent::run(search_autocomplete_qt, m_autocompSrchTerm)); m_autocompSrchTerm.clear(); } } void searchhandler::declarSearchFinished() { QString str = m_declarFutureWatcher.result(); if (str.length() > 0) emit searchDeclarationResultsReady(str); m_declarBusy = false; } void searchhandler::searchDeclaration(QString searchstr) { if ((!m_declarBusy)&&(!m_autocompBusy)&&(!m_funcListBusy)) { m_declarBusy = true; m_declarFutureWatcher.setFuture( QtConcurrent::run(search_declaration_qt, searchstr)); } } void searchhandler::funcListSearchFinished() { sqlqueryresultlist res = m_listFuncFutureWatcher.result(); if ((res.result_type == sqlqueryresultlist::sqlresultFUNC_IN_ONE_FILE) && (res.resultlist.empty() == false)) { emit searchListFuncResultsReady(&res); } m_funcListBusy = false; } void searchhandler::searchFuncList_filename(QString filename) { if ((filename.isEmpty() == false)&&(!m_declarBusy)&&(!m_autocompBusy)&&(!m_funcListBusy)) { m_funcListBusy = true; m_listFuncFutureWatcher.setFuture( QtConcurrent::run(search_funclist_qt_filename, filename)); } } void searchhandler::searchFuncList_fileid(int fileid) { if ((fileid >= 0)&&(!m_declarBusy)&&(!m_autocompBusy)&&(!m_funcListBusy)) { m_funcListBusy = true; m_listFuncFutureWatcher.setFuture( QtConcurrent::run(search_funclist_qt_fileid, fileid)); } } sqlqueryresultlist searchhandler::search_funclist_qt_filename(QString filename) { return sq->search_funclist_filename(extract_filename(filename.QT45_TOASCII().data())); } sqlqueryresultlist searchhandler::search_funclist_qt_fileid(int fileid) { return sq->search_funclist_fileid(fileid); } QString searchhandler::search_declaration_qt(QString searchtxt) { QString str; sqlqueryresultlist reslst = sq->search_declaration(searchtxt.QT45_TOASCII().data()); if (reslst.resultlist.size() > 0) str.append(reslst.resultlist[0].filename.c_str()) .append(":") .append(reslst.resultlist[0].linenum.c_str()) .append(" ==> ") .append(reslst.resultlist[0].linetext.c_str()); return str; } QStringList searchhandler::search_autocomplete_qt(QString searchtxt) { return strLst2qt(sq->search_autocomplete(searchtxt.QT45_TOASCII().data())); } void searchhandler::autoCompleteStateChanged(int state) { if (state == Qt::Checked) { m_srchStrLstModel.setStringList(QStringList(m_comboBoxSearch->lineEdit()->text().trimmed())); } else if (state == Qt::Unchecked) { m_srchStrLstModel.setStringList(QStringList()); } } void searchhandler::newSearchText() { QString txt = (QApplication::clipboard())->text(); //m_comboBoxSearch->lineEdit()->setText(txt); perform_search(txt,m_checkBoxExactMatch->isChecked()); } void searchhandler::newSearchTextSymbolOnly() { QString txt = (QApplication::clipboard())->text(); //m_comboBoxSearch->lineEdit()->setText(txt); perform_search(txt, m_checkBoxExactMatch->isChecked(), sqlquery::sqlquerySYMBOL); } void searchhandler::init(void) { m_completer->setModelSorting(QCompleter::CaseSensitivelySortedModel); m_completer->setCaseSensitivity(Qt::CaseInsensitive); m_comboBoxSearch->lineEdit()->setCompleter(m_completer); m_comboBoxSearch->setInsertPolicy(QComboBox::NoInsert); retranslateUi(); m_pushButtonSearchPrev->setEnabled(false); m_pushButtonSearchNext->setEnabled(false); connect(m_pushButtonOpenDB, SIGNAL(clicked(bool)), this, SLOT(OpenDB_ButtonClick(bool))); connect(m_pushButtonSearch, SIGNAL(clicked(bool)), this, SLOT(Search_ButtonClick(bool))); connect(m_pushButtonClipSearch, SIGNAL(clicked(bool)), this, SLOT(ClipSearch_ButtonClick(bool))); connect(m_pushButtonGraph, SIGNAL(clicked(bool)), this, SLOT(Graph_ButtonClick(bool))); connect(m_comboBoxSearch->lineEdit(), SIGNAL(returnPressed()), this, SLOT(Search_EnterKeyPressed())); connect(m_comboBoxSearch->lineEdit(), SIGNAL(textEdited(QString)), this, SLOT(searchTextEdited(QString))); connect(m_comboBoxDB, SIGNAL(currentIndexChanged(int)), this, SLOT(OpenDB_indexChanged(int))); connect(m_comboBoxQueryType, SIGNAL(currentIndexChanged(int)), this, SLOT(QueryType_indexChanged(int))); connect(m_checkBoxAutoComplete, SIGNAL(stateChanged(int)), this, SLOT(autoCompleteStateChanged(int))); connect(m_pushButtonSearchPrev, SIGNAL(clicked(bool)), this, SLOT(PrevSearch_ButtonClick(bool))); connect(m_pushButtonSearchNext, SIGNAL(clicked(bool)), this, SLOT(NextSearch_ButtonClick(bool))); connect(&m_autocompFutureWatcher, SIGNAL(finished()), this, SLOT(autoCompleteFinished())); connect(&m_declarFutureWatcher, SIGNAL(finished()), this, SLOT(declarSearchFinished())); connect(&m_listFuncFutureWatcher, SIGNAL(finished()), this, SLOT(funcListSearchFinished())); } void searchhandler::retranslateUi(void) { int curidx = 0; if (m_comboBoxQueryType->count() > 0) curidx = m_comboBoxQueryType->currentIndex(); m_comboBoxQueryType->clear(); m_comboBoxQueryType->addItem(QIcon(), tr("Symbol"), QVariant(sqlquery::sqlquerySYMBOL)); m_comboBoxQueryType->addItem(QIcon(), tr("Function or macro definition (Graph available)"), QVariant(sqlquery::sqlresultFUNC_MACRO)); m_comboBoxQueryType->addItem(QIcon(), tr("Calls of this function or macro"), QVariant(sqlquery::sqlresultCALLSOFFUNC)); m_comboBoxQueryType->addItem(QIcon(), tr("Functions calling this function"), QVariant(sqlquery::sqlresultCALLINGFUNC)); m_comboBoxQueryType->addItem(QIcon(), tr("Functions called by this function"), QVariant(sqlquery::sqlresultCALLEDFUNC)); m_comboBoxQueryType->addItem(QIcon(), tr("Class or struct (Graph available)"), QVariant(sqlquery::sqlresultCLASS_STRUCT)); m_comboBoxQueryType->addItem(QIcon(), tr("Class which owns this member or method"), QVariant(sqlquery::sqlresultOWNERCLASS)); m_comboBoxQueryType->addItem(QIcon(), tr("Members or methods of this class"), QVariant(sqlquery::sqlresultMEMBERS)); m_comboBoxQueryType->addItem(QIcon(), tr("Parent of this class"), QVariant(sqlquery::sqlresultPARENTCLASS)); m_comboBoxQueryType->addItem(QIcon(), tr("Children of this class"), QVariant(sqlquery::sqlresultCHILDCLASS)); m_comboBoxQueryType->addItem(QIcon(), tr("Files including this file"), QVariant(sqlquery::sqlresultINCLUDE)); m_comboBoxQueryType->addItem(QIcon(), tr("Full path for file"), QVariant(sqlquery::sqlresultFILEPATH)); m_comboBoxQueryType->addItem(QIcon(), tr("Functions or macros inside this file"), QVariant(sqlquery::sqlresultFUNCSINFILE)); m_comboBoxQueryType->addItem(QIcon(), "Grep", QVariant(sqlquery::sqlresultGREP)); m_comboBoxQueryType->setCurrentIndex(curidx); } void searchhandler::perform_open_db(void) { QString fileext = tr("CodeQuery DB Files"); fileext += " (*.db)"; QString fileName = QFileDialog::getOpenFileName( (QWidget*)mw, tr("Open CQ database file"), "", fileext); if (fileName.isEmpty() == false) { m_comboBoxDB->insertItem(0, fileName); m_comboBoxDB->setCurrentIndex(0); for (int i=1; i < (m_comboBoxDB->count()); i++) { if (fileName.compare(m_comboBoxDB->itemText(i), Qt::CaseSensitive) == 0) { m_comboBoxDB->removeItem(i); break; } } if (m_comboBoxDB->count() > 7) m_comboBoxDB->removeItem(m_comboBoxDB->count() - 1); } } void searchhandler::OpenDB_indexChanged(const int& idx) { if (idx < 0) return; sqlquery::en_filereadstatus sqstatus; if (m_autocompBusy) { m_autocompBusy = false; m_autocompFutureWatcher.waitForFinished(); } if (m_declarBusy) { m_declarBusy = false; m_declarFutureWatcher.waitForFinished(); } if (m_funcListBusy) { m_funcListBusy = false; m_listFuncFutureWatcher.waitForFinished(); } sq->close_dbfile(); QFileInfo dbfile(m_comboBoxDB->itemText(idx)); sqstatus = sq->open_dbfile(qt2str(m_comboBoxDB->itemText(idx))); if (sqstatus != sqlquery::sqlfileOK) { QMessageBox msgBox((QWidget*)mw); msgBox.setText(sqlerrormsg(sqstatus)); msgBox.exec(); m_comboBoxDB->removeItem(idx); } else { QApplication::setOverrideCursor(QCursor(Qt::WaitCursor)); m_comboBoxSearch->clear(); m_comboBoxSearch->lineEdit()->clear(); m_searchMemoryList.clear(); m_iter = m_searchMemoryList.begin(); m_pushButtonSearchPrev->setEnabled(false); m_pushButtonSearchNext->setEnabled(false); emit sendDBtimestamp(dbfile.lastModified()); emit DBreset(); QApplication::restoreOverrideCursor(); } } void searchhandler::QueryType_indexChanged(const int& idx) { int qrytype; m_pushButtonGraph->setEnabled(false); qrytype = m_comboBoxQueryType->itemData(idx).toInt(); switch(qrytype) { case sqlquery::sqlresultFUNC_MACRO: // function or macro m_graphdesc = tr("Function Call Graph"); m_typeOfGraph = 1; break; case sqlquery::sqlresultCLASS_STRUCT: // class or struct m_graphdesc = tr("Class Inheritance Graph"); m_typeOfGraph = 2; break; } if (qrytype == sqlquery::sqlresultGREP) { #ifndef QT_NO_TOOLTIP m_comboBoxSearch->setToolTip("Grep: QRegExp regular expressions"); #endif // QT_NO_TOOLTIP #ifndef QT_NO_STATUSTIP m_comboBoxSearch->setStatusTip("Grep: QRegExp regular expressions"); #endif // QT_NO_STATUSTIP } else { #ifndef QT_NO_TOOLTIP m_comboBoxSearch->setToolTip(tr("If Exact Match is switched off, wildcard searches (* and ?) are supported")); #endif // QT_NO_TOOLTIP #ifndef QT_NO_STATUSTIP m_comboBoxSearch->setStatusTip(tr("If Exact Match is switched off, wildcard searches (* and ?) are supported")); #endif // QT_NO_STATUSTIP } } void searchhandler::perform_search(QString searchtxt, bool exactmatch, sqlquery::en_queryType qrytyp, QString filtertxt, int selectitem, bool updSearchMemory) { if (sq->isDBOpen() == false) return; if (searchtxt.isEmpty()) return; sqlqueryresultlist sqlresultlist; QApplication::setOverrideCursor(QCursor(Qt::WaitCursor)); if (m_autocompBusy) { m_autocompBusy = false; m_autocompFutureWatcher.waitForFinished(); } if (m_declarBusy) { m_declarBusy = false; m_declarFutureWatcher.waitForFinished(); } if (m_funcListBusy) { m_funcListBusy = false; m_listFuncFutureWatcher.waitForFinished(); } sqlquery::en_queryType querytype = qrytyp; if (querytype == sqlquery::sqlresultDEFAULT) querytype = (sqlquery::en_queryType)m_comboBoxQueryType->itemData(m_comboBoxQueryType->currentIndex()).toInt(); if ((filtertxt.isEmpty()) && (m_checkBoxFilter->isChecked())) { filtertxt = m_comboBoxFilter->lineEdit()->text().trimmed(); if (updSearchMemory) updateFilterHistory(filtertxt); } if (querytype == sqlquery::sqlresultGREP) { if (filtertxt.isEmpty()) filtertxt = "*"; sqlresultlist = sq->search(filtertxt.QT45_TOASCII().data(), sqlquery::sqlresultFILEPATH, false); } else { sqlresultlist = sq->search(searchtxt.QT45_TOASCII().data(), querytype, exactmatch, filtertxt.QT45_TOASCII().data()); } QApplication::restoreOverrideCursor(); if (sqlresultlist.result_type == sqlqueryresultlist::sqlresultERROR) { QMessageBox msgBox((QWidget*)mw); msgBox.setText(str2qt(sqlresultlist.sqlerrmsg)); msgBox.exec(); } else { m_pushButtonGraph->setEnabled((querytype == sqlquery::sqlresultFUNC_MACRO)|| (querytype == sqlquery::sqlresultCLASS_STRUCT)); updateSearchHistory(searchtxt); if (updSearchMemory) addToSearchMemory(searchtxt, filtertxt); if (querytype == sqlquery::sqlresultGREP) { sqlresultlist = perform_grep(searchtxt, sqlresultlist, exactmatch); } emit searchresults(sqlresultlist, selectitem); QString str; str = QString("%1").arg(sqlresultlist.resultlist.size()); str += " "; str += tr("results found"); emit updateStatus(str, 5000); } } sqlqueryresultlist searchhandler::perform_grep(QString searchtxt, sqlqueryresultlist searchlist, bool exactmatch) { QVector strvec; sqlqueryresultlist resultlist; QFutureWatcher futureWatcher; QProgressDialog dialog; unsigned int n = searchlist.resultlist.size(); if (n == 0) return resultlist; strvec.resize(n); for (unsigned int i=0; i < n; i++) { strvec.replace(i, str2qt(searchlist.resultlist[i].filepath)); } dialog.setAutoReset(false); dialog.setLabelText(QString("Grep ").append(QString(tr("in progress"))).append(QString(" ..."))); dialog.setCancelButtonText(tr("Cancel")); QObject::connect(&futureWatcher, SIGNAL(finished()), &dialog, SLOT(reset())); QObject::connect(&dialog, SIGNAL(canceled()), &futureWatcher, SLOT(cancel())); QObject::connect(&futureWatcher, SIGNAL(progressRangeChanged(int,int)), &dialog, SLOT(setRange(int,int))); QObject::connect(&futureWatcher, SIGNAL(progressValueChanged(int)), &dialog, SLOT(setValue(int))); m_grepExactMatch = exactmatch; (*m_grepRegExp) = QRegExp(searchtxt.QT45_TOASCII().data(), Qt::CaseInsensitive); m_grepRegExp->setPatternSyntax(QRegExp::RegExp2); futureWatcher.setFuture(QtConcurrent::mappedReduced(strvec, doGrep, collateGrep, QtConcurrent::SequentialReduce)); dialog.exec(); futureWatcher.waitForFinished(); if (futureWatcher.isCanceled() == false) resultlist = futureWatcher.result(); return resultlist; } sqlqueryresultlist searchhandler::doGrep(const QString &fp) { sqlqueryresultlist reslist; sqlqueryresult res; QString str, fp2; tStr fpstr, fn; int pos, linenumber=0; char numtext[10]; QRegExp rx1(*m_grepRegExp); reslist.result_type = sqlqueryresultlist::sqlresultFILE_LINE; fp2 = fp; fp2.replace(QString("$HOME"), QDir::homePath()); #ifdef _WIN32 fp2.replace("/", "\\"); #endif fpstr = qt2str(fp2); fn = extract_filename(fpstr.c_str()); QFile file(fp2); QTextStream in(&file); if (!file.open(QIODevice::ReadOnly | QIODevice::Text)) { return reslist; } while (!in.atEnd()) { linenumber++; str = in.readLine(); pos = rx1.indexIn(str); if (pos != -1) { res.filepath = fpstr; res.filename = fn; sprintf(numtext, "%d", linenumber); res.linenum = numtext; res.linetext = qt2str(str.trimmed().left(80)); reslist.resultlist.push_back(res); } } return reslist; } void searchhandler::collateGrep(sqlqueryresultlist &result, const sqlqueryresultlist &intermediate) { unsigned int i, n; n = intermediate.resultlist.size(); result.result_type = sqlqueryresultlist::sqlresultFILE_LINE; result.resultlist.reserve(n); for(i=0; iinsertItem(0, filtertxt); m_comboBoxFilter->setCurrentIndex(0); for(int i=1; i < m_comboBoxFilter->count(); i++) { if (m_comboBoxFilter->itemText(i).compare(filtertxt) == 0) { m_comboBoxFilter->removeItem(i); break; } } if (m_comboBoxFilter->count() > 7) // limit to 7 { m_comboBoxFilter->removeItem(m_comboBoxFilter->count() - 1); } } void searchhandler::resultCurrentListItemSymbolName(const QString symName) { if (symName.isEmpty()) { QMessageBox msgBox((QWidget*)mw); msgBox.setIcon(QMessageBox::Information); msgBox.setStandardButtons(QMessageBox::Ok); msgBox.setText(tr("You have to first select an item from the list before pushing the Graph button.")); msgBox.exec(); return; } QStringList grpxml, grpdot; bool res; QApplication::setOverrideCursor(QCursor(Qt::WaitCursor)); if (m_autocompBusy) { m_autocompBusy = false; m_autocompFutureWatcher.waitForFinished(); } if (m_declarBusy) { m_declarBusy = false; m_declarFutureWatcher.waitForFinished(); } if (m_funcListBusy) { m_funcListBusy = false; m_listFuncFutureWatcher.waitForFinished(); } if (m_typeOfGraph == 1) { res = sq->search_funcgraph(symName, true, grpxml, grpdot); res = sq->search_funcgraph(symName, true, grpxml, grpdot, 2); } else if (m_typeOfGraph == 2) { res = sq->search_classinheritgraph(symName, true, grpxml, grpdot); } else {QApplication::restoreOverrideCursor(); return;} QApplication::restoreOverrideCursor(); QMessageBox msgBox((QWidget*)mw); msgBox.setIcon(QMessageBox::Warning); msgBox.setStandardButtons(QMessageBox::Ok); if (!res) { msgBox.setText("SQL Query error"); msgBox.exec(); return; } QApplication::setOverrideCursor(QCursor(Qt::WaitCursor)); cqDialogGraph cqdg((QWidget*)mw); cqdg.setModal(true); cqdg.setupGraphFromXML(grpxml, grpdot, m_graphdesc); QApplication::restoreOverrideCursor(); cqdg.exec(); } void searchhandler::addToSearchMemory(const QString& searchtxt, const QString& filtertxt) { searchitem item; item.searchterm = searchtxt; item.filterterm = filtertxt; item.exactmatch = m_checkBoxExactMatch->isChecked(); item.qtype = (sqlquery::en_queryType) m_comboBoxQueryType->itemData(m_comboBoxQueryType->currentIndex()).toInt(); m_searchMemoryList.push_back(item); if (m_searchMemoryList.size() > 20) m_searchMemoryList.erase(m_searchMemoryList.begin()); m_iter = m_searchMemoryList.end() - 1; m_pushButtonSearchPrev->setEnabled(m_searchMemoryList.isEmpty() == false); m_pushButtonSearchNext->setEnabled(false); } void searchhandler::goForwardInSearchMemory(void) { if (m_searchMemoryList.size() <= 1) return; if (m_iter == m_searchMemoryList.end() - 1) return; m_iter++; m_pushButtonSearchPrev->setEnabled(m_searchMemoryList.isEmpty() == false); m_pushButtonSearchNext->setEnabled(m_iter != m_searchMemoryList.end() - 1); restoreSearchMemoryItem(); } void searchhandler::goBackInSearchMemory(void) { if (m_searchMemoryList.size() <= 1) return; if (m_iter == m_searchMemoryList.begin()) return; m_iter--; m_pushButtonSearchPrev->setEnabled(m_iter != m_searchMemoryList.begin()); m_pushButtonSearchNext->setEnabled(m_searchMemoryList.isEmpty() == false); restoreSearchMemoryItem(); } void searchhandler::restoreSearchMemoryItem(void) { perform_search(m_iter->searchterm, m_iter->exactmatch, m_iter->qtype, m_iter->filterterm, m_iter->rownum, false); } void searchhandler::updateListItemRowNum(const int& row) { if (m_searchMemoryList.isEmpty() == false) m_iter->rownum = row; } void searchhandler::updateSearchHistory(const QString& searchtxt) { m_comboBoxSearch->insertItem(0, searchtxt); // insert to top int n = (m_comboBoxSearch->count()); for(int i=1; i < n; i++) { if (m_comboBoxSearch->itemText(i).compare(searchtxt, Qt::CaseSensitive) == 0) { m_comboBoxSearch->removeItem(i); // remove duplicates break; } } // limit to 15 only if (m_comboBoxSearch->count() > 15) m_comboBoxSearch->removeItem(m_comboBoxSearch->count() - 1); m_comboBoxSearch->setCurrentIndex(0); } QString searchhandler::sqlerrormsg(sqlquery::en_filereadstatus status) { QString str; switch(status) { case sqlquery::sqlfileOPENERROR: str = tr("File open error"); break; case sqlquery::sqlfileNOTCORRECTDB: str = tr("Wrong file format"); break; case sqlquery::sqlfileINCORRECTVER: str = tr("Incorrect CQ database version"); break; case sqlquery::sqlfileOK: str = tr("OK"); break; case sqlquery::sqlfileUNKNOWNERROR: default: str = tr("Unknown Error"); break; } return str; } codequery-0.18.1/gui/searchhandler.h000066400000000000000000000111731300045745200173440ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ #ifndef SEARCHHANDLER_H_CQ #define SEARCHHANDLER_H_CQ #ifdef USE_QT5 #include #else #include #endif #include "sqlqueryadv.h" class mainwindow; class searchitem { public: searchitem(); ~searchitem(){} searchitem(const searchitem& otheritem); searchitem& operator=(const searchitem& otheritem); // return value: 0=same, 1=completely different, 2=only linenum changed int compare(const searchitem& otheritem); QString searchterm; QString filterterm; bool exactmatch; sqlquery::en_queryType qtype; int rownum; }; class searchhandler : public QObject { Q_OBJECT public: QPushButton *m_pushButtonOpenDB; QComboBox *m_comboBoxDB; QCheckBox *m_checkBoxAutoComplete; QCheckBox *m_checkBoxExactMatch; QPushButton *m_pushButtonSearch; QPushButton *m_pushButtonClipSearch; QPushButton *m_pushButtonSearchPrev; QPushButton *m_pushButtonSearchNext; QComboBox *m_comboBoxSearch; QComboBox *m_comboBoxQueryType; QPushButton *m_pushButtonGraph; QCheckBox *m_checkBoxFilter; QComboBox *m_comboBoxFilter; QCompleter *m_completer; QFutureWatcher m_autocompFutureWatcher; QFutureWatcher m_declarFutureWatcher; QFutureWatcher m_listFuncFutureWatcher; static bool m_grepExactMatch; static QRegExp* m_grepRegExp; searchhandler(mainwindow* pmw); ~searchhandler(); void init(void); void perform_open_db(void); void perform_search(QString searchtxt, bool exactmatch, sqlquery::en_queryType qrytyp = sqlquery::sqlresultDEFAULT, QString filtertxt = "", int selectitem = 0, bool updSearchMemory = true); void updateSearchHistory(const QString& searchtxt); void addToSearchMemory(const QString& searchtxt, const QString& filtertxt); void goForwardInSearchMemory(void); void goBackInSearchMemory(void); void restoreSearchMemoryItem(void); void retranslateUi(void); static QStringList search_autocomplete_qt(QString searchtxt); static QString search_declaration_qt(QString searchtxt); static sqlqueryresultlist search_funclist_qt_filename(QString filename); static sqlqueryresultlist search_funclist_qt_fileid(int fileid); static sqlqueryresultlist doGrep(const QString &fp); static void collateGrep(sqlqueryresultlist &result, const sqlqueryresultlist &intermediate); public slots: void OpenDB_ButtonClick(bool checked); void Search_ButtonClick(bool checked); void PrevSearch_ButtonClick(bool checked); void NextSearch_ButtonClick(bool checked); void ClipSearch_ButtonClick(bool checked); void Graph_ButtonClick(bool checked); void Search_EnterKeyPressed(); void searchTextEdited(const QString& searchtxt); void newSearchText(); void newSearchTextSymbolOnly(); void autoCompleteStateChanged(int state); void OpenDB_indexChanged(const int& idx); void QueryType_indexChanged(const int& idx); void updateListItemRowNum(const int& row); void resultCurrentListItemSymbolName(const QString symName); void searchDeclaration(QString searchstr); void searchFuncList_filename(QString filename); void searchFuncList_fileid(int fileid); void autoCompleteFinished(); void declarSearchFinished(); void funcListSearchFinished(); signals: void searchresults(sqlqueryresultlist resultlist, int selectitem); void updateStatus(const QString & message, int timeout = 0); void DBreset(); void sendDBtimestamp(QDateTime dt); void getResultCurrentListItemSymbolName(); void searchDeclarationResultsReady(QString resdeclar); void searchListFuncResultsReady(sqlqueryresultlist* res); private: mainwindow *mw; static sqlqueryadv* sq; QString m_graphdesc; int m_typeOfGraph; // 1 = Function Call, 2 = Class Inheritance QStringListModel m_srchStrLstModel; QString sqlerrormsg(sqlquery::en_filereadstatus status); QVector m_searchMemoryList; QVector::iterator m_iter; bool m_autocompBusy; bool m_declarBusy; bool m_funcListBusy; QString m_autocompSrchTerm; void updateFilterHistory(QString filtertxt); sqlqueryresultlist perform_grep(QString searchtxt, sqlqueryresultlist searchlist, bool exactmatch); }; #endif codequery-0.18.1/gui/sqlqueryadv.cpp000066400000000000000000000221331300045745200174520ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ // Advanced version of sqlquery to be GPL'ed #include "std2qt.h" #include "sqlqueryadv.h" #include #include #include sqlqueryadv::sqlqueryadv() { } sqlqueryadv::~sqlqueryadv() { } // Generate function call graph // returns true if successful, false if failed bool sqlqueryadv::search_funcgraph(QString searchstr, bool exactmatch, QStringList& xmlout, QStringList& dotout, int levels) { unsigned int i, j; sqlqueryresultlist result1, result2, result; QString xmltext = ""; QString dottext = "digraph graphname {\n"; unsigned int nodenum = 1, subrootnum; result1 = search(qt2str(searchstr), sqlresultCALLINGFUNC, exactmatch); result2 = search(qt2str(searchstr), sqlresultCALLEDFUNC, exactmatch); if (result1.result_type == sqlqueryresultlist::sqlresultERROR) { return false; } else if (result2.result_type == sqlqueryresultlist::sqlresultERROR) { return false; } unique_symnames(result1); unique_symnames(result2); xmltext += QString("").arg(nodenum).arg(searchstr); dottext += QString("node%1 [label=\"%2\" style=filled fillcolor=\"#e2ffff\" shape=\"box\" ];\n").arg(nodenum).arg(searchstr); nodenum++; for (i=0; i < result1.resultlist.size(); i++) { xmltext += QString(""). arg(nodenum).arg(QString(result1.resultlist[i].symname.c_str())); xmltext += QString("").arg(nodenum); dottext += QString("node%1 [label=\"%2\" style=filled fillcolor=\"#ffffff\" shape=\"box\" ];\n"). arg(nodenum).arg(QString(result1.resultlist[i].symname.c_str())); dottext += QString("node%1 -> node1;\n").arg(nodenum); subrootnum = nodenum; nodenum++; if (levels == 2) { result = search(qt2str(result1.resultlist[i].symname.c_str()), sqlresultCALLINGFUNC, exactmatch); for (j=0; j < result.resultlist.size(); j++) { xmltext += QString(""). arg(nodenum).arg(QString(result.resultlist[j].symname.c_str())); xmltext += QString("").arg(subrootnum).arg(nodenum); dottext += QString("node%1 [label=\"%2\" style=filled fillcolor=\"#ffffff\" shape=\"box\" ];\n"). arg(nodenum).arg(QString(result.resultlist[j].symname.c_str())); dottext += QString("node%1 -> node%2;\n").arg(nodenum).arg(subrootnum); nodenum++; } } } for (i=0; i < result2.resultlist.size(); i++) { xmltext += QString(""). arg(nodenum).arg(QString(result2.resultlist[i].symname.c_str())); xmltext += QString("").arg(nodenum); dottext += QString("node%1 [label=\"%2\" style=filled fillcolor=\"#ffffff\" shape=\"box\" ];\n"). arg(nodenum).arg(QString(result2.resultlist[i].symname.c_str())); dottext += QString("node1 -> node%1;\n").arg(nodenum); subrootnum = nodenum; nodenum++; if (levels == 2) { result = search(qt2str(result2.resultlist[i].symname.c_str()), sqlresultCALLEDFUNC, exactmatch); for (j=0; j < result.resultlist.size(); j++) { xmltext += QString(""). arg(nodenum).arg(QString(result.resultlist[j].symname.c_str())); xmltext += QString("").arg(nodenum).arg(subrootnum); dottext += QString("node%1 [label=\"%2\" style=filled fillcolor=\"#ffffff\" shape=\"box\" ];\n"). arg(nodenum).arg(QString(result.resultlist[j].symname.c_str())); dottext += QString("node%1 -> node%2;\n").arg(subrootnum).arg(nodenum); nodenum++; } } } xmltext += ""; dottext += "}\n"; xmlout.append(xmltext); dotout.append(dottext); return true; } bool sqlqueryadv::search_classinheritgraph(QString searchstr, bool exactmatch, QStringList& xmlout, QStringList& dotout) { sqlqueryresultlist result_children, result_parent1, result_cousins1, result_parent2; QString xmltext = ""; QString dottext = "digraph graphname {\n"; int nodenum = 1; int parent1 = 0; xmltext += QString("").arg(nodenum).arg(searchstr); dottext += QString("node%1 [label=\"%2\" style=filled fillcolor=\"#e2ffff\" shape=\"box\" ];\n").arg(nodenum).arg(searchstr); nodenum++; result_children = search(qt2str(searchstr), sqlresultCHILDCLASS, exactmatch); if (result_children.result_type == sqlqueryresultlist::sqlresultERROR) { return false; } result_parent1 = search(qt2str(searchstr), sqlresultPARENTCLASS, exactmatch); if (result_parent1.result_type == sqlqueryresultlist::sqlresultERROR) { return false; } if (result_parent1.resultlist.size() > 0) { result_parent2 = search(result_parent1.resultlist[0].symname, sqlresultPARENTCLASS, exactmatch); if (result_parent2.result_type == sqlqueryresultlist::sqlresultERROR) { return false; } result_cousins1 = search(result_parent1.resultlist[0].symname, sqlresultCHILDCLASS, exactmatch); if (result_cousins1.result_type == sqlqueryresultlist::sqlresultERROR) { return false; } } unique_symnames(result_children); unique_symnames(result_parent1); unique_symnames(result_parent2); unique_symnames(result_cousins1); remove_symname(result_cousins1, qt2str(searchstr)); // I am not my own cousin for (unsigned int i=0; i < result_children.resultlist.size(); i++) { xmltext += QString(""). arg(nodenum).arg(QString(result_children.resultlist[i].symname.c_str())); xmltext += QString("").arg(nodenum); dottext += QString("node%1 [label=\"%2\" style=filled fillcolor=\"#ffffff\" shape=\"box\" ];\n"). arg(nodenum).arg(QString(result_children.resultlist[i].symname.c_str())); dottext += QString("node%1 -> node1 [arrowhead=\"empty\"];\n").arg(nodenum); nodenum++; } for (unsigned int i=0; i < result_parent1.resultlist.size(); i++) { xmltext += QString(""). arg(nodenum).arg(QString(result_parent1.resultlist[i].symname.c_str())); xmltext += QString("").arg(nodenum); dottext += QString("node%1 [label=\"%2\" style=filled fillcolor=\"#ffffff\" shape=\"box\" ];\n"). arg(nodenum).arg(QString(result_parent1.resultlist[i].symname.c_str())); dottext += QString("node1 -> node%1 [arrowhead=\"empty\"];\n").arg(nodenum); if (i == 0) parent1 = nodenum; nodenum++; } for (unsigned int i=0; i < result_parent2.resultlist.size(); i++) { xmltext += QString(""). arg(nodenum).arg(QString(result_parent2.resultlist[i].symname.c_str())); xmltext += QString("").arg(nodenum).arg(parent1); dottext += QString("node%1 [label=\"%2\" style=filled fillcolor=\"#ffffff\" shape=\"box\" ];\n"). arg(nodenum).arg(QString(result_parent2.resultlist[i].symname.c_str())); dottext += QString("node%1 -> node%2 [arrowhead=\"empty\"];\n").arg(parent1).arg(nodenum); nodenum++; } for (unsigned int i=0; i < result_cousins1.resultlist.size(); i++) { xmltext += QString(""). arg(nodenum).arg(QString(result_cousins1.resultlist[i].symname.c_str())); xmltext += QString("").arg(parent1).arg(nodenum); dottext += QString("node%1 [label=\"%2\" style=filled fillcolor=\"#ffffff\" shape=\"box\" ];\n"). arg(nodenum).arg(QString(result_cousins1.resultlist[i].symname.c_str())); dottext += QString("node%1 -> node%2 [arrowhead=\"empty\"];\n").arg(nodenum).arg(parent1); nodenum++; } xmltext += ""; dottext += "}\n"; xmlout.append(xmltext); dotout.append(dottext); return true; } // make the list of symnames unique, no elements repeated void sqlqueryadv::unique_symnames(sqlqueryresultlist& res) { QSet setstr; sqlqueryresultlist out; sqlqueryresult item; for(unsigned int i=0; i < res.resultlist.size(); i++) { setstr.insert(str2qt(res.resultlist[i].symname)); } QList lststr = setstr.toList(); for(int i=0; i < lststr.size(); i++) { item.symname = qt2str(lststr[i]); out.resultlist.push_back(item); } res = out; } // remove a symname from the list void sqlqueryadv::remove_symname(sqlqueryresultlist& res, tStr name) { std::vector::iterator it; for (it = res.resultlist.begin(); it != res.resultlist.end(); it++) { if (it->symname.compare(name) == 0) { res.resultlist.erase(it); break; } } } codequery-0.18.1/gui/sqlqueryadv.h000066400000000000000000000024561300045745200171250ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ #ifndef SQLQUERYADV_H_CQ #define SQLQUERYADV_H_CQ #include "sqlquery.h" class QString; // Advanced version of sqlquery to be GPL'ed class sqlqueryadv : public sqlquery { public: sqlqueryadv(); ~sqlqueryadv(); bool search_funcgraph(QString searchstr, bool exactmatch, QStringList& xmlout, QStringList& dotout, int levels = 1); bool search_classinheritgraph(QString searchstr, bool exactmatch, QStringList& xmlout, QStringList& dotout); void unique_symnames(sqlqueryresultlist& res); void remove_symname(sqlqueryresultlist& res, tStr name); }; #endif //SQLQUERYADV_H_CQ codequery-0.18.1/gui/std2qt.cpp000066400000000000000000000021631300045745200163140ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ #include "std2qt.h" QStringList strLst2qt(const tVecStr& inpLst) { QStringList res; unsigned int n = inpLst.size(); for(unsigned int i=0; i < n; i++) { res << str2qt(inpLst[i]); } return res; } tVecStr qt2strLst(const QStringList& inpLst) { tVecStr res; int n = inpLst.size(); res.reserve(n); for(int i=0; i < n; i++) { res.push_back(qt2str(inpLst[i])); } return res; } codequery-0.18.1/gui/std2qt.h000066400000000000000000000023611300045745200157610ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ #ifndef STD2QT_H_CQ #define STD2QT_H_CQ #include #include #include "small_lib.h" inline QString str2qt(const tStr& inp) #ifdef CQ_NO_QTSQL {return QString(inp.c_str());} #else {return QString::fromStdString(inp);} #endif QStringList strLst2qt(const tVecStr& inpLst); inline tStr qt2str(const QString& inp) #ifdef CQ_NO_QTSQL {return tStr((const char*) inp.toAscii().data());} #else {return inp.toStdString();} #endif tVecStr qt2strLst(const QStringList& inpLst); #endif //STD2QT_H_CQ codequery-0.18.1/gui/themes.cpp000066400000000000000000000076461300045745200163730ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ #include #include #include #include #include #include #include #include #include "small_lib.h" #include "fileviewer.h" #include "themes.h" typedef struct { const char *themename; const char *defaultfgcolor; const char *defaultbgcolor; const char *currentlinebgcolor; const char *linenumfgcolor; const lexstyle *lexstyletable; const lexstyle *globallexstyletable; int lexstylesize; int globallexstylesize; }langstyle; #include "themes_gen.cpp" QStringList themes::getThemesList(void) { QStringList lst; for(int i=0; i 0) { if (theme.compare(QString(lngstyle[i].themename)) == 0) { lxstyle = (lexstyle *) lngstyle[i].lexstyletable; globallxstyle = (lexstyle *) lngstyle[i].globallexstyletable; lxstylesize = lngstyle[i].lexstylesize; globallxstylesize = lngstyle[i].globallexstylesize; lexer->setPaper(QColor(QString("#").append(QString(lngstyle[i].defaultbgcolor)))); lexer->setColor(QColor(QString("#").append(QString(lngstyle[i].defaultfgcolor)))); lexer->setFont(font1); break; } i++; } setThemeStyle(lexer, globallxstyle, globallxstylesize, font1); setThemeStyle(lexer, lxstyle , lxstylesize , font1); curlinebgcolor = QColor(QString("#").append(QString(lngstyle[i].currentlinebgcolor))); linenumbgcolor = QColor(QString("#").append(QString(lngstyle[i].linenumfgcolor))); } void themes::setThemeStyle(QsciLexer* lexer, lexstyle *lxstyle, int lxstylesize, QFont& font1) { int i; if (lxstyle != NULL) for(i=0; isetPaper(QColor(QString("#").append(QString(lxstyle[i].bgcolor))), lxstyle[i].styleid); lexer->setColor(QColor(QString("#").append(QString(lxstyle[i].fgcolor))), lxstyle[i].styleid); switch(lxstyle[i].fontstyle) { case 1: font1.setBold(true); font1.setItalic(false); break; case 2: font1.setBold(false); font1.setItalic(true); break; case 3: font1.setBold(true); font1.setItalic(true); break; default: font1.setBold(false); font1.setItalic(false); break; } lexer->setFont(font1, lxstyle[i].styleid); } } codequery-0.18.1/gui/themes.h000066400000000000000000000024431300045745200160260ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ #ifndef THEMES_H_CQ #define THEMES_H_CQ #ifdef USE_QT5 #include #else #include #endif class QsciLexer; typedef struct { int styleid; const char *fgcolor; const char *bgcolor; int fontstyle; }lexstyle; class themes { public: static QStringList getThemesList(void); static void setTheme(const QString& theme, int lang, QsciLexer* lexer, const QFont& fontt, QColor& curlinebgcolor, QColor& linenumbgcolor); private: static void setThemeStyle(QsciLexer* lexer, lexstyle *lxstyle, int lxstylesize, QFont& font1); }; #endif // THEMES_H_CQ codequery-0.18.1/gui/themes/000077500000000000000000000000001300045745200156525ustar00rootroot00000000000000codequery-0.18.1/gui/themes/Bespin.xml000066400000000000000000002571611300045745200176300ustar00rootroot00000000000000 the_ID the_post have_posts wp_link_pages the_content $_POST $_GET $_SESSION alert appendChild arguments array blur checked childNodes className confirm dialogArguments event focus getElementById getElementsByTagName innerHTML keyCode length location null number parentNode push RegExp replace selectNodes selectSingleNode setAttribute split src srcElement test undefined value window XmlUtil loadXmlString TopologyXmlTree NotificationArea loadXmlFile debug param @projectDescription projectDescription @param import import endfunction endif ContentScroller onMotionChanged onMotionFinished Tween ImagesStrip ContentScroller mx transitions easing Sprite Point MouseEvent Event BitmapData Timer TimerEvent addEventListener event x y height width True False if else for while bool long int char if else for while bool long int char codequery-0.18.1/gui/themes/Black_board.xml000066400000000000000000002540151300045745200205660ustar00rootroot00000000000000 endfunction endif True False if else for while bool long int char codequery-0.18.1/gui/themes/Choco.xml000066400000000000000000002544661300045745200174500ustar00rootroot00000000000000 ooooo endfunction endif True False if else for while bool long int char if else for while bool long int char codequery-0.18.1/gui/themes/Deep_Black.xml000066400000000000000000002502131300045745200203500ustar00rootroot00000000000000 endfunction endif True False if else for while bool long int char if else for while bool long int char if else for while bool long int char codequery-0.18.1/gui/themes/Eclipse_Default.xml000066400000000000000000002513171300045745200214350ustar00rootroot00000000000000 if else for while bool long int char codequery-0.18.1/gui/themes/Hello_Kitty.xml000066400000000000000000002506711300045745200206360ustar00rootroot00000000000000 endfunction endif True False if else for while bool long int char if else for while bool long int char codequery-0.18.1/gui/themes/HotFudgeSundae.xml000066400000000000000000003064571300045745200212600ustar00rootroot00000000000000 param @projectDescription projectDescription @param codequery-0.18.1/gui/themes/Mono_Industrial.xml000066400000000000000000002534561300045745200215210ustar00rootroot00000000000000 if else for while bool long int char codequery-0.18.1/gui/themes/Monokai.xml000066400000000000000000002511411300045745200177750ustar00rootroot00000000000000 if else for while bool long int char codequery-0.18.1/gui/themes/MossyLawn.xml000066400000000000000000003065541300045745200203450ustar00rootroot00000000000000 param @projectDescription projectDescription @param codequery-0.18.1/gui/themes/Navajo.xml000066400000000000000000003063271300045745200176250ustar00rootroot00000000000000 param @projectDescription projectDescription @param codequery-0.18.1/gui/themes/NotepadPlusPlus.xml000066400000000000000000002727061300045745200215140ustar00rootroot00000000000000 codequery-0.18.1/gui/themes/Obsidian.xml000066400000000000000000002554501300045745200201370ustar00rootroot00000000000000 endfunction endif True False if else for while bool long int char if else for while bool long int char if else for while bool long int char if else for while bool long int char codequery-0.18.1/gui/themes/Plastic_Code_Wrap.xml000066400000000000000000002534571300045745200217360ustar00rootroot00000000000000 if else for while bool long int char codequery-0.18.1/gui/themes/Ruby_Blue.xml000066400000000000000000002070021300045745200202650ustar00rootroot00000000000000 if else for while bool long int char codequery-0.18.1/gui/themes/Solarized.xml000066400000000000000000003075071300045745200203440ustar00rootroot00000000000000 param @projectDescription projectDescription @param codequery-0.18.1/gui/themes/Solarized_light.xml000066400000000000000000003075231300045745200215310ustar00rootroot00000000000000 param @projectDescription projectDescription @param codequery-0.18.1/gui/themes/Twilight.xml000066400000000000000000002534501300045745200202000ustar00rootroot00000000000000 raise if else for while bool long int char codequery-0.18.1/gui/themes/Vibrant_Ink.xml000066400000000000000000002472521300045745200206160ustar00rootroot00000000000000 if else for while bool long int char codequery-0.18.1/gui/themes/Zenburn.xml000066400000000000000000002740721300045745200200330ustar00rootroot00000000000000 codequery-0.18.1/gui/themes/khaki.xml000066400000000000000000003064551300045745200175000ustar00rootroot00000000000000 param @projectDescription projectDescription @param codequery-0.18.1/gui/themes/parse_themes.pl000066400000000000000000000167501300045745200206770ustar00rootroot00000000000000#!/usr/bin/perl # Process theme XML files, to generate C++ code # # This license applies only to this file: # # Copyright (c) 2014 ruben2020 # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to # deal in the Software without restriction, including without limitation the # rights to use, copy, modify, merge, publish, distribute, sublicense, and/or # sell copies of the Software, and to permit persons to whom the Software is # furnished to do so, subject to the following conditions: # # The above copyright notice and this permission notice shall be included in # all copies or substantial portions of the Software. # # THE SOTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR # IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, # FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE # AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER # LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING # FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS # IN THE SOFTWARE. # use strict; use XML::LibXML; my $debug = 0; my $themelist; my $numOfThemes = 0; my $lexstyle; my $cppstyle; my $javastyle; my $pythonstyle; my $rubystyle; my $javascriptstyle; my $langname; my $langdesc; my $themename; my $themename2; my @themes; my $defaultbgcolor; my $defaultfgcolor; my $defaultfontstyle; my $currentlinebgcolor; my $linenumfgcolor; my $stylename; my $styleid; my $fgcolor; my $bgcolor; my $fontstyle; my %acceptedlang = ( 'C++' => 'cpp', 'Java' => 'java', 'Python' => 'python', 'Ruby' => 'ruby', 'Javascript' => 'javascript' ); my $filename; my $parser; my $xmldoc; $themelist .= "static const char* themelist[] = {\n"; $cppstyle .= "static const langstyle cppstyle[] = {\n"; $javastyle .= "static const langstyle javastyle[] = {\n"; $pythonstyle .= "static const langstyle pythonstyle[] = {\n"; $rubystyle .= "static const langstyle rubystyle[] = {\n"; $javascriptstyle .= "static const langstyle javascriptstyle[] = {\n"; opendir(DIR1, '.'); while($filename = readdir(DIR1)) { $themename = ''; if ((-f $filename )&&($filename =~ /\.xml$/i)) { $themename = $filename; $themename =~ s/\.xml$//i; $themename2 = $themename; $themename2 =~ s/_/ /g; print "\n ==> $themename\n" if ($debug); push @themes, $themename2; processfile(); $numOfThemes++; } } close(DIR1); @themes = sort {lc $a cmp lc $b} @themes; foreach my $them(@themes) { $themelist .= "\t\"$them\",\n"; } $themelist .= "};\n\n"; $cppstyle .= "\t{ NULL, NULL, NULL, 0 }\n};\n\n"; $javastyle .= "\t{ NULL, NULL, NULL, 0 }\n};\n\n"; $pythonstyle .= "\t{ NULL, NULL, NULL, 0 }\n};\n\n"; $rubystyle .= "\t{ NULL, NULL, NULL, 0 }\n};\n\n"; $javascriptstyle .= "\t{ NULL, NULL, NULL, 0 }\n};\n\n"; open(FILO,">themes_gen.cpp"); print FILO "\n /* THIS FILE WAS AUTO_GENERATED USING parse_themes.pl */"; print FILO "\n /* DO NOT CHANGE BY HAND */\n\n"; print FILO "#define NUM_OF_THEMES $numOfThemes\n\n"; print FILO $themelist; print FILO $lexstyle."\n"; print FILO $cppstyle; print FILO $javastyle; print FILO $pythonstyle; print FILO $rubystyle; print FILO $javascriptstyle; close(FILO); ################################################ sub processfile { $parser = XML::LibXML->new(); $xmldoc = $parser->parse_file($filename); my $lstyle; my $numofstyles=0; my $numofglobalstyles=0; $currentlinebgcolor = ''; $linenumfgcolor = ''; foreach my $sample ( $xmldoc->findnodes('/NotepadPlus/GlobalStyles') ) { $lexstyle .= "\nstatic const lexstyle global_".$themename."[] = {\n"; $defaultbgcolor = ''; $defaultfgcolor = ''; $defaultfontstyle = ''; $numofglobalstyles = 0; foreach my $child ( $sample->getChildnodes ) { if (( $child->nodeType() == XML_ELEMENT_NODE )&&($child->nodeName() eq 'WidgetStyle')) { $stylename = ''; $styleid = ''; $fgcolor = ''; $bgcolor = ''; $fontstyle = ''; $stylename = $child->getAttribute('name') if ($child->hasAttribute('name')); $styleid = $child->getAttribute('styleID') if ($child->hasAttribute('styleID')); $fgcolor = $child->getAttribute('fgColor') if ($child->hasAttribute('fgColor')); $bgcolor = $child->getAttribute('bgColor') if ($child->hasAttribute('bgColor')); $fontstyle = $child->getAttribute('fontStyle') if ($child->hasAttribute('fontStyle')); if ($stylename eq 'Current line background colour') {$currentlinebgcolor = $bgcolor;} if ($styleid eq '33') {$linenumfgcolor = $fgcolor;} if ($styleid eq '0') {next;} $defaultbgcolor = $bgcolor if ($stylename eq 'Default Style'); $defaultfgcolor = $fgcolor if ($stylename eq 'Default Style'); $defaultfontstyle = $fontstyle if ($stylename eq 'Default Style'); $defaultfontstyle = "0" if (length($defaultfontstyle) == 0); $bgcolor = $defaultbgcolor if (length($bgcolor) == 0); $fgcolor = $defaultfgcolor if (length($fgcolor) == 0); $fontstyle = $defaultfontstyle if (length($fontstyle) == 0); print "$stylename, $styleid, $fgcolor, $bgcolor, $fontstyle\n" if ($debug); $lexstyle .= "\t{ $styleid, \"$fgcolor\", \"$bgcolor\", $fontstyle }, // $stylename\n"; $numofglobalstyles++; } } $lexstyle .= "};\n\n"; } foreach my $sample ( $xmldoc->findnodes('/NotepadPlus/LexerStyles/LexerType') ) { $langname = ''; $langdesc = ''; $langname = $sample->getAttribute('name') if ($sample->hasAttribute('name')); $langdesc = $sample->getAttribute('desc') if ($sample->hasAttribute('desc')); next if (!(defined($acceptedlang{$langdesc}))); print "\n$langname, $langdesc\n" if ($debug); $lexstyle .= "\nstatic const lexstyle ".$langname."_".$themename."[] = {\n"; $numofstyles = 0; foreach my $child ( $sample->getChildnodes ) { if (( $child->nodeType() == XML_ELEMENT_NODE )&&($child->nodeName() eq 'WordsStyle')) { $stylename = ''; $styleid = ''; $fgcolor = ''; $bgcolor = ''; $fontstyle = ''; $stylename = $child->getAttribute('name') if ($child->hasAttribute('name')); $styleid = $child->getAttribute('styleID') if ($child->hasAttribute('styleID')); $fgcolor = $child->getAttribute('fgColor') if ($child->hasAttribute('fgColor')); $bgcolor = $child->getAttribute('bgColor') if ($child->hasAttribute('bgColor')); $fontstyle = $child->getAttribute('fontStyle') if ($child->hasAttribute('fontStyle')); $defaultbgcolor = $bgcolor if ($stylename eq 'DEFAULT'); $defaultfgcolor = $fgcolor if ($stylename eq 'DEFAULT'); $defaultfontstyle = $fontstyle if ($stylename eq 'DEFAULT'); $defaultfontstyle = "0" if (length($defaultfontstyle) == 0); $bgcolor = $defaultbgcolor if (length($bgcolor) == 0); $fgcolor = $defaultfgcolor if (length($fgcolor) == 0); $fontstyle = $defaultfontstyle if (length($fontstyle) == 0); print "$stylename, $styleid, $fgcolor, $bgcolor, $fontstyle\n" if ($debug); $lexstyle .= "\t{ $styleid, \"$fgcolor\", \"$bgcolor\", $fontstyle }, // $stylename\n"; $numofstyles++; } } $lexstyle .= "};\n"; $lstyle = " { \"$themename2\", \"$defaultfgcolor\", \"$defaultbgcolor\", \"$currentlinebgcolor\", \"$linenumfgcolor\", ".$langname."_".$themename.", global_".$themename.", $numofstyles, $numofglobalstyles },\n"; $cppstyle .= $lstyle if ($langdesc eq 'C++'); $javastyle .= $lstyle if ($langdesc eq 'Java'); $pythonstyle .= $lstyle if ($langdesc eq 'Python'); $rubystyle .= $lstyle if ($langdesc eq 'Ruby'); $javascriptstyle .= $lstyle if ($langdesc eq 'Javascript'); } } codequery-0.18.1/gui/themes/vim_Dark_Blue.xml000066400000000000000000002475561300045745200211220ustar00rootroot00000000000000 endfunction endif True False if else for while bool long int char codequery-0.18.1/gui/themes_gen.cpp000066400000000000000000003427001300045745200172150ustar00rootroot00000000000000 /* THIS FILE WAS AUTO_GENERATED USING parse_themes.pl */ /* DO NOT CHANGE BY HAND */ #define NUM_OF_THEMES 22 static const char* themelist[] = { "Bespin", "Black board", "Choco", "Deep Black", "Eclipse Default", "Hello Kitty", "HotFudgeSundae", "khaki", "Mono Industrial", "Monokai", "MossyLawn", "Navajo", "NotepadPlusPlus", "Obsidian", "Plastic Code Wrap", "Ruby Blue", "Solarized", "Solarized light", "Twilight", "Vibrant Ink", "vim Dark Blue", "Zenburn", }; static const lexstyle global_Monokai[] = { { 32, "F8F8F2", "272822", 0 }, // Default Style { 37, "888A85", "272822", 0 }, // Indent guideline style { 34, "FCE94F", "272822", 1 }, // Brace highlight style { 35, "EF2929", "272822", 0 }, // Bad brace colour { 2069, "F8F8F0", "272822", 0 }, // Caret colour { 31, "CC0000", "EDD400", 0 }, // Find Mark Style { 33, "EEEEEC", "2E3436", 0 }, // Line number margin { 29, "555753", "00FF00", 0 }, // Smart HighLighting { 31, "FCAF3E", "FF0000", 0 }, // Find Mark Style { 25, "F8F8F2", "00FFFF", 0 }, // Mark Style 1 { 24, "F8F8F2", "FF8000", 0 }, // Mark Style 2 { 23, "F8F8F2", "FFFF00", 0 }, // Mark Style 3 { 22, "F8F8F2", "8000FF", 0 }, // Mark Style 4 { 21, "F8F8F2", "008000", 0 }, // Mark Style 5 { 28, "FFCAB0", "0080FF", 0 }, // Incremental highlight all { 27, "000000", "8000FF", 0 }, // Tags match highlighting { 26, "8080C0", "FFFF00", 0 }, // Tags attribute }; static const lexstyle cpp_Monokai[] = { { 9, "F92672", "272822", 0 }, // PREPROCESSOR { 11, "F8F8F2", "272822", 0 }, // DEFAULT { 5, "66D9EF", "272822", 0 }, // INSTRUCTION WORD { 16, "F92672", "272822", 0 }, // TYPE WORD { 4, "AE81FF", "272822", 0 }, // NUMBER { 6, "E6DB74", "272822", 0 }, // STRING { 7, "E6DB74", "272822", 0 }, // CHARACTER { 10, "F92672", "272822", 0 }, // OPERATOR { 13, "AE81FF", "272822", 0 }, // VERBATIM { 14, "E6DB74", "272822", 0 }, // REGEX { 1, "75715E", "272822", 0 }, // COMMENT { 2, "75715E", "272822", 0 }, // COMMENT LINE { 3, "75715E", "272822", 0 }, // COMMENT DOC { 15, "75715E", "272822", 0 }, // COMMENT LINE DOC { 17, "75715E", "272822", 0 }, // COMMENT DOC KEYWORD { 18, "75715E", "272822", 0 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle java_Monokai[] = { { 9, "F92672", "272822", 0 }, // PREPROCESSOR { 11, "F8F8F2", "272822", 0 }, // DEFAULT { 5, "66D9EF", "272822", 0 }, // INSTRUCTION WORD { 16, "F92672", "272822", 0 }, // TYPE WORD { 4, "AE81FF", "272822", 0 }, // NUMBER { 6, "E6DB74", "272822", 0 }, // STRING { 7, "E6DB74", "272822", 0 }, // CHARACTER { 10, "F92672", "272822", 0 }, // OPERATOR { 13, "AE81FF", "272822", 0 }, // VERBATIM { 14, "E6DB74", "272822", 0 }, // REGEX { 1, "75715E", "272822", 0 }, // COMMENT { 2, "75715E", "272822", 0 }, // COMMENT LINE { 3, "75715E", "272822", 0 }, // COMMENT DOC { 15, "75715E", "272822", 0 }, // COMMENT LINE DOC { 17, "75715E", "272822", 0 }, // COMMENT DOC KEYWORD { 18, "75715E", "272822", 0 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle javascript_Monokai[] = { { 41, "F8F8F2", "272822", 0 }, // DEFAULT { 45, "AE81FF", "272822", 0 }, // NUMBER { 46, "F8F8F2", "272822", 0 }, // WORD { 47, "F92672", "272822", 0 }, // KEYWORD { 48, "E6DB74", "272822", 0 }, // DOUBLESTRING { 49, "E6DB74", "272822", 0 }, // SINGLESTRING { 50, "F8F8F2", "272822", 0 }, // SYMBOLS { 51, "E6DB74", "272822", 0 }, // STRINGEOL { 52, "E6DB74", "272822", 0 }, // REGEX { 42, "75715E", "272822", 0 }, // COMMENT { 43, "75715E", "272822", 0 }, // COMMENTLINE { 44, "75715E", "272822", 0 }, // COMMENTDOC }; static const lexstyle python_Monokai[] = { { 0, "F8F8F2", "272822", 0 }, // DEFAULT { 1, "75715E", "272822", 0 }, // COMMENTLINE { 2, "AE81FF", "272822", 0 }, // NUMBER { 3, "E6DB74", "272822", 0 }, // STRING { 4, "E6DB74", "272822", 0 }, // CHARACTER { 5, "F92672", "272822", 0 }, // KEYWORDS { 6, "F8F8F2", "272822", 0 }, // TRIPLE { 7, "F8F8F2", "272822", 0 }, // TRIPLEDOUBLE { 8, "F8F8F2", "272822", 0 }, // CLASSNAME { 9, "F8F8F2", "272822", 0 }, // DEFNAME { 10, "F92672", "272822", 0 }, // OPERATOR { 11, "66D9EF", "272822", 0 }, // IDENTIFIER { 12, "75715E", "272822", 0 }, // COMMENTBLOCK { 12, "E6DB74", "272822", 0 }, // STRINGEOL }; static const lexstyle ruby_Monokai[] = { { 0, "F8F8F2", "272822", 0 }, // DEFAULT { 1, "F8F8F2", "272822", 0 }, // ERROR { 2, "75715E", "272822", 0 }, // COMMENTLINE { 3, "F8F8F2", "272822", 0 }, // POD { 4, "AE81FF", "272822", 0 }, // NUMBER { 5, "F92672", "272822", 0 }, // INSTRUCTION { 6, "E6DB74", "272822", 0 }, // STRING { 7, "E6DB74", "272822", 0 }, // CHARACTER { 8, "F8F8F2", "272822", 0 }, // CLASS NAME { 9, "A6E22E", "272822", 0 }, // DEF NAME { 10, "F92672", "272822", 0 }, // OPERATOR { 11, "66D9EF", "272822", 0 }, // IDENTIFIER { 12, "E6DB74", "272822", 0 }, // REGEX { 13, "F8F8F2", "272822", 0 }, // GLOBAL { 14, "F8F8F2", "272822", 0 }, // SYMBOL { 15, "F8F8F2", "272822", 0 }, // MODULE NAME { 16, "F8F8F2", "272822", 0 }, // INSTANCE VAR { 17, "F8F8F2", "272822", 0 }, // CLASS VAR { 18, "F8F8F2", "272822", 0 }, // BACKTICKS { 19, "F8F8F2", "272822", 0 }, // DATA SECTION { 24, "E6DB74", "272822", 0 }, // STRING Q }; static const lexstyle global_Vibrant_Ink[] = { { 32, "FFFFFF", "000000", 0 }, // Default Style { 37, "C0C0C0", "000000", 0 }, // Indent guideline style { 34, "99CC99", "000000", 1 }, // Brace highlight style { 35, "CCFF33", "000000", 0 }, // Bad brace colour { 2069, "FFFFFF", "112435", 0 }, // Caret colour { 31, "FFFF00", "FF0000", 1 }, // Find Mark Style { 33, "E4E4E4", "333333", 0 }, // Line number margin { 29, "555753", "00FF00", 0 }, // Smart HighLighting { 31, "FCAF3E", "FF0000", 0 }, // Find Mark Style { 25, "FFFFFF", "00FFFF", 0 }, // Mark Style 1 { 24, "FFFFFF", "FF8000", 0 }, // Mark Style 2 { 23, "FFFFFF", "FFFF00", 0 }, // Mark Style 3 { 22, "FFFFFF", "8000FF", 0 }, // Mark Style 4 { 21, "FFFFFF", "008000", 0 }, // Mark Style 5 { 28, "FFCAB0", "0080FF", 0 }, // Incremental highlight all { 27, "000000", "8000FF", 0 }, // Tags match highlighting { 26, "8080C0", "FFFF00", 0 }, // Tags attribute }; static const lexstyle cpp_Vibrant_Ink[] = { { 9, "EDF8F9", "000000", 0 }, // PREPROCESSOR { 11, "FFFFFF", "000000", 0 }, // DEFAULT { 5, "FF6600", "000000", 1 }, // INSTRUCTION WORD { 16, "66FF00", "000000", 0 }, // TYPE WORD { 4, "FF8000", "000000", 0 }, // NUMBER { 6, "66FF00", "000000", 0 }, // STRING { 7, "66FF00", "000000", 0 }, // CHARACTER { 10, "FFCC00", "000000", 1 }, // OPERATOR { 13, "FFFFFF", "000000", 0 }, // VERBATIM { 14, "FFFFFF", "000000", 1 }, // REGEX { 1, "9933CC", "000000", 0 }, // COMMENT { 2, "9933CC", "000000", 0 }, // COMMENT LINE { 3, "9933CC", "000000", 0 }, // COMMENT DOC { 15, "9933CC", "000000", 0 }, // COMMENT LINE DOC { 17, "9933CC", "000000", 1 }, // COMMENT DOC KEYWORD { 18, "9933CC", "000000", 0 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle java_Vibrant_Ink[] = { { 9, "EDF8F9", "000000", 0 }, // PREPROCESSOR { 11, "FFFFFF", "000000", 0 }, // DEFAULT { 5, "FF6600", "000000", 1 }, // INSTRUCTION WORD { 16, "66FF00", "000000", 0 }, // TYPE WORD { 4, "FF8000", "000000", 0 }, // NUMBER { 6, "66FF00", "000000", 0 }, // STRING { 7, "66FF00", "000000", 0 }, // CHARACTER { 10, "FFCC00", "000000", 1 }, // OPERATOR { 13, "FFFFFF", "000000", 0 }, // VERBATIM { 14, "FFFFFF", "000000", 1 }, // REGEX { 1, "9933CC", "000000", 0 }, // COMMENT { 2, "9933CC", "000000", 0 }, // COMMENT LINE { 3, "9933CC", "000000", 0 }, // COMMENT DOC { 15, "9933CC", "000000", 0 }, // COMMENT LINE DOC { 17, "9933CC", "000000", 1 }, // COMMENT DOC KEYWORD { 18, "9933CC", "000000", 0 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle javascript_Vibrant_Ink[] = { { 41, "FFFFFF", "000000", 0 }, // DEFAULT { 45, "99CC99", "000000", 0 }, // NUMBER { 46, "FF6600", "000000", 0 }, // WORD { 47, "FFCC00", "000000", 3 }, // KEYWORD { 48, "FFFF00", "000000", 0 }, // DOUBLESTRING { 49, "FFFF00", "000000", 0 }, // SINGLESTRING { 50, "999966", "000000", 1 }, // SYMBOLS { 51, "CCCCCC", "000000", 1 }, // STRINGEOL { 52, "339999", "000000", 0 }, // REGEX { 42, "9933CC", "000000", 0 }, // COMMENT { 43, "9933CC", "000000", 0 }, // COMMENTLINE { 44, "772CB7", "070707", 0 }, // COMMENTDOC }; static const lexstyle python_Vibrant_Ink[] = { { 0, "FFFFFF", "000000", 0 }, // DEFAULT { 1, "9933CC", "000000", 0 }, // COMMENTLINE { 2, "99CC99", "000000", 0 }, // NUMBER { 3, "66FF00", "000000", 0 }, // STRING { 4, "66FF00", "000000", 0 }, // CHARACTER { 5, "FF6600", "000000", 1 }, // KEYWORDS { 6, "FF8000", "000000", 0 }, // TRIPLE { 7, "FFFFFF", "000000", 0 }, // TRIPLEDOUBLE { 8, "FFFFFF", "000000", 1 }, // CLASSNAME { 9, "FF00FF", "000000", 0 }, // DEFNAME { 10, "FFCC00", "000000", 1 }, // OPERATOR { 11, "FFFFFF", "000000", 0 }, // IDENTIFIER { 12, "9933CC", "000000", 0 }, // COMMENTBLOCK { 12, "FFFF00", "000000", 0 }, // STRINGEOL }; static const lexstyle ruby_Vibrant_Ink[] = { { 0, "FFFFFF", "000000", 0 }, // DEFAULT { 1, "FFFFFF", "000000", 0 }, // ERROR { 2, "9933CC", "000000", 0 }, // COMMENTLINE { 3, "004000", "C0FFC0", 0 }, // POD { 4, "FF8000", "000000", 0 }, // NUMBER { 5, "FF6600", "000000", 1 }, // INSTRUCTION { 6, "66FF00", "000000", 0 }, // STRING { 7, "808000", "000000", 0 }, // CHARACTER { 8, "0080C0", "000000", 1 }, // CLASS NAME { 9, "8080FF", "FFFFCC", 1 }, // DEF NAME { 10, "FFCC00", "000000", 1 }, // OPERATOR { 11, "FFFFFF", "000000", 0 }, // IDENTIFIER { 12, "339999", "000000", 0 }, // REGEX { 13, "FFCC00", "000000", 1 }, // GLOBAL { 14, "FFFFFF", "000000", 0 }, // SYMBOL { 15, "EDF8F9", "000000", 1 }, // MODULE NAME { 16, "FFFFFF", "000000", 0 }, // INSTANCE VAR { 17, "FFFFFF", "000000", 0 }, // CLASS VAR { 18, "FFFF00", "A08080", 0 }, // BACKTICKS { 19, "600000", "FFF0D8", 0 }, // DATA SECTION { 24, "66FF00", "000000", 0 }, // STRING Q }; static const lexstyle global_Solarized_light[] = { { 32, "657B83", "FDF6E3", 0 }, // Default Style { 37, "93A1A1", "FDF6E3", 0 }, // Indent guideline style { 34, "DC322F", "859900", 1 }, // Brace highlight style { 35, "D33682", "FDF6E3", 0 }, // Bad brace colour { 2069, "073642", "FDF6E3", 0 }, // Caret colour { 33, "93A1A1", "EEE8D5", 0 }, // Line number margin { 29, "657B83", "002B36", 0 }, // Smart HighLighting { 31, "657B83", "6C71C4", 0 }, // Find Mark Style { 25, "657B83", "DC322F", 0 }, // Mark Style 1 { 24, "657B83", "268BD2", 0 }, // Mark Style 2 { 23, "657B83", "2AA198", 0 }, // Mark Style 3 { 22, "657B83", "859900", 0 }, // Mark Style 4 { 21, "657B83", "B58900", 0 }, // Mark Style 5 { 28, "657B83", "FDF6E3", 0 }, // Incremental highlight all { 27, "657B83", "CB4B16", 0 }, // Tags match highlighting { 26, "657B83", "CB4B16", 0 }, // Tags attribute }; static const lexstyle cpp_Solarized_light[] = { { 9, "DC322F", "FDF6E3", 0 }, // PREPROCESSOR { 11, "657B83", "FDF6E3", 0 }, // DEFAULT { 5, "859900", "FDF6E3", 0 }, // INSTRUCTION WORD { 16, "B58900", "FDF6E3", 0 }, // TYPE WORD { 4, "2AA198", "FDF6E3", 0 }, // NUMBER { 6, "2AA198", "FDF6E3", 0 }, // STRING { 7, "2AA198", "FDF6E3", 0 }, // CHARACTER { 10, "586E75", "FDF6E3", 0 }, // OPERATOR { 13, "2AA198", "FDF6E3", 0 }, // VERBATIM { 14, "268BD2", "FDF6E3", 0 }, // REGEX { 1, "93A1A1", "FDF6E3", 2 }, // COMMENT { 2, "93A1A1", "FDF6E3", 2 }, // COMMENT LINE { 3, "93A1A1", "FDF6E3", 2 }, // COMMENT DOC { 15, "93A1A1", "FDF6E3", 2 }, // COMMENT LINE DOC { 17, "93A1A1", "FDF6E3", 3 }, // COMMENT DOC KEYWORD { 18, "D33682", "FDF6E3", 3 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle java_Solarized_light[] = { { 9, "DC322F", "FDF6E3", 0 }, // PREPROCESSOR { 11, "657B83", "FDF6E3", 0 }, // DEFAULT { 5, "859900", "FDF6E3", 0 }, // INSTRUCTION WORD { 16, "B58900", "FDF6E3", 0 }, // TYPE WORD { 4, "2AA198", "FDF6E3", 0 }, // NUMBER { 6, "2AA198", "FDF6E3", 0 }, // STRING { 7, "2AA198", "FDF6E3", 0 }, // CHARACTER { 10, "586E75", "FDF6E3", 0 }, // OPERATOR { 13, "2AA198", "FDF6E3", 0 }, // VERBATIM { 14, "268BD2", "FDF6E3", 0 }, // REGEX { 1, "93A1A1", "FDF6E3", 2 }, // COMMENT { 2, "93A1A1", "FDF6E3", 2 }, // COMMENT LINE { 3, "93A1A1", "FDF6E3", 2 }, // COMMENT DOC { 15, "93A1A1", "FDF6E3", 2 }, // COMMENT LINE DOC { 17, "268BD2", "FDF6E3", 3 }, // COMMENT DOC KEYWORD { 18, "D33682", "FDF6E3", 3 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle javascript_Solarized_light[] = { { 41, "657B83", "FDF6E3", 0 }, // DEFAULT { 45, "2AA198", "FDF6E3", 0 }, // NUMBER { 46, "B58900", "FDF6E3", 0 }, // WORD { 47, "859900", "FDF6E3", 0 }, // KEYWORD { 48, "2AA198", "FDF6E3", 0 }, // DOUBLESTRING { 49, "2AA198", "FDF6E3", 0 }, // SINGLESTRING { 50, "657B83", "FDF6E3", 0 }, // SYMBOLS { 51, "DC322F", "FDF6E3", 0 }, // STRINGEOL { 52, "268BD2", "FDF6E3", 0 }, // REGEX { 42, "93A1A1", "FDF6E3", 2 }, // COMMENT { 43, "93A1A1", "FDF6E3", 2 }, // COMMENTLINE { 44, "93A1A1", "FDF6E3", 2 }, // COMMENTDOC { 17, "268BD2", "FDF6E3", 3 }, // COMMENT DOC KEYWORD { 18, "D33682", "FDF6E3", 3 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle python_Solarized_light[] = { { 0, "657B83", "FDF6E3", 0 }, // DEFAULT { 1, "93A1A1", "FDF6E3", 2 }, // COMMENTLINE { 2, "2AA198", "FDF6E3", 0 }, // NUMBER { 3, "2AA198", "FDF6E3", 0 }, // STRING { 4, "2AA198", "FDF6E3", 0 }, // CHARACTER { 5, "859900", "FDF6E3", 0 }, // KEYWORDS { 6, "2AA198", "FDF6E3", 0 }, // TRIPLE { 7, "2AA198", "FDF6E3", 0 }, // TRIPLEDOUBLE { 8, "CB4B16", "FDF6E3", 0 }, // CLASSNAME { 9, "CB4B16", "FDF6E3", 0 }, // DEFNAME { 10, "586E75", "FDF6E3", 0 }, // OPERATOR { 11, "B58900", "FDF6E3", 0 }, // IDENTIFIER { 12, "93A1A1", "FDF6E3", 2 }, // COMMENTBLOCK { 12, "93A1A1", "FDF6E3", 0 }, // STRINGEOL }; static const lexstyle ruby_Solarized_light[] = { { 0, "657B83", "FDF6E3", 0 }, // DEFAULT { 1, "DC322F", "FDF6E3", 0 }, // ERROR { 2, "93A1A1", "FDF6E3", 2 }, // COMMENTLINE { 3, "657B83", "FDF6E3", 2 }, // POD { 4, "2AA198", "FDF6E3", 0 }, // NUMBER { 5, "859900", "FDF6E3", 0 }, // INSTRUCTION { 6, "2AA198", "FDF6E3", 0 }, // STRING { 7, "2AA198", "FDF6E3", 0 }, // CHARACTER { 8, "B58900", "FDF6E3", 0 }, // CLASS NAME { 9, "268BD2", "FDF6E3", 0 }, // DEF NAME { 10, "586E75", "FDF6E3", 0 }, // OPERATOR { 11, "B58900", "FDF6E3", 0 }, // IDENTIFIER { 12, "268BD2", "FDF6E3", 0 }, // REGEX { 13, "B58900", "FDF6E3", 0 }, // GLOBAL { 14, "657B83", "FDF6E3", 0 }, // SYMBOL { 15, "CB4B16", "FDF6E3", 0 }, // MODULE NAME { 16, "B58900", "FDF6E3", 0 }, // INSTANCE VAR { 17, "657B83", "FDF6E3", 0 }, // CLASS VAR { 18, "073642", "6C71C4", 0 }, // BACKTICKS { 19, "2AA198", "FDF6E3", 0 }, // DATA SECTION { 24, "2AA198", "FDF6E3", 0 }, // STRING Q { 25, "268BD2", "FDF6E3", 0 }, // BOOLEAN }; static const lexstyle global_Twilight[] = { { 32, "F8F8F8", "141414", 0 }, // Default Style { 37, "888A85", "141414", 0 }, // Indent guideline style { 34, "FCE94F", "141414", 1 }, // Brace highlight style { 35, "EF2929", "141414", 0 }, // Bad brace colour { 2069, "A7A7A7", "141414", 0 }, // Caret colour { 31, "CC0000", "EDD400", 0 }, // Find Mark Style { 33, "EEEEEC", "2E3436", 0 }, // Line number margin { 29, "555753", "00FF00", 0 }, // Smart HighLighting { 31, "FCAF3E", "FF0000", 0 }, // Find Mark Style { 25, "F8F8F8", "00FFFF", 0 }, // Mark Style 1 { 24, "F8F8F8", "FF8000", 0 }, // Mark Style 2 { 23, "F8F8F8", "FFFF00", 0 }, // Mark Style 3 { 22, "F8F8F8", "8000FF", 0 }, // Mark Style 4 { 21, "F8F8F8", "008000", 0 }, // Mark Style 5 { 28, "FFCAB0", "0080FF", 0 }, // Incremental highlight all { 27, "000000", "8000FF", 0 }, // Tags match highlighting { 26, "8080C0", "FFFF00", 0 }, // Tags attribute }; static const lexstyle cpp_Twilight[] = { { 9, "8996A8", "141414", 0 }, // PREPROCESSOR { 11, "F8F8F8", "141414", 0 }, // DEFAULT { 5, "F9EE98", "141414", 0 }, // INSTRUCTION WORD { 16, "CDA869", "141414", 0 }, // TYPE WORD { 4, "CF6A4C", "141414", 0 }, // NUMBER { 6, "8F9D6A", "141414", 0 }, // STRING { 7, "8F9D6A", "141414", 0 }, // CHARACTER { 10, "CDA869", "141414", 0 }, // OPERATOR { 13, "CF6A4C", "141414", 0 }, // VERBATIM { 14, "E9C062", "141414", 0 }, // REGEX { 1, "5F5A60", "141414", 0 }, // COMMENT { 2, "5F5A60", "141414", 0 }, // COMMENT LINE { 3, "5F5A60", "141414", 0 }, // COMMENT DOC { 15, "5F5A60", "141414", 0 }, // COMMENT LINE DOC { 17, "5F5A60", "141414", 0 }, // COMMENT DOC KEYWORD { 18, "5F5A60", "141414", 0 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle java_Twilight[] = { { 9, "8996A8", "141414", 0 }, // PREPROCESSOR { 11, "F8F8F8", "141414", 0 }, // DEFAULT { 5, "F9EE98", "141414", 0 }, // INSTRUCTION WORD { 16, "CDA869", "141414", 0 }, // TYPE WORD { 4, "CF6A4C", "141414", 0 }, // NUMBER { 6, "8F9D6A", "141414", 0 }, // STRING { 7, "8F9D6A", "141414", 0 }, // CHARACTER { 10, "CDA869", "141414", 0 }, // OPERATOR { 13, "CF6A4C", "141414", 0 }, // VERBATIM { 14, "E9C062", "141414", 0 }, // REGEX { 1, "5F5A60", "141414", 0 }, // COMMENT { 2, "5F5A60", "141414", 0 }, // COMMENT LINE { 3, "5F5A60", "141414", 0 }, // COMMENT DOC { 15, "5F5A60", "141414", 0 }, // COMMENT LINE DOC { 17, "5F5A60", "141414", 0 }, // COMMENT DOC KEYWORD { 18, "5F5A60", "141414", 0 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle javascript_Twilight[] = { { 41, "F8F8F8", "141414", 0 }, // DEFAULT { 45, "CF6A4C", "141414", 0 }, // NUMBER { 46, "F8F8F8", "141414", 0 }, // WORD { 47, "CDA869", "141414", 0 }, // KEYWORD { 48, "8F9D6A", "141414", 0 }, // DOUBLESTRING { 49, "8F9D6A", "141414", 0 }, // SINGLESTRING { 50, "F8F8F8", "141414", 0 }, // SYMBOLS { 51, "8F9D6A", "141414", 0 }, // STRINGEOL { 52, "E9C062", "141414", 0 }, // REGEX { 42, "5F5A60", "141414", 0 }, // COMMENT { 43, "5F5A60", "141414", 0 }, // COMMENTLINE { 44, "5F5A60", "141414", 0 }, // COMMENTDOC }; static const lexstyle python_Twilight[] = { { 0, "F8F8F8", "141414", 0 }, // DEFAULT { 1, "5F5A60", "141414", 0 }, // COMMENTLINE { 2, "CF6A4C", "141414", 0 }, // NUMBER { 3, "8F9D6A", "141414", 0 }, // STRING { 4, "8F9D6A", "141414", 0 }, // CHARACTER { 5, "CDA869", "141414", 0 }, // KEYWORDS { 6, "8F9D6A", "141414", 0 }, // TRIPLE { 7, "8F9D6A", "141414", 0 }, // TRIPLEDOUBLE { 8, "F8F8F8", "141414", 0 }, // CLASSNAME { 9, "F8F8F8", "141414", 0 }, // DEFNAME { 10, "CDA869", "141414", 0 }, // OPERATOR { 11, "CF6A4C", "141414", 0 }, // IDENTIFIER { 12, "5F5A60", "141414", 0 }, // COMMENTBLOCK { 12, "8F9D6A", "141414", 0 }, // STRINGEOL }; static const lexstyle ruby_Twilight[] = { { 0, "F8F8F8", "141414", 0 }, // DEFAULT { 1, "000000", "141414", 0 }, // ERROR { 2, "5F5A60", "141414", 0 }, // COMMENTLINE { 3, "000000", "141414", 0 }, // POD { 4, "CF6A4C", "141414", 0 }, // NUMBER { 5, "CDA869", "141414", 0 }, // INSTRUCTION { 6, "8F9D6A", "141414", 0 }, // STRING { 7, "8F9D6A", "141414", 0 }, // CHARACTER { 8, "9B703F", "141414", 0 }, // CLASS NAME { 9, "9B703F", "141414", 0 }, // DEF NAME { 10, "CDA869", "141414", 0 }, // OPERATOR { 11, "CF6A4C", "141414", 0 }, // IDENTIFIER { 12, "E9C062", "141414", 0 }, // REGEX { 13, "7587A6", "141414", 0 }, // GLOBAL { 14, "F8F8F8", "141414", 0 }, // SYMBOL { 15, "9B703F", "141414", 0 }, // MODULE NAME { 16, "7587A6", "141414", 0 }, // INSTANCE VAR { 17, "000000", "141414", 0 }, // CLASS VAR { 18, "000000", "141414", 0 }, // BACKTICKS { 19, "000000", "141414", 0 }, // DATA SECTION { 24, "8F9D6A", "141414", 0 }, // STRING Q }; static const lexstyle global_vim_Dark_Blue[] = { { 32, "FFFFBF", "000040", 0 }, // Default Style { 37, "808080", "000040", 0 }, // Indent guideline style { 34, "80FF80", "000040", 1 }, // Brace highlight style { 35, "FF8000", "000040", 0 }, // Bad brace colour { 2069, "FFFF00", "000040", 0 }, // Caret colour { 31, "FFFF00", "000040", 1 }, // Find Mark Style { 33, "FFFFFF", "000040", 0 }, // Line number margin { 29, "FFFFBF", "2050D0", 0 }, // Smart HighLighting { 28, "FFFFBF", "008000", 0 }, // Incremental highlight all { 27, "FFFFBF", "000040", 0 }, // Tags match highlighting { 26, "FFFFBF", "000040", 0 }, // Tags attribute }; static const lexstyle cpp_vim_Dark_Blue[] = { { 9, "FFFFFF", "000040", 0 }, // PREPROCESSOR { 11, "FFFFFF", "000040", 0 }, // DEFAULT { 5, "FFFF00", "000040", 1 }, // INSTRUCTION WORD { 16, "00FF00", "000040", 0 }, // TYPE WORD { 4, "FFFFFF", "000040", 0 }, // NUMBER { 6, "FFA0A0", "000040", 0 }, // STRING { 7, "FFA0A0", "000040", 0 }, // CHARACTER { 10, "FFFFFF", "000040", 1 }, // OPERATOR { 13, "00FFFF", "000040", 0 }, // VERBATIM { 14, "80FFFF", "000040", 1 }, // REGEX { 1, "80A0FF", "000040", 0 }, // COMMENT { 2, "80A0FF", "000040", 0 }, // COMMENT LINE { 3, "80A0FF", "000040", 0 }, // COMMENT DOC { 15, "80A0FF", "000040", 0 }, // COMMENT LINE DOC { 17, "80A0FF", "000040", 1 }, // COMMENT DOC KEYWORD { 18, "80A0FF", "000040", 0 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle java_vim_Dark_Blue[] = { { 9, "804000", "000040", 0 }, // PREPROCESSOR { 11, "FFFFFF", "000040", 0 }, // DEFAULT { 5, "0000FF", "000040", 1 }, // INSTRUCTION WORD { 16, "8000FF", "000040", 0 }, // TYPE WORD { 4, "FFFFFF", "000040", 0 }, // NUMBER { 6, "FFA0A0", "000040", 0 }, // STRING { 7, "FFA0A0", "000040", 0 }, // CHARACTER { 10, "FFFFFF", "000040", 1 }, // OPERATOR { 13, "FFFFFF", "000040", 0 }, // VERBATIM { 14, "FFFFFF", "000040", 1 }, // REGEX { 1, "80A0FF", "000040", 0 }, // COMMENT { 2, "80A0FF", "000040", 0 }, // COMMENT LINE { 3, "80A0FF", "000040", 0 }, // COMMENT DOC { 15, "80A0FF", "000040", 0 }, // COMMENT LINE DOC { 17, "80A0FF", "000040", 1 }, // COMMENT DOC KEYWORD { 18, "80A0FF", "000040", 0 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle javascript_vim_Dark_Blue[] = { { 41, "FFFFFF", "000040", 0 }, // DEFAULT { 45, "FFFFFF", "000040", 0 }, // NUMBER { 46, "FFFFFF", "000040", 0 }, // WORD { 47, "000080", "000040", 3 }, // KEYWORD { 48, "FFA0A0", "000040", 0 }, // DOUBLESTRING { 49, "FFA0A0", "000040", 0 }, // SINGLESTRING { 50, "FFFFFF", "000040", 1 }, // SYMBOLS { 51, "FFA0A0", "000040", 1 }, // STRINGEOL { 52, "8000FF", "000040", 0 }, // REGEX { 42, "80A0FF", "000040", 0 }, // COMMENT { 43, "80A0FF", "000040", 0 }, // COMMENTLINE { 44, "80A0FF", "000040", 0 }, // COMMENTDOC }; static const lexstyle python_vim_Dark_Blue[] = { { 0, "FFFFFF", "000040", 0 }, // DEFAULT { 1, "80A0FF", "000040", 0 }, // COMMENTLINE { 2, "FFFFFF", "000040", 0 }, // NUMBER { 3, "FFA0A0", "000040", 0 }, // STRING { 4, "FFA0A0", "000040", 0 }, // CHARACTER { 5, "FFFF00", "000040", 0 }, // KEYWORDS { 6, "FF8000", "000040", 0 }, // TRIPLE { 7, "FFA0A0", "000040", 0 }, // TRIPLEDOUBLE { 8, "40FFFF", "000040", 0 }, // CLASSNAME { 9, "40FFFF", "000040", 0 }, // DEFNAME { 10, "FFFFFF", "000040", 0 }, // OPERATOR { 11, "C0C0C0", "000040", 0 }, // IDENTIFIER { 12, "80A0FF", "000040", 0 }, // COMMENTBLOCK { 12, "008080", "000040", 0 }, // STRINGEOL }; static const lexstyle ruby_vim_Dark_Blue[] = { { 0, "FFFFFF", "000040", 0 }, // DEFAULT { 1, "FFFFFF", "000040", 0 }, // ERROR { 2, "80A0FF", "000040", 0 }, // COMMENTLINE { 3, "004000", "000040", 0 }, // POD { 4, "FFFFFF", "000040", 0 }, // NUMBER { 5, "0000FF", "000040", 1 }, // INSTRUCTION { 6, "FFA0A0", "000040", 0 }, // STRING { 7, "FFA0A0", "000040", 0 }, // CHARACTER { 8, "0080C0", "000040", 1 }, // CLASS NAME { 9, "8080FF", "000040", 1 }, // DEF NAME { 10, "FFFFFF", "000040", 1 }, // OPERATOR { 11, "C0C0C0", "000040", 0 }, // IDENTIFIER { 12, "0080FF", "000040", 0 }, // REGEX { 13, "FFFFFF", "000040", 1 }, // GLOBAL { 14, "FFFFFF", "000040", 0 }, // SYMBOL { 15, "804000", "000040", 1 }, // MODULE NAME { 16, "FFFFFF", "000040", 0 }, // INSTANCE VAR { 17, "FFFFFF", "000040", 0 }, // CLASS VAR { 18, "FFFF00", "000040", 0 }, // BACKTICKS { 19, "600000", "000040", 0 }, // DATA SECTION { 24, "808080", "000040", 0 }, // STRING Q }; static const lexstyle global_Deep_Black[] = { { 32, "FFFFFF", "000000", 0 }, // Default Style { 37, "C0C0C0", "000000", 0 }, // Indent guideline style { 34, "00FF00", "000000", 1 }, // Brace highlight style { 35, "FF0000", "000000", 1 }, // Bad brace colour { 2069, "FFFFFF", "253B76", 0 }, // Caret colour { 33, "C0C0C0", "333333", 0 }, // Line number margin { 29, "555753", "80FF00", 0 }, // Smart HighLighting { 31, "FFFF00", "FF0000", 1 }, // Find Mark Style { 28, "555753", "FF8000", 0 }, // Incremental highlight all { 27, "FCAF3E", "0080FF", 0 }, // Tags match highlighting { 26, "FFFFFF", "808080", 0 }, // Tags attribute }; static const lexstyle cpp_Deep_Black[] = { { 9, "C0C0C0", "000000", 0 }, // PREPROCESSOR { 11, "FFFFFF", "000000", 0 }, // DEFAULT { 5, "FF6600", "000000", 1 }, // INSTRUCTION WORD { 16, "00FFFF", "000000", 1 }, // TYPE WORD { 4, "FF8000", "000000", 0 }, // NUMBER { 6, "FFFF00", "000000", 0 }, // STRING { 7, "FF8080", "000000", 0 }, // CHARACTER { 10, "FFCC00", "000000", 0 }, // OPERATOR { 13, "FFFFFF", "000000", 0 }, // VERBATIM { 14, "FFFFFF", "000000", 1 }, // REGEX { 1, "00FF00", "000000", 2 }, // COMMENT { 2, "00FF00", "000000", 2 }, // COMMENT LINE { 3, "00FF00", "000000", 2 }, // COMMENT DOC { 15, "00FF00", "000000", 2 }, // COMMENT LINE DOC { 17, "00FF00", "000000", 2 }, // COMMENT DOC KEYWORD { 18, "00FF00", "000000", 2 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle java_Deep_Black[] = { { 9, "EDF8F9", "000000", 0 }, // PREPROCESSOR { 11, "FFFFFF", "000000", 0 }, // DEFAULT { 5, "FF6600", "000000", 1 }, // INSTRUCTION WORD { 16, "66FF00", "000000", 0 }, // TYPE WORD { 4, "FF8000", "000000", 0 }, // NUMBER { 6, "66FF00", "000000", 0 }, // STRING { 7, "66FF00", "000000", 0 }, // CHARACTER { 10, "FFCC00", "000000", 1 }, // OPERATOR { 13, "FFFFFF", "000000", 0 }, // VERBATIM { 14, "FFFFFF", "000000", 1 }, // REGEX { 1, "00FF00", "000000", 2 }, // COMMENT { 2, "00FF00", "000000", 2 }, // COMMENT LINE { 3, "00FF00", "000000", 2 }, // COMMENT DOC { 15, "00FF00", "000000", 2 }, // COMMENT LINE DOC { 17, "00FF00", "000000", 2 }, // COMMENT DOC KEYWORD { 18, "00FF00", "000000", 2 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle javascript_Deep_Black[] = { { 41, "FFFFFF", "000000", 0 }, // DEFAULT { 45, "99CC99", "000000", 0 }, // NUMBER { 46, "FF6600", "000000", 0 }, // WORD { 47, "FFCC00", "000000", 3 }, // KEYWORD { 48, "FFFF00", "000000", 0 }, // DOUBLESTRING { 49, "FFFF00", "000000", 0 }, // SINGLESTRING { 50, "999966", "000000", 1 }, // SYMBOLS { 51, "CCCCCC", "000000", 1 }, // STRINGEOL { 52, "339999", "000000", 0 }, // REGEX { 42, "00FF00", "000000", 2 }, // COMMENT { 43, "00FF00", "000000", 2 }, // COMMENTLINE { 44, "772CB7", "070707", 0 }, // COMMENTDOC }; static const lexstyle python_Deep_Black[] = { { 0, "FFFFFF", "000000", 0 }, // DEFAULT { 1, "00FF00", "000000", 2 }, // COMMENTLINE { 2, "99CC99", "000000", 0 }, // NUMBER { 3, "66FF00", "000000", 0 }, // STRING { 4, "66FF00", "000000", 0 }, // CHARACTER { 5, "FF6600", "000000", 1 }, // KEYWORDS { 6, "FF8000", "000000", 0 }, // TRIPLE { 7, "FFFFFF", "000000", 0 }, // TRIPLEDOUBLE { 8, "FFFFFF", "000000", 1 }, // CLASSNAME { 9, "FF00FF", "000000", 0 }, // DEFNAME { 10, "FFCC00", "000000", 1 }, // OPERATOR { 11, "FFFFFF", "000000", 0 }, // IDENTIFIER { 12, "00FF00", "000000", 2 }, // COMMENTBLOCK { 12, "FFFF00", "000000", 0 }, // STRINGEOL }; static const lexstyle ruby_Deep_Black[] = { { 0, "FFFFFF", "000000", 0 }, // DEFAULT { 1, "FFFFFF", "000000", 0 }, // ERROR { 2, "00FF00", "000000", 2 }, // COMMENTLINE { 3, "004000", "C0FFC0", 0 }, // POD { 4, "FF8000", "000000", 0 }, // NUMBER { 5, "FF6600", "000000", 1 }, // INSTRUCTION { 6, "66FF00", "000000", 0 }, // STRING { 7, "808000", "000000", 0 }, // CHARACTER { 8, "0080C0", "000000", 1 }, // CLASS NAME { 9, "8080FF", "FFFFCC", 1 }, // DEF NAME { 10, "FFCC00", "000000", 1 }, // OPERATOR { 11, "FFFFFF", "000000", 0 }, // IDENTIFIER { 12, "339999", "000000", 0 }, // REGEX { 13, "FFCC00", "000000", 1 }, // GLOBAL { 14, "FFFFFF", "000000", 0 }, // SYMBOL { 15, "EDF8F9", "000000", 1 }, // MODULE NAME { 16, "FFFFFF", "000000", 0 }, // INSTANCE VAR { 17, "FFFFFF", "000000", 0 }, // CLASS VAR { 18, "FFFF00", "A08080", 0 }, // BACKTICKS { 19, "600000", "FFF0D8", 0 }, // DATA SECTION { 24, "66FF00", "000000", 0 }, // STRING Q }; static const lexstyle global_Mono_Industrial[] = { { 32, "FFFFFF", "222C28", 0 }, // Default Style { 37, "888A85", "222C28", 0 }, // Indent guideline style { 34, "FCE94F", "222C28", 1 }, // Brace highlight style { 35, "EF2929", "222C28", 0 }, // Bad brace colour { 2069, "FFFFFF", "222C28", 0 }, // Caret colour { 31, "CC0000", "EDD400", 0 }, // Find Mark Style { 33, "EEEEEC", "2E3436", 0 }, // Line number margin { 29, "555753", "00FF00", 0 }, // Smart HighLighting { 31, "FCAF3E", "FF0000", 0 }, // Find Mark Style { 25, "FFFFFF", "00FFFF", 0 }, // Mark Style 1 { 24, "FFFFFF", "FF8000", 0 }, // Mark Style 2 { 23, "FFFFFF", "FFFF00", 0 }, // Mark Style 3 { 22, "FFFFFF", "8000FF", 0 }, // Mark Style 4 { 21, "FFFFFF", "008000", 0 }, // Mark Style 5 { 28, "FFCAB0", "0080FF", 0 }, // Incremental highlight all { 27, "000000", "8000FF", 0 }, // Tags match highlighting { 26, "8080C0", "FFFF00", 0 }, // Tags attribute }; static const lexstyle cpp_Mono_Industrial[] = { { 9, "A39E64", "222C28", 0 }, // PREPROCESSOR { 11, "FFFFFF", "222C28", 0 }, // DEFAULT { 5, "C23B00", "222C28", 0 }, // INSTRUCTION WORD { 16, "A39E64", "222C28", 0 }, // TYPE WORD { 4, "E98800", "222C28", 0 }, // NUMBER { 6, "FFFFFF", "222C28", 0 }, // STRING { 7, "FFFFFF", "222C28", 0 }, // CHARACTER { 10, "A8B3AB", "222C28", 0 }, // OPERATOR { 13, "E98800", "222C28", 0 }, // VERBATIM { 14, "FFFFFF", "222C28", 0 }, // REGEX { 1, "666C68", "222C28", 0 }, // COMMENT { 2, "666C68", "222C28", 0 }, // COMMENT LINE { 3, "666C68", "222C28", 0 }, // COMMENT DOC { 15, "666C68", "222C28", 0 }, // COMMENT LINE DOC { 17, "666C68", "222C28", 0 }, // COMMENT DOC KEYWORD { 18, "666C68", "222C28", 0 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle java_Mono_Industrial[] = { { 9, "A39E64", "222C28", 0 }, // PREPROCESSOR { 11, "FFFFFF", "222C28", 0 }, // DEFAULT { 5, "C23B00", "222C28", 0 }, // INSTRUCTION WORD { 16, "A39E64", "222C28", 0 }, // TYPE WORD { 4, "E98800", "222C28", 0 }, // NUMBER { 6, "FFFFFF", "222C28", 0 }, // STRING { 7, "FFFFFF", "222C28", 0 }, // CHARACTER { 10, "A8B3AB", "222C28", 0 }, // OPERATOR { 13, "E98800", "222C28", 0 }, // VERBATIM { 14, "FFFFFF", "222C28", 0 }, // REGEX { 1, "666C68", "222C28", 0 }, // COMMENT { 2, "666C68", "222C28", 0 }, // COMMENT LINE { 3, "666C68", "222C28", 0 }, // COMMENT DOC { 15, "666C68", "222C28", 0 }, // COMMENT LINE DOC { 17, "666C68", "222C28", 0 }, // COMMENT DOC KEYWORD { 18, "666C68", "222C28", 0 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle javascript_Mono_Industrial[] = { { 41, "FFFFFF", "222C28", 0 }, // DEFAULT { 45, "E98800", "222C28", 0 }, // NUMBER { 46, "FFFFFF", "222C28", 0 }, // WORD { 47, "A8B3AB", "222C28", 0 }, // KEYWORD { 48, "FFFFFF", "222C28", 0 }, // DOUBLESTRING { 49, "FFFFFF", "222C28", 0 }, // SINGLESTRING { 50, "FFFFFF", "222C28", 0 }, // SYMBOLS { 51, "FFFFFF", "222C28", 0 }, // STRINGEOL { 52, "FFFFFF", "222C28", 0 }, // REGEX { 42, "666C68", "222C28", 0 }, // COMMENT { 43, "666C68", "222C28", 0 }, // COMMENTLINE { 44, "666C68", "222C28", 0 }, // COMMENTDOC }; static const lexstyle python_Mono_Industrial[] = { { 0, "FFFFFF", "222C28", 0 }, // DEFAULT { 1, "666C68", "222C28", 0 }, // COMMENTLINE { 2, "E98800", "222C28", 0 }, // NUMBER { 3, "FFFFFF", "222C28", 0 }, // STRING { 4, "FFFFFF", "222C28", 0 }, // CHARACTER { 5, "A8B3AB", "222C28", 0 }, // KEYWORDS { 6, "000000", "222C28", 0 }, // TRIPLE { 7, "000000", "222C28", 0 }, // TRIPLEDOUBLE { 8, "000000", "222C28", 0 }, // CLASSNAME { 9, "000000", "222C28", 0 }, // DEFNAME { 10, "A8B3AB", "222C28", 0 }, // OPERATOR { 11, "C87500", "222C28", 0 }, // IDENTIFIER { 12, "666C68", "222C28", 0 }, // COMMENTBLOCK { 12, "FFFFFF", "222C28", 0 }, // STRINGEOL }; static const lexstyle ruby_Mono_Industrial[] = { { 0, "FFFFFF", "222C28", 0 }, // DEFAULT { 1, "000000", "222C28", 0 }, // ERROR { 2, "666C68", "222C28", 0 }, // COMMENTLINE { 3, "000000", "222C28", 0 }, // POD { 4, "E98800", "222C28", 0 }, // NUMBER { 5, "A39E64", "222C28", 0 }, // INSTRUCTION { 6, "FFFFFF", "222C28", 0 }, // STRING { 7, "FFFFFF", "222C28", 0 }, // CHARACTER { 8, "FFFFFF", "222C28", 0 }, // CLASS NAME { 9, "A8B3AB", "222C28", 0 }, // DEF NAME { 10, "A8B3AB", "222C28", 0 }, // OPERATOR { 11, "C87500", "222C28", 0 }, // IDENTIFIER { 12, "FFFFFF", "222C28", 0 }, // REGEX { 13, "648BD2", "222C28", 0 }, // GLOBAL { 14, "FFFFFF", "222C28", 0 }, // SYMBOL { 15, "000000", "222C28", 0 }, // MODULE NAME { 16, "648BD2", "222C28", 0 }, // INSTANCE VAR { 17, "000000", "222C28", 0 }, // CLASS VAR { 18, "000000", "222C28", 0 }, // BACKTICKS { 19, "000000", "222C28", 0 }, // DATA SECTION { 24, "FFFFFF", "222C28", 0 }, // STRING Q }; static const lexstyle global_Ruby_Blue[] = { { 32, "FFFFFF", "112435", 0 }, // Default Style { 37, "0080FF", "112435", 1 }, // Indent guideline style { 34, "FFFFFF", "112435", 0 }, // Brace highlight style { 35, "FFFFFF", "112435", 0 }, // Bad brace colour { 2069, "FFFFFF", "6699CC", 0 }, // Caret colour { 31, "FFFFFF", "112435", 0 }, // Find Mark Style { 33, "FFFFFF", "1F4661", 0 }, // Line number margin { 29, "555753", "00FF00", 0 }, // Smart HighLighting { 31, "FCAF3E", "FF0000", 0 }, // Find Mark Style { 25, "FFFFFF", "00FFFF", 0 }, // Mark Style 1 { 24, "FFFFFF", "FF8000", 0 }, // Mark Style 2 { 23, "FFFFFF", "FFFF00", 0 }, // Mark Style 3 { 22, "FFFFFF", "8000FF", 0 }, // Mark Style 4 { 21, "FFFFFF", "008000", 0 }, // Mark Style 5 { 28, "FFCAB0", "0080FF", 0 }, // Incremental highlight all { 27, "000000", "8000FF", 0 }, // Tags match highlighting { 26, "8080C0", "FFFF00", 0 }, // Tags attribute }; static const lexstyle cpp_Ruby_Blue[] = { { 9, "FFFFFF", "112435", 0 }, // PREPROCESSOR { 11, "FFFFFF", "112435", 0 }, // DEFAULT { 5, "FFFFFF", "112435", 0 }, // INSTRUCTION WORD { 16, "FFFFFF", "112435", 0 }, // TYPE WORD { 4, "FFFFFF", "112435", 0 }, // NUMBER { 6, "FFFFFF", "112435", 0 }, // STRING { 7, "FFFFFF", "112435", 0 }, // CHARACTER { 10, "FFFFFF", "112435", 0 }, // OPERATOR { 13, "FFFFFF", "112435", 0 }, // VERBATIM { 14, "FFFFFF", "112435", 0 }, // REGEX { 1, "FFFFFF", "112435", 0 }, // COMMENT { 2, "FFFFFF", "112435", 0 }, // COMMENT LINE { 3, "FFFFFF", "112435", 0 }, // COMMENT DOC { 15, "FFFFFF", "112435", 0 }, // COMMENT LINE DOC { 17, "FFFFFF", "112435", 0 }, // COMMENT DOC KEYWORD { 18, "FFFFFF", "112435", 0 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle java_Ruby_Blue[] = { { 9, "FFFFFF", "112435", 0 }, // PREPROCESSOR { 11, "FFFFFF", "112435", 0 }, // DEFAULT { 5, "FFFFFF", "112435", 0 }, // INSTRUCTION WORD { 16, "FFFFFF", "112435", 0 }, // TYPE WORD { 4, "FFFFFF", "112435", 0 }, // NUMBER { 6, "FFFFFF", "112435", 0 }, // STRING { 7, "FFFFFF", "112435", 0 }, // CHARACTER { 10, "FFFFFF", "112435", 0 }, // OPERATOR { 13, "FFFFFF", "112435", 0 }, // VERBATIM { 14, "FFFFFF", "112435", 0 }, // REGEX { 1, "FFFFFF", "112435", 0 }, // COMMENT { 2, "FFFFFF", "112435", 0 }, // COMMENT LINE { 3, "FFFFFF", "112435", 0 }, // COMMENT DOC { 15, "FFFFFF", "112435", 0 }, // COMMENT LINE DOC { 17, "FFFFFF", "112435", 0 }, // COMMENT DOC KEYWORD { 18, "FFFFFF", "112435", 0 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle javascript_Ruby_Blue[] = { { 41, "FFFFFF", "112435", 0 }, // DEFAULT { 45, "FF00FF", "112435", 0 }, // NUMBER { 46, "8DB0D3", "112435", 0 }, // WORD { 47, "FFFF80", "112435", 0 }, // KEYWORD { 48, "F08047", "112435", 0 }, // DOUBLESTRING { 49, "F08047", "112435", 0 }, // SINGLESTRING { 50, "7BD827", "112435", 0 }, // SYMBOLS { 51, "730080", "112435", 0 }, // STRINGEOL { 52, "FF00FF", "112435", 0 }, // REGEX { 42, "3A8BDA", "112435", 0 }, // COMMENT { 43, "3A8BDA", "112435", 0 }, // COMMENTLINE { 44, "3A8BDA", "112435", 0 }, // COMMENTDOC }; static const lexstyle python_Ruby_Blue[] = { { 0, "FFFFFF", "112435", 0 }, // DEFAULT { 1, "FFFFFF", "112435", 0 }, // COMMENTLINE { 2, "FFFFFF", "112435", 0 }, // NUMBER { 3, "FFFFFF", "112435", 0 }, // STRING { 4, "FFFFFF", "112435", 0 }, // CHARACTER { 5, "FFFFFF", "112435", 0 }, // KEYWORDS { 6, "FFFFFF", "112435", 0 }, // TRIPLE { 7, "FFFFFF", "112435", 0 }, // TRIPLEDOUBLE { 8, "FFFFFF", "112435", 0 }, // CLASSNAME { 9, "FFFFFF", "112435", 0 }, // DEFNAME { 10, "FFFFFF", "112435", 0 }, // OPERATOR { 11, "FFFFFF", "112435", 0 }, // IDENTIFIER { 12, "FFFFFF", "112435", 0 }, // COMMENTBLOCK { 12, "FFFFFF", "112435", 0 }, // STRINGEOL }; static const lexstyle ruby_Ruby_Blue[] = { { 0, "FFFFFF", "112435", 0 }, // DEFAULT { 1, "FFFFFF", "112435", 0 }, // ERROR { 2, "FFFFFF", "112435", 0 }, // COMMENTLINE { 3, "FFFFFF", "112435", 0 }, // POD { 4, "FFFFFF", "112435", 0 }, // NUMBER { 5, "FFFFFF", "112435", 0 }, // INSTRUCTION { 6, "FFFFFF", "112435", 0 }, // STRING { 7, "FFFFFF", "112435", 0 }, // CHARACTER { 8, "FFFFFF", "112435", 0 }, // CLASS NAME { 9, "FFFFFF", "112435", 0 }, // DEF NAME { 10, "FFFFFF", "112435", 0 }, // OPERATOR { 11, "FFFFFF", "112435", 0 }, // IDENTIFIER { 12, "FFFFFF", "112435", 0 }, // REGEX { 13, "FFFFFF", "112435", 0 }, // GLOBAL { 14, "FFFFFF", "112435", 0 }, // SYMBOL { 15, "FFFFFF", "112435", 0 }, // MODULE NAME { 16, "FFFFFF", "112435", 0 }, // INSTANCE VAR { 17, "FFFFFF", "112435", 0 }, // CLASS VAR { 18, "FFFFFF", "112435", 0 }, // BACKTICKS { 19, "FFFFFF", "112435", 0 }, // DATA SECTION { 24, "FFFFFF", "112435", 0 }, // STRING Q }; static const lexstyle global_Choco[] = { { 32, "C3BE98", "1A0F0B", 0 }, // Default Style { 37, "888A85", "1A0F0B", 0 }, // Indent guideline style { 34, "FCE94F", "1A0F0B", 1 }, // Brace highlight style { 35, "EF2929", "1A0F0B", 0 }, // Bad brace colour { 2069, "A7A7A7", "112435", 0 }, // Caret colour { 31, "CC0000", "EDD400", 0 }, // Find Mark Style { 33, "EEEEEC", "2E3436", 0 }, // Line number margin { 29, "555753", "00FF00", 0 }, // Smart HighLighting { 31, "CC0000", "EDD400", 0 }, // Find Mark Style { 25, "80D4B2", "00FFFF", 0 }, // Mark Style 1 { 24, "3FBA89", "FF8000", 0 }, // Mark Style 2 { 23, "101010", "FFFF00", 0 }, // Mark Style 3 { 22, "808080", "8000FF", 0 }, // Mark Style 4 { 21, "FAAA3C", "008000", 0 }, // Mark Style 5 { 28, "FFCAB0", "0080FF", 0 }, // Incremental highlight all { 27, "000000", "972FFF", 0 }, // Tags match highlighting { 26, "8080C0", "FFFF00", 0 }, // Tags attribute }; static const lexstyle cpp_Choco[] = { { 9, "8996A8", "1A0F0B", 0 }, // PREPROCESSOR { 11, "C3BE98", "1A0F0B", 0 }, // DEFAULT { 5, "F1E694", "1A0F0B", 0 }, // INSTRUCTION WORD { 16, "B3935C", "1A0F0B", 0 }, // TYPE WORD { 4, "DA5659", "1A0F0B", 0 }, // NUMBER { 6, "7CA563", "1A0F0B", 0 }, // STRING { 7, "7CA563", "1A0F0B", 0 }, // CHARACTER { 10, "B3935C", "1A0F0B", 0 }, // OPERATOR { 13, "DA5659", "1A0F0B", 0 }, // VERBATIM { 14, "E9C062", "1A0F0B", 0 }, // REGEX { 1, "679D47", "1A0F0B", 0 }, // COMMENT { 2, "679D47", "1A0F0B", 0 }, // COMMENT LINE { 3, "679D47", "1A0F0B", 0 }, // COMMENT DOC { 15, "679D47", "1A0F0B", 0 }, // COMMENT LINE DOC { 17, "679D47", "1A0F0B", 0 }, // COMMENT DOC KEYWORD { 18, "679D47", "1A0F0B", 0 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle java_Choco[] = { { 9, "8996A8", "1A0F0B", 0 }, // PREPROCESSOR { 11, "C3BE98", "1A0F0B", 0 }, // DEFAULT { 5, "F1E694", "1A0F0B", 0 }, // INSTRUCTION WORD { 16, "B3935C", "1A0F0B", 0 }, // TYPE WORD { 4, "DA5659", "1A0F0B", 0 }, // NUMBER { 6, "7CA563", "1A0F0B", 0 }, // STRING { 7, "7CA563", "1A0F0B", 0 }, // CHARACTER { 10, "B3935C", "1A0F0B", 0 }, // OPERATOR { 13, "DA5659", "1A0F0B", 0 }, // VERBATIM { 14, "E9C062", "1A0F0B", 0 }, // REGEX { 1, "679D47", "1A0F0B", 0 }, // COMMENT { 2, "679D47", "1A0F0B", 0 }, // COMMENT LINE { 3, "679D47", "1A0F0B", 0 }, // COMMENT DOC { 15, "679D47", "1A0F0B", 0 }, // COMMENT LINE DOC { 17, "679D47", "1A0F0B", 0 }, // COMMENT DOC KEYWORD { 18, "679D47", "1A0F0B", 0 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle javascript_Choco[] = { { 41, "C3BE98", "1A0F0B", 0 }, // DEFAULT { 45, "DA5659", "1A0F0B", 0 }, // NUMBER { 46, "C3BE98", "1A0F0B", 0 }, // WORD { 47, "B3935C", "1A0F0B", 0 }, // KEYWORD { 48, "7CA563", "1A0F0B", 0 }, // DOUBLESTRING { 49, "7CA563", "1A0F0B", 0 }, // SINGLESTRING { 50, "C3BE98", "1A0F0B", 0 }, // SYMBOLS { 51, "7CA563", "1A0F0B", 0 }, // STRINGEOL { 52, "E9C062", "1A0F0B", 0 }, // REGEX { 42, "679D47", "1A0F0B", 0 }, // COMMENT { 43, "679D47", "1A0F0B", 0 }, // COMMENTLINE { 44, "679D47", "1A0F0B", 0 }, // COMMENTDOC }; static const lexstyle python_Choco[] = { { 0, "C3BE98", "1A0F0B", 0 }, // DEFAULT { 1, "679D47", "1A0F0B", 0 }, // COMMENTLINE { 2, "DA5659", "1A0F0B", 0 }, // NUMBER { 3, "7CA563", "1A0F0B", 0 }, // STRING { 4, "7CA563", "1A0F0B", 0 }, // CHARACTER { 5, "B3935C", "1A0F0B", 0 }, // KEYWORDS { 6, "000000", "1A0F0B", 0 }, // TRIPLE { 7, "000000", "1A0F0B", 0 }, // TRIPLEDOUBLE { 8, "000000", "1A0F0B", 0 }, // CLASSNAME { 9, "000000", "1A0F0B", 0 }, // DEFNAME { 10, "B3935C", "1A0F0B", 0 }, // OPERATOR { 11, "D77261", "1A0F0B", 0 }, // IDENTIFIER { 12, "679D47", "1A0F0B", 0 }, // COMMENTBLOCK { 12, "7CA563", "1A0F0B", 0 }, // STRINGEOL }; static const lexstyle ruby_Choco[] = { { 0, "C3BE98", "1A0F0B", 0 }, // DEFAULT { 1, "000000", "1A0F0B", 0 }, // ERROR { 2, "679D47", "1A0F0B", 0 }, // COMMENTLINE { 3, "000000", "1A0F0B", 0 }, // POD { 4, "DA5659", "1A0F0B", 0 }, // NUMBER { 5, "B3935C", "1A0F0B", 0 }, // INSTRUCTION { 6, "7CA563", "1A0F0B", 0 }, // STRING { 7, "7CA563", "1A0F0B", 0 }, // CHARACTER { 8, "6D4C2F", "1A0F0B", 0 }, // CLASS NAME { 9, "6D4C2F", "1A0F0B", 0 }, // DEF NAME { 10, "B3935C", "1A0F0B", 0 }, // OPERATOR { 11, "D77261", "1A0F0B", 0 }, // IDENTIFIER { 12, "E9C062", "1A0F0B", 0 }, // REGEX { 13, "7989A6", "1A0F0B", 0 }, // GLOBAL { 14, "C3BE98", "1A0F0B", 0 }, // SYMBOL { 15, "000000", "1A0F0B", 0 }, // MODULE NAME { 16, "7989A6", "1A0F0B", 0 }, // INSTANCE VAR { 17, "000000", "1A0F0B", 0 }, // CLASS VAR { 18, "000000", "1A0F0B", 0 }, // BACKTICKS { 19, "000000", "1A0F0B", 0 }, // DATA SECTION { 24, "7CA563", "1A0F0B", 0 }, // STRING Q }; static const lexstyle global_khaki[] = { { 32, "5f5f00", "d7d7af", 0 }, // Default Style { 37, "afaf87", "d7d7af", 0 }, // Indent guideline style { 34, "d7d7af", "005f00", 1 }, // Brace highlight style { 35, "ff005f", "d7d7af", 0 }, // Bad brace colour { 2069, "5f5f00", "d7d7af", 0 }, // Caret colour { 33, "5f5f00", "afaf87", 0 }, // Line number margin { 29, "5f5f00", "d7ff87", 0 }, // Smart HighLighting { 31, "5f5f00", "d7ff87", 0 }, // Find Mark Style { 25, "5f5f00", "af5f00", 0 }, // Mark Style 1 { 24, "5f5f00", "005f5f", 0 }, // Mark Style 2 { 23, "5f5f00", "afaf87", 0 }, // Mark Style 3 { 22, "5f5f00", "87005f", 0 }, // Mark Style 4 { 21, "5f5f00", "d7ff87", 0 }, // Mark Style 5 { 28, "5f5f00", "d7ff87", 0 }, // Incremental highlight all { 27, "5f5f00", "afff87", 0 }, // Tags match highlighting { 26, "5f5f00", "5faf5f", 0 }, // Tags attribute }; static const lexstyle cpp_khaki[] = { { 9, "5f0000", "d7d7af", 0 }, // PREPROCESSOR { 11, "5f5f00", "d7d7af", 0 }, // DEFAULT { 5, "87005f", "d7d7af", 0 }, // INSTRUCTION WORD { 16, "5f005f", "d7d7af", 0 }, // TYPE WORD { 4, "005f00", "d7d7af", 0 }, // NUMBER { 6, "005f5f", "d7d7af", 0 }, // STRING { 7, "005f5f", "d7d7af", 0 }, // CHARACTER { 10, "00005f", "d7d7af", 0 }, // OPERATOR { 13, "005f5f", "d7d7af", 0 }, // VERBATIM { 14, "0087af", "d7d7af", 0 }, // REGEX { 1, "87875f", "d7d7af", 2 }, // COMMENT { 2, "87875f", "d7d7af", 2 }, // COMMENT LINE { 3, "87875f", "d7d7af", 2 }, // COMMENT DOC { 15, "87875f", "d7d7af", 2 }, // COMMENT LINE DOC { 17, "87875f", "d7d7af", 3 }, // COMMENT DOC KEYWORD { 18, "d700d7", "d7d7af", 3 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle java_khaki[] = { { 9, "5f0000", "d7d7af", 0 }, // PREPROCESSOR { 11, "5f5f00", "d7d7af", 0 }, // DEFAULT { 5, "87005f", "d7d7af", 0 }, // INSTRUCTION WORD { 16, "5f005f", "d7d7af", 0 }, // TYPE WORD { 4, "005f00", "d7d7af", 0 }, // NUMBER { 6, "005f5f", "d7d7af", 0 }, // STRING { 7, "005f5f", "d7d7af", 0 }, // CHARACTER { 10, "00005f", "d7d7af", 0 }, // OPERATOR { 13, "005f5f", "d7d7af", 0 }, // VERBATIM { 14, "0087af", "d7d7af", 0 }, // REGEX { 1, "87875f", "d7d7af", 2 }, // COMMENT { 2, "87875f", "d7d7af", 2 }, // COMMENT LINE { 3, "87875f", "d7d7af", 2 }, // COMMENT DOC { 15, "87875f", "d7d7af", 2 }, // COMMENT LINE DOC { 17, "005f5f", "d7d7af", 3 }, // COMMENT DOC KEYWORD { 18, "d700d7", "d7d7af", 3 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle javascript_khaki[] = { { 41, "5f5f00", "d7d7af", 0 }, // DEFAULT { 45, "005f00", "d7d7af", 0 }, // NUMBER { 46, "000087", "d7d7af", 0 }, // WORD { 47, "87005f", "d7d7af", 0 }, // KEYWORD { 48, "005f5f", "d7d7af", 0 }, // DOUBLESTRING { 49, "005f5f", "d7d7af", 0 }, // SINGLESTRING { 50, "5f5f00", "d7d7af", 0 }, // SYMBOLS { 51, "af5f00", "d7d7af", 0 }, // STRINGEOL { 52, "0087af", "d7d7af", 0 }, // REGEX { 42, "87875f", "d7d7af", 2 }, // COMMENT { 43, "87875f", "d7d7af", 2 }, // COMMENTLINE { 44, "87875f", "d7d7af", 2 }, // COMMENTDOC { 17, "005f5f", "d7d7af", 3 }, // COMMENT DOC KEYWORD { 18, "d700d7", "d7d7af", 3 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle python_khaki[] = { { 0, "5f5f00", "d7d7af", 0 }, // DEFAULT { 1, "87875f", "d7d7af", 2 }, // COMMENTLINE { 2, "005f00", "d7d7af", 0 }, // NUMBER { 3, "005f5f", "d7d7af", 0 }, // STRING { 4, "005f5f", "d7d7af", 0 }, // CHARACTER { 5, "87005f", "d7d7af", 0 }, // KEYWORDS { 6, "005f5f", "d7d7af", 0 }, // TRIPLE { 7, "005f5f", "d7d7af", 0 }, // TRIPLEDOUBLE { 8, "5f0000", "d7d7af", 0 }, // CLASSNAME { 9, "af0000", "d7d7af", 0 }, // DEFNAME { 10, "00005f", "d7d7af", 0 }, // OPERATOR { 11, "000087", "d7d7af", 0 }, // IDENTIFIER { 12, "87875f", "d7d7af", 2 }, // COMMENTBLOCK { 12, "87875f", "d7d7af", 0 }, // STRINGEOL }; static const lexstyle ruby_khaki[] = { { 0, "5f5f00", "d7d7af", 0 }, // DEFAULT { 1, "af5f00", "d7d7af", 0 }, // ERROR { 2, "87875f", "d7d7af", 2 }, // COMMENTLINE { 3, "5f5f00", "d7d7af", 2 }, // POD { 4, "005f00", "d7d7af", 0 }, // NUMBER { 5, "87005f", "d7d7af", 0 }, // INSTRUCTION { 6, "005f5f", "d7d7af", 0 }, // STRING { 7, "005f5f", "d7d7af", 0 }, // CHARACTER { 8, "5f0000", "d7d7af", 0 }, // CLASS NAME { 9, "005f5f", "d7d7af", 0 }, // DEF NAME { 10, "00005f", "d7d7af", 0 }, // OPERATOR { 11, "000087", "d7d7af", 0 }, // IDENTIFIER { 12, "0087af", "d7d7af", 0 }, // REGEX { 13, "000087", "d7d7af", 0 }, // GLOBAL { 14, "5f5f00", "d7d7af", 0 }, // SYMBOL { 15, "af0000", "d7d7af", 0 }, // MODULE NAME { 16, "000087", "d7d7af", 0 }, // INSTANCE VAR { 17, "000087", "d7d7af", 0 }, // CLASS VAR { 18, "af0000", "d7d7af", 0 }, // BACKTICKS { 19, "005f5f", "d7d7af", 0 }, // DATA SECTION { 24, "005f5f", "d7d7af", 0 }, // STRING Q { 25, "005f5f", "d7d7af", 0 }, // BOOLEAN }; static const lexstyle global_Bespin[] = { { 32, "BDAE9D", "2A211C", 0 }, // Default Style { 37, "888A85", "2A211C", 0 }, // Indent guideline style { 34, "E5C138", "2A211C", 1 }, // Brace highlight style { 35, "EF2929", "2A211C", 0 }, // Bad brace colour { 2069, "37A8ED", "80FF00", 0 }, // Caret colour { 31, "CC0000", "EDD400", 0 }, // Find Mark Style { 33, "E5C138", "4C4A41", 0 }, // Line number margin { 29, "555753", "FF0080", 0 }, // Smart HighLighting { 31, "CC0000", "EDD400", 0 }, // Find Mark Style { 25, "BDAE9D", "00FFFF", 0 }, // Mark Style 1 { 24, "FAAA3C", "FF8000", 0 }, // Mark Style 2 { 23, "FFFF80", "FFFF00", 0 }, // Mark Style 3 { 22, "000000", "8000FF", 0 }, // Mark Style 4 { 21, "808080", "008000", 0 }, // Mark Style 5 { 28, "FFCAB0", "0080FF", 0 }, // Incremental highlight all { 27, "000000", "808000", 0 }, // Tags match highlighting { 26, "8080C0", "808080", 0 }, // Tags attribute }; static const lexstyle cpp_Bespin[] = { { 9, "FFAA00", "2A211C", 0 }, // PREPROCESSOR { 11, "F8F8F8", "2A211C", 0 }, // DEFAULT { 5, "F6F080", "2A211C", 0 }, // INSTRUCTION WORD { 16, "FFAA00", "2A211C", 0 }, // TYPE WORD { 4, "FF3A83", "2A211C", 0 }, // NUMBER { 6, "55E439", "2A211C", 0 }, // STRING { 7, "55E439", "2A211C", 0 }, // CHARACTER { 10, "FFAA00", "2A211C", 0 }, // OPERATOR { 13, "FF3A83", "2A211C", 0 }, // VERBATIM { 14, "FFB454", "2A211C", 0 }, // REGEX { 1, "1E9AE0", "2A211C", 0 }, // COMMENT { 2, "1E9AE0", "2A211C", 0 }, // COMMENT LINE { 3, "1E9AE0", "2A211C", 0 }, // COMMENT DOC { 15, "1E9AE0", "2A211C", 0 }, // COMMENT LINE DOC { 17, "1E9AE0", "2A211C", 0 }, // COMMENT DOC KEYWORD { 18, "1E9AE0", "2A211C", 0 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle java_Bespin[] = { { 9, "FFAA00", "2A211C", 0 }, // PREPROCESSOR { 11, "F8F8F8", "2A211C", 0 }, // DEFAULT { 5, "F6F080", "2A211C", 0 }, // INSTRUCTION WORD { 16, "FFAA00", "2A211C", 0 }, // TYPE WORD { 4, "FF3A83", "2A211C", 0 }, // NUMBER { 6, "55E439", "2A211C", 0 }, // STRING { 7, "55E439", "2A211C", 0 }, // CHARACTER { 10, "FFAA00", "2A211C", 0 }, // OPERATOR { 13, "FF3A83", "2A211C", 0 }, // VERBATIM { 14, "FFB454", "2A211C", 0 }, // REGEX { 1, "1E9AE0", "2A211C", 0 }, // COMMENT { 2, "1E9AE0", "2A211C", 0 }, // COMMENT LINE { 3, "1E9AE0", "2A211C", 0 }, // COMMENT DOC { 15, "1E9AE0", "2A211C", 0 }, // COMMENT LINE DOC { 17, "1E9AE0", "2A211C", 0 }, // COMMENT DOC KEYWORD { 18, "1E9AE0", "2A211C", 0 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle javascript_Bespin[] = { { 41, "BDAF9D", "2A211C", 0 }, // DEFAULT { 45, "FF3A83", "2A211C", 0 }, // NUMBER { 46, "BDAE9D", "2A211C", 0 }, // WORD { 47, "37A3ED", "2A211C", 0 }, // KEYWORD { 16, "FF5555", "2A211C", 0 }, // USER-DEFINED { 48, "00FF40", "2A211C", 0 }, // DOUBLESTRING { 49, "80FF00", "2A211C", 0 }, // SINGLESTRING { 50, "E5C138", "2A211C", 0 }, // SYMBOLS { 51, "55E439", "2A211C", 0 }, // STRINGEOL { 52, "FFB454", "2A211C", 0 }, // REGEX { 42, "666666", "2A211C", 0 }, // COMMENT { 43, "666666", "2A211C", 0 }, // COMMENTLINE { 44, "FFFF80", "2A211C", 0 }, // COMMENTDOC { 17, "FF0080", "2A211C", 0 }, // COMMENT DOC KEYWORD { 18, "FF0080", "2A211C", 0 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle python_Bespin[] = { { 0, "F8F8F8", "2A211C", 0 }, // DEFAULT { 1, "1E9AE0", "2A211C", 0 }, // COMMENTLINE { 2, "FF3A83", "2A211C", 0 }, // NUMBER { 3, "55E439", "2A211C", 0 }, // STRING { 4, "55E439", "2A211C", 0 }, // CHARACTER { 5, "FFAA00", "2A211C", 0 }, // KEYWORDS { 6, "000000", "2A211C", 0 }, // TRIPLE { 7, "000000", "2A211C", 0 }, // TRIPLEDOUBLE { 8, "000000", "2A211C", 0 }, // CLASSNAME { 9, "000000", "2A211C", 0 }, // DEFNAME { 10, "FFAA00", "2A211C", 0 }, // OPERATOR { 11, "EB939A", "2A211C", 0 }, // IDENTIFIER { 12, "1E9AE0", "2A211C", 0 }, // COMMENTBLOCK { 12, "55E439", "2A211C", 0 }, // STRINGEOL }; static const lexstyle ruby_Bespin[] = { { 0, "F8F8F8", "2A211C", 0 }, // DEFAULT { 1, "000000", "2A211C", 0 }, // ERROR { 2, "1E9AE0", "2A211C", 0 }, // COMMENTLINE { 3, "000000", "2A211C", 0 }, // POD { 4, "FF3A83", "2A211C", 0 }, // NUMBER { 5, "FFAA00", "2A211C", 0 }, // INSTRUCTION { 6, "55E439", "2A211C", 0 }, // STRING { 7, "55E439", "2A211C", 0 }, // CHARACTER { 8, "EFE900", "2A211C", 0 }, // CLASS NAME { 9, "EFE900", "2A211C", 0 }, // DEF NAME { 10, "FFAA00", "2A211C", 0 }, // OPERATOR { 11, "EB939A", "2A211C", 0 }, // IDENTIFIER { 12, "FFB454", "2A211C", 0 }, // REGEX { 13, "FB9A4B", "2A211C", 0 }, // GLOBAL { 14, "F8F8F8", "2A211C", 0 }, // SYMBOL { 15, "000000", "2A211C", 0 }, // MODULE NAME { 16, "FB9A4B", "2A211C", 0 }, // INSTANCE VAR { 17, "000000", "2A211C", 0 }, // CLASS VAR { 18, "000000", "2A211C", 0 }, // BACKTICKS { 19, "000000", "2A211C", 0 }, // DATA SECTION { 24, "55E439", "2A211C", 0 }, // STRING Q }; static const lexstyle global_Zenburn[] = { { 32, "DCDCCC", "3F3F3F", 0 }, // Default Style { 37, "4F5F5F", "3F3F3F", 0 }, // Indent guideline style { 34, "F0F9F9", "3F3F3F", 1 }, // Brace highlight style { 35, "F09F9F", "3F3F3F", 0 }, // Bad brace colour { 2069, "8FAF9F", "3F3F3F", 0 }, // Caret colour { 33, "8A8A8A", "0C0C0C", 0 }, // Line number margin { 29, "DCDCCC", "358A35", 0 }, // Smart HighLighting { 31, "DCDCCC", "FF0000", 0 }, // Find Mark Style { 25, "DCDCCC", "88B090", 0 }, // Mark Style 1 { 24, "DCDCCC", "F8F893", 0 }, // Mark Style 2 { 23, "DCDCCC", "F18C96", 0 }, // Mark Style 3 { 22, "DCDCCC", "408040", 0 }, // Mark Style 4 { 21, "DCDCCC", "968CF1", 0 }, // Mark Style 5 { 28, "DCDCCC", "C3BF9F", 0 }, // Incremental highlight all { 27, "DCDCCC", "C6C600", 0 }, // Tags match highlighting { 26, "DCDCCC", "78926F", 0 }, // Tags attribute }; static const lexstyle cpp_Zenburn[] = { { 9, "FFCFAF", "3F3F3F", 0 }, // PREPROCESSOR { 11, "DCDCCC", "3F3F3F", 0 }, // DEFAULT { 5, "DFC47D", "3F3F3F", 1 }, // INSTRUCTION WORD { 16, "CEDF99", "3F3F3F", 1 }, // TYPE WORD { 4, "8CD0D3", "3F3F3F", 0 }, // NUMBER { 6, "CC9393", "3F3F3F", 0 }, // STRING { 7, "DCA3A3", "3F3F3F", 0 }, // CHARACTER { 10, "9F9D6D", "3F3F3F", 1 }, // OPERATOR { 13, "CC9393", "3F3F3F", 0 }, // VERBATIM { 14, "C89191", "3F3F3F", 1 }, // REGEX { 1, "7F9F7F", "3F3F3F", 3 }, // COMMENT { 2, "7F9F7F", "3F3F3F", 3 }, // COMMENT LINE { 3, "7F9F7F", "3F3F3F", 2 }, // COMMENT DOC { 15, "7F9F7F", "3F3F3F", 2 }, // COMMENT LINE DOC { 17, "7F9F7F", "3F3F3F", 3 }, // COMMENT DOC KEYWORD { 18, "7F9F7F", "3F3F3F", 2 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle java_Zenburn[] = { { 9, "FFCFAF", "3F3F3F", 0 }, // PREPROCESSOR { 11, "DCDCCC", "3F3F3F", 0 }, // DEFAULT { 5, "DFC47D", "3F3F3F", 1 }, // INSTRUCTION WORD { 16, "CEDF99", "3F3F3F", 1 }, // TYPE WORD { 4, "8CD0D3", "3F3F3F", 0 }, // NUMBER { 6, "CC9393", "3F3F3F", 0 }, // STRING { 7, "DCA3A3", "3F3F3F", 0 }, // CHARACTER { 10, "9F9D6D", "3F3F3F", 1 }, // OPERATOR { 13, "CC9393", "3F3F3F", 0 }, // VERBATIM { 14, "C89191", "3F3F3F", 1 }, // REGEX { 1, "7F9F7F", "3F3F3F", 3 }, // COMMENT { 2, "7F9F7F", "3F3F3F", 3 }, // COMMENT LINE { 3, "7F9F7F", "3F3F3F", 3 }, // COMMENT DOC { 15, "7F9F7F", "3F3F3F", 2 }, // COMMENT LINE DOC { 17, "7F9F7F", "3F3F3F", 2 }, // COMMENT DOC KEYWORD { 18, "7F9F7F", "3F3F3F", 2 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle javascript_Zenburn[] = { { 41, "DCDCCC", "3F3F3F", 0 }, // DEFAULT { 45, "8CD0D3", "3F3F3F", 0 }, // NUMBER { 46, "DCDCCC", "3F3F3F", 0 }, // WORD { 47, "CEDF99", "3F3F3F", 3 }, // KEYWORD { 48, "CC9393", "3F3F3F", 0 }, // DOUBLESTRING { 49, "CC9393", "3F3F3F", 0 }, // SINGLESTRING { 50, "DFC47D", "3F3F3F", 1 }, // SYMBOLS { 52, "CC9393", "3F3F3F", 1 }, // REGEX { 42, "7F9F7F", "3F3F3F", 3 }, // COMMENT { 43, "7F9F7F", "3F3F3F", 3 }, // COMMENTLINE { 44, "7F9F7F", "3F3F3F", 2 }, // COMMENTDOC }; static const lexstyle python_Zenburn[] = { { 0, "DCDCCC", "3F3F3F", 0 }, // DEFAULT { 1, "7F9F7F", "3F3F3F", 3 }, // COMMENTLINE { 2, "8CD0D3", "3F3F3F", 0 }, // NUMBER { 3, "CC9393", "3F3F3F", 0 }, // STRING { 4, "DCA3A3", "3F3F3F", 0 }, // CHARACTER { 5, "DFC47D", "3F3F3F", 1 }, // KEYWORDS { 6, "7F9F7F", "3F3F3F", 0 }, // TRIPLE { 7, "7F9F7F", "3F3F3F", 0 }, // TRIPLEDOUBLE { 8, "DCDCCC", "3F3F3F", 0 }, // CLASSNAME { 9, "CEDF99", "3F3F3F", 0 }, // DEFNAME { 10, "9F9D6D", "3F3F3F", 1 }, // OPERATOR { 11, "DCDCCC", "3F3F3F", 0 }, // IDENTIFIER { 12, "7F9F7F", "3F3F3F", 0 }, // COMMENTBLOCK }; static const lexstyle ruby_Zenburn[] = { { 0, "DCDCCC", "3F3F3F", 0 }, // DEFAULT { 1, "EBD6EB", "3F3F3F", 0 }, // ERROR { 2, "7F9F7F", "3F3F3F", 3 }, // COMMENTLINE { 3, "DCDCCC", "3F3F3F", 0 }, // POD { 4, "8CD0D3", "3F3F3F", 0 }, // NUMBER { 5, "E3CEAB", "3F3F3F", 1 }, // INSTRUCTION { 6, "CC9393", "3F3F3F", 0 }, // STRING { 7, "DCA3A3", "3F3F3F", 0 }, // CHARACTER { 8, "DFE4CF", "3F3F3F", 1 }, // CLASS NAME { 9, "EFEF8F", "3F3F3F", 0 }, // DEF NAME { 10, "9F9D6D", "3F3F3F", 1 }, // OPERATOR { 11, "FFEBDD", "3F3F3F", 0 }, // IDENTIFIER { 12, "CC9393", "3F3F3F", 1 }, // REGEX { 13, "FFEBDD", "3F3F3F", 3 }, // GLOBAL { 14, "E3CEAB", "3F3F3F", 0 }, // SYMBOL { 15, "DCDCCC", "3F3F3F", 1 }, // MODULE NAME { 16, "FFCFAF", "3F3F3F", 0 }, // INSTANCE VAR { 17, "FFCFAF", "3F3F3F", 1 }, // CLASS VAR { 18, "DCDCCC", "3F3F3F", 0 }, // BACKTICKS { 19, "DCDCCC", "3F3F3F", 0 }, // DATA SECTION { 24, "C89191", "3F3F3F", 0 }, // STRING Q }; static const lexstyle global_Plastic_Code_Wrap[] = { { 32, "F8F8F8", "0B161D", 0 }, // Default Style { 37, "888A85", "0B161D", 0 }, // Indent guideline style { 34, "FCE94F", "0B161D", 1 }, // Brace highlight style { 35, "EF2929", "0B161D", 0 }, // Bad brace colour { 2069, "8BA7A7", "0B161D", 0 }, // Caret colour { 31, "CC0000", "EDD400", 0 }, // Find Mark Style { 33, "EEEEEC", "2E3436", 0 }, // Line number margin { 29, "555753", "00FF00", 0 }, // Smart HighLighting { 31, "FCAF3E", "FF0000", 0 }, // Find Mark Style { 25, "F8F8F8", "00FFFF", 0 }, // Mark Style 1 { 24, "F8F8F8", "FF8000", 0 }, // Mark Style 2 { 23, "F8F8F8", "FFFF00", 0 }, // Mark Style 3 { 22, "F8F8F8", "8000FF", 0 }, // Mark Style 4 { 21, "F8F8F8", "008000", 0 }, // Mark Style 5 { 28, "FFCAB0", "0080FF", 0 }, // Incremental highlight all { 27, "000000", "8000FF", 0 }, // Tags match highlighting { 26, "8080C0", "FFFF00", 0 }, // Tags attribute }; static const lexstyle cpp_Plastic_Code_Wrap[] = { { 9, "FFAA00", "0B161D", 0 }, // PREPROCESSOR { 11, "F8F8F8", "0B161D", 0 }, // DEFAULT { 5, "F6F080", "0B161D", 0 }, // INSTRUCTION WORD { 16, "FFAA00", "0B161D", 0 }, // TYPE WORD { 4, "FF3A83", "0B161D", 0 }, // NUMBER { 6, "55E439", "0B161D", 0 }, // STRING { 7, "55E439", "0B161D", 0 }, // CHARACTER { 10, "FFAA00", "0B161D", 0 }, // OPERATOR { 13, "FF3A83", "0B161D", 0 }, // VERBATIM { 14, "FFB454", "0B161D", 0 }, // REGEX { 1, "1E9AE0", "0B161D", 0 }, // COMMENT { 2, "1E9AE0", "0B161D", 0 }, // COMMENT LINE { 3, "1E9AE0", "0B161D", 0 }, // COMMENT DOC { 15, "1E9AE0", "0B161D", 0 }, // COMMENT LINE DOC { 17, "1E9AE0", "0B161D", 0 }, // COMMENT DOC KEYWORD { 18, "1E9AE0", "0B161D", 0 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle java_Plastic_Code_Wrap[] = { { 9, "FFAA00", "0B161D", 0 }, // PREPROCESSOR { 11, "F8F8F8", "0B161D", 0 }, // DEFAULT { 5, "F6F080", "0B161D", 0 }, // INSTRUCTION WORD { 16, "FFAA00", "0B161D", 0 }, // TYPE WORD { 4, "FF3A83", "0B161D", 0 }, // NUMBER { 6, "55E439", "0B161D", 0 }, // STRING { 7, "55E439", "0B161D", 0 }, // CHARACTER { 10, "FFAA00", "0B161D", 0 }, // OPERATOR { 13, "FF3A83", "0B161D", 0 }, // VERBATIM { 14, "FFB454", "0B161D", 0 }, // REGEX { 1, "1E9AE0", "0B161D", 0 }, // COMMENT { 2, "1E9AE0", "0B161D", 0 }, // COMMENT LINE { 3, "1E9AE0", "0B161D", 0 }, // COMMENT DOC { 15, "1E9AE0", "0B161D", 0 }, // COMMENT LINE DOC { 17, "1E9AE0", "0B161D", 0 }, // COMMENT DOC KEYWORD { 18, "1E9AE0", "0B161D", 0 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle javascript_Plastic_Code_Wrap[] = { { 41, "F8F8F8", "0B161D", 0 }, // DEFAULT { 45, "FF3A83", "0B161D", 0 }, // NUMBER { 46, "F8F8F8", "0B161D", 0 }, // WORD { 47, "FFAA00", "0B161D", 0 }, // KEYWORD { 48, "55E439", "0B161D", 0 }, // DOUBLESTRING { 49, "55E439", "0B161D", 0 }, // SINGLESTRING { 50, "F8F8F8", "0B161D", 0 }, // SYMBOLS { 51, "55E439", "0B161D", 0 }, // STRINGEOL { 52, "FFB454", "0B161D", 0 }, // REGEX { 42, "1E9AE0", "0B161D", 0 }, // COMMENT { 43, "1E9AE0", "0B161D", 0 }, // COMMENTLINE { 44, "1E9AE0", "0B161D", 0 }, // COMMENTDOC }; static const lexstyle python_Plastic_Code_Wrap[] = { { 0, "F8F8F8", "0B161D", 0 }, // DEFAULT { 1, "1E9AE0", "0B161D", 0 }, // COMMENTLINE { 2, "FF3A83", "0B161D", 0 }, // NUMBER { 3, "55E439", "0B161D", 0 }, // STRING { 4, "55E439", "0B161D", 0 }, // CHARACTER { 5, "FFAA00", "0B161D", 0 }, // KEYWORDS { 6, "000000", "0B161D", 0 }, // TRIPLE { 7, "000000", "0B161D", 0 }, // TRIPLEDOUBLE { 8, "000000", "0B161D", 0 }, // CLASSNAME { 9, "000000", "0B161D", 0 }, // DEFNAME { 10, "FFAA00", "0B161D", 0 }, // OPERATOR { 11, "EB939A", "0B161D", 0 }, // IDENTIFIER { 12, "1E9AE0", "0B161D", 0 }, // COMMENTBLOCK { 12, "55E439", "0B161D", 0 }, // STRINGEOL }; static const lexstyle ruby_Plastic_Code_Wrap[] = { { 0, "F8F8F8", "0B161D", 0 }, // DEFAULT { 1, "000000", "0B161D", 0 }, // ERROR { 2, "1E9AE0", "0B161D", 0 }, // COMMENTLINE { 3, "000000", "0B161D", 0 }, // POD { 4, "FF3A83", "0B161D", 0 }, // NUMBER { 5, "FFAA00", "0B161D", 0 }, // INSTRUCTION { 6, "55E439", "0B161D", 0 }, // STRING { 7, "55E439", "0B161D", 0 }, // CHARACTER { 8, "EFE900", "0B161D", 0 }, // CLASS NAME { 9, "EFE900", "0B161D", 0 }, // DEF NAME { 10, "FFAA00", "0B161D", 0 }, // OPERATOR { 11, "EB939A", "0B161D", 0 }, // IDENTIFIER { 12, "FFB454", "0B161D", 0 }, // REGEX { 13, "FB9A4B", "0B161D", 0 }, // GLOBAL { 14, "F8F8F8", "0B161D", 0 }, // SYMBOL { 15, "000000", "0B161D", 0 }, // MODULE NAME { 16, "FB9A4B", "0B161D", 0 }, // INSTANCE VAR { 17, "000000", "0B161D", 0 }, // CLASS VAR { 18, "000000", "0B161D", 0 }, // BACKTICKS { 19, "000000", "0B161D", 0 }, // DATA SECTION { 24, "55E439", "0B161D", 0 }, // STRING Q }; static const lexstyle global_Solarized[] = { { 32, "839496", "002B36", 0 }, // Default Style { 37, "586E75", "002B36", 0 }, // Indent guideline style { 34, "DC322F", "859900", 1 }, // Brace highlight style { 35, "D33682", "002B36", 0 }, // Bad brace colour { 2069, "EEE8D5", "002B36", 0 }, // Caret colour { 33, "586E75", "073642", 0 }, // Line number margin { 29, "839496", "FDF6E3", 0 }, // Smart HighLighting { 31, "839496", "6C71C4", 0 }, // Find Mark Style { 25, "839496", "DC322F", 0 }, // Mark Style 1 { 24, "839496", "268BD2", 0 }, // Mark Style 2 { 23, "839496", "2AA198", 0 }, // Mark Style 3 { 22, "839496", "859900", 0 }, // Mark Style 4 { 21, "839496", "B58900", 0 }, // Mark Style 5 { 28, "839496", "002B36", 0 }, // Incremental highlight all { 27, "839496", "CB4B16", 0 }, // Tags match highlighting { 26, "839496", "CB4B16", 0 }, // Tags attribute }; static const lexstyle cpp_Solarized[] = { { 9, "DC322F", "002B36", 0 }, // PREPROCESSOR { 11, "839496", "002B36", 0 }, // DEFAULT { 5, "859900", "002B36", 0 }, // INSTRUCTION WORD { 16, "B58900", "002B36", 0 }, // TYPE WORD { 4, "2AA198", "002B36", 0 }, // NUMBER { 6, "2AA198", "002B36", 0 }, // STRING { 7, "2AA198", "002B36", 0 }, // CHARACTER { 10, "93A1A1", "002B36", 0 }, // OPERATOR { 13, "2AA198", "002B36", 0 }, // VERBATIM { 14, "268BD2", "002B36", 0 }, // REGEX { 1, "586E75", "002B36", 2 }, // COMMENT { 2, "586E75", "002B36", 2 }, // COMMENT LINE { 3, "586E75", "002B36", 2 }, // COMMENT DOC { 15, "586E75", "002B36", 2 }, // COMMENT LINE DOC { 17, "586E75", "002B36", 3 }, // COMMENT DOC KEYWORD { 18, "D33682", "002B36", 3 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle java_Solarized[] = { { 9, "DC322F", "002B36", 0 }, // PREPROCESSOR { 11, "839496", "002B36", 0 }, // DEFAULT { 5, "859900", "002B36", 0 }, // INSTRUCTION WORD { 16, "B58900", "002B36", 0 }, // TYPE WORD { 4, "2AA198", "002B36", 0 }, // NUMBER { 6, "2AA198", "002B36", 0 }, // STRING { 7, "2AA198", "002B36", 0 }, // CHARACTER { 10, "93A1A1", "002B36", 0 }, // OPERATOR { 13, "2AA198", "002B36", 0 }, // VERBATIM { 14, "268BD2", "002B36", 0 }, // REGEX { 1, "586E75", "002B36", 2 }, // COMMENT { 2, "586E75", "002B36", 2 }, // COMMENT LINE { 3, "586E75", "002B36", 2 }, // COMMENT DOC { 15, "586E75", "002B36", 2 }, // COMMENT LINE DOC { 17, "268BD2", "002B36", 3 }, // COMMENT DOC KEYWORD { 18, "D33682", "002B36", 3 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle javascript_Solarized[] = { { 41, "839496", "002B36", 0 }, // DEFAULT { 45, "2AA198", "002B36", 0 }, // NUMBER { 46, "B58900", "002B36", 0 }, // WORD { 47, "859900", "002B36", 0 }, // KEYWORD { 48, "2AA198", "002B36", 0 }, // DOUBLESTRING { 49, "2AA198", "002B36", 0 }, // SINGLESTRING { 50, "839496", "002B36", 0 }, // SYMBOLS { 51, "DC322F", "002B36", 0 }, // STRINGEOL { 52, "268BD2", "002B36", 0 }, // REGEX { 42, "586E75", "002B36", 2 }, // COMMENT { 43, "586E75", "002B36", 2 }, // COMMENTLINE { 44, "586E75", "002B36", 2 }, // COMMENTDOC { 17, "268BD2", "002B36", 3 }, // COMMENT DOC KEYWORD { 18, "D33682", "002B36", 3 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle python_Solarized[] = { { 0, "839496", "002B36", 0 }, // DEFAULT { 1, "586E75", "002B36", 2 }, // COMMENTLINE { 2, "2AA198", "002B36", 0 }, // NUMBER { 3, "2AA198", "002B36", 0 }, // STRING { 4, "2AA198", "002B36", 0 }, // CHARACTER { 5, "859900", "002B36", 0 }, // KEYWORDS { 6, "2AA198", "002B36", 0 }, // TRIPLE { 7, "2AA198", "002B36", 0 }, // TRIPLEDOUBLE { 8, "CB4B16", "002B36", 0 }, // CLASSNAME { 9, "CB4B16", "002B36", 0 }, // DEFNAME { 10, "93A1A1", "002B36", 0 }, // OPERATOR { 11, "B58900", "002B36", 0 }, // IDENTIFIER { 12, "586E75", "002B36", 2 }, // COMMENTBLOCK { 12, "586E75", "002B36", 0 }, // STRINGEOL }; static const lexstyle ruby_Solarized[] = { { 0, "839496", "002B36", 0 }, // DEFAULT { 1, "DC322F", "002B36", 0 }, // ERROR { 2, "586E75", "002B36", 2 }, // COMMENTLINE { 3, "839496", "002B36", 2 }, // POD { 4, "2AA198", "002B36", 0 }, // NUMBER { 5, "859900", "002B36", 0 }, // INSTRUCTION { 6, "2AA198", "002B36", 0 }, // STRING { 7, "2AA198", "002B36", 0 }, // CHARACTER { 8, "B58900", "002B36", 0 }, // CLASS NAME { 9, "268BD2", "002B36", 0 }, // DEF NAME { 10, "93A1A1", "002B36", 0 }, // OPERATOR { 11, "B58900", "002B36", 0 }, // IDENTIFIER { 12, "268BD2", "002B36", 0 }, // REGEX { 13, "B58900", "002B36", 0 }, // GLOBAL { 14, "839496", "002B36", 0 }, // SYMBOL { 15, "CB4B16", "002B36", 0 }, // MODULE NAME { 16, "B58900", "002B36", 0 }, // INSTANCE VAR { 17, "839496", "002B36", 0 }, // CLASS VAR { 18, "EEE8D5", "6C71C4", 0 }, // BACKTICKS { 19, "2AA198", "002B36", 0 }, // DATA SECTION { 24, "2AA198", "002B36", 0 }, // STRING Q { 25, "268BD2", "002B36", 0 }, // BOOLEAN }; static const lexstyle global_Hello_Kitty[] = { { 32, "000000", "FFB0FF", 0 }, // Default Style { 37, "C0C0C0", "FFB0FF", 0 }, // Indent guideline style { 34, "FF0000", "FFB0FF", 1 }, // Brace highlight style { 35, "800000", "FFB0FF", 0 }, // Bad brace colour { 2069, "FFFFFF", "372017", 0 }, // Caret colour { 33, "FFFFFF", "FF80FF", 0 }, // Line number margin { 29, "555753", "00FF00", 0 }, // Smart HighLighting { 31, "FCAF3E", "FF0000", 0 }, // Find Mark Style { 25, "000000", "00FFFF", 0 }, // Mark Style 1 { 24, "000000", "FF8000", 0 }, // Mark Style 2 { 23, "000000", "FFFF00", 0 }, // Mark Style 3 { 22, "000000", "8000FF", 0 }, // Mark Style 4 { 21, "FAAA3C", "008000", 0 }, // Mark Style 5 { 28, "FFCAB0", "0080FF", 0 }, // Incremental highlight all { 27, "000000", "8000FF", 0 }, // Tags match highlighting { 26, "8080C0", "FFFF00", 0 }, // Tags attribute }; static const lexstyle cpp_Hello_Kitty[] = { { 9, "804000", "FFB0FF", 0 }, // PREPROCESSOR { 11, "000000", "FFB0FF", 0 }, // DEFAULT { 5, "0000FF", "FFB0FF", 1 }, // INSTRUCTION WORD { 16, "8000FF", "FFB0FF", 0 }, // TYPE WORD { 4, "FF8000", "FFB0FF", 0 }, // NUMBER { 6, "808080", "FFB0FF", 0 }, // STRING { 7, "808080", "FFB0FF", 0 }, // CHARACTER { 10, "000080", "FFB0FF", 1 }, // OPERATOR { 13, "000000", "FFB0FF", 0 }, // VERBATIM { 14, "000000", "FFB0FF", 1 }, // REGEX { 1, "008000", "FFB0FF", 0 }, // COMMENT { 2, "008000", "FFB0FF", 0 }, // COMMENT LINE { 3, "008080", "FFB0FF", 0 }, // COMMENT DOC { 15, "008080", "FFB0FF", 0 }, // COMMENT LINE DOC { 17, "008080", "FFB0FF", 1 }, // COMMENT DOC KEYWORD { 18, "008080", "FFB0FF", 0 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle java_Hello_Kitty[] = { { 9, "804000", "FFB0FF", 0 }, // PREPROCESSOR { 11, "000000", "FFB0FF", 0 }, // DEFAULT { 5, "0000FF", "FFB0FF", 1 }, // INSTRUCTION WORD { 16, "8000FF", "FFB0FF", 0 }, // TYPE WORD { 4, "FF8000", "FFB0FF", 0 }, // NUMBER { 6, "808080", "FFB0FF", 0 }, // STRING { 7, "808080", "FFB0FF", 0 }, // CHARACTER { 10, "000080", "FFB0FF", 1 }, // OPERATOR { 13, "000000", "FFB0FF", 0 }, // VERBATIM { 14, "000000", "FFB0FF", 1 }, // REGEX { 1, "008000", "FFB0FF", 0 }, // COMMENT { 2, "008000", "FFB0FF", 0 }, // COMMENT LINE { 3, "008080", "FFB0FF", 0 }, // COMMENT DOC { 15, "008080", "FFB0FF", 0 }, // COMMENT LINE DOC { 17, "008080", "FFB0FF", 1 }, // COMMENT DOC KEYWORD { 18, "008080", "FFB0FF", 0 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle javascript_Hello_Kitty[] = { { 41, "000000", "F2F4FF", 0 }, // DEFAULT { 45, "FF0000", "F2F4FF", 0 }, // NUMBER { 46, "000000", "F2F4FF", 0 }, // WORD { 47, "000080", "F2F4FF", 3 }, // KEYWORD { 48, "808080", "F2F4FF", 0 }, // DOUBLESTRING { 49, "808080", "F2F4FF", 0 }, // SINGLESTRING { 50, "000000", "F2F4FF", 1 }, // SYMBOLS { 51, "808080", "F2F4FF", 1 }, // STRINGEOL { 52, "8000FF", "F2F4FF", 0 }, // REGEX { 42, "008000", "F2F4FF", 0 }, // COMMENT { 43, "008000", "F2F4FF", 0 }, // COMMENTLINE { 44, "008080", "F2F4FF", 0 }, // COMMENTDOC }; static const lexstyle python_Hello_Kitty[] = { { 0, "000000", "FFB0FF", 0 }, // DEFAULT { 1, "008000", "FFB0FF", 0 }, // COMMENTLINE { 2, "FF0000", "FFB0FF", 0 }, // NUMBER { 3, "808080", "FFB0FF", 0 }, // STRING { 4, "808080", "FFB0FF", 0 }, // CHARACTER { 5, "0000FF", "FFB0FF", 1 }, // KEYWORDS { 6, "FF8000", "FFB0FF", 0 }, // TRIPLE { 7, "000000", "FFB0FF", 0 }, // TRIPLEDOUBLE { 8, "000000", "FFB0FF", 1 }, // CLASSNAME { 9, "FF00FF", "FFB0FF", 0 }, // DEFNAME { 10, "000080", "FFB0FF", 1 }, // OPERATOR { 11, "000000", "FFB0FF", 0 }, // IDENTIFIER { 12, "008000", "FFB0FF", 0 }, // COMMENTBLOCK { 12, "FFFF00", "FFB0FF", 0 }, // STRINGEOL }; static const lexstyle ruby_Hello_Kitty[] = { { 0, "000000", "FFB0FF", 0 }, // DEFAULT { 1, "000000", "FFB0FF", 0 }, // ERROR { 2, "008000", "FFB0FF", 0 }, // COMMENTLINE { 3, "004000", "C0FFC0", 0 }, // POD { 4, "FF8000", "FFB0FF", 0 }, // NUMBER { 5, "0000FF", "FFB0FF", 1 }, // INSTRUCTION { 6, "808080", "FFB0FF", 0 }, // STRING { 7, "808000", "FFB0FF", 0 }, // CHARACTER { 8, "0080C0", "FFB0FF", 1 }, // CLASS NAME { 9, "8080FF", "FFFFCC", 1 }, // DEF NAME { 10, "000080", "FFB0FF", 1 }, // OPERATOR { 11, "000000", "FFB0FF", 0 }, // IDENTIFIER { 12, "0080FF", "FFB0FF", 0 }, // REGEX { 13, "000080", "FFB0FF", 1 }, // GLOBAL { 14, "000000", "FFB0FF", 0 }, // SYMBOL { 15, "804000", "FFB0FF", 1 }, // MODULE NAME { 16, "000000", "FFB0FF", 0 }, // INSTANCE VAR { 17, "000000", "FFB0FF", 0 }, // CLASS VAR { 18, "FFFF00", "A08080", 0 }, // BACKTICKS { 19, "600000", "FFF0D8", 0 }, // DATA SECTION { 24, "808080", "FFB0FF", 0 }, // STRING Q }; static const lexstyle global_HotFudgeSundae[] = { { 32, "B7975D", "2b0f01", 0 }, // Default Style { 37, "8B642B", "2b0f01", 0 }, // Indent guideline style { 34, "2b0f01", "EC6221", 1 }, // Brace highlight style { 35, "ff00ff", "2b0f01", 0 }, // Bad brace colour { 2069, "faf1c6", "2b0f01", 0 }, // Caret colour { 33, "8B642B", "43250b", 0 }, // Line number margin { 29, "B7975D", "008947", 0 }, // Smart HighLighting { 31, "B7975D", "7578DB", 0 }, // Find Mark Style { 25, "B7975D", "C11418", 0 }, // Mark Style 1 { 24, "B7975D", "0088CE", 0 }, // Mark Style 2 { 23, "B7975D", "BCBB80", 0 }, // Mark Style 3 { 22, "B7975D", "42A658", 0 }, // Mark Style 4 { 21, "B7975D", "cfba28", 0 }, // Mark Style 5 { 28, "B7975D", "2b0f01", 0 }, // Incremental highlight all { 27, "B7975D", "990000", 0 }, // Tags match highlighting { 26, "B7975D", "3D0B0C", 0 }, // Tags attribute }; static const lexstyle cpp_HotFudgeSundae[] = { { 9, "C11418", "2b0f01", 0 }, // PREPROCESSOR { 11, "B7975D", "2b0f01", 0 }, // DEFAULT { 5, "42A658", "2b0f01", 0 }, // INSTRUCTION WORD { 16, "cfba28", "2b0f01", 0 }, // TYPE WORD { 4, "AFA7D6", "2b0f01", 0 }, // NUMBER { 6, "BCBB80", "2b0f01", 0 }, // STRING { 7, "BCBB80", "2b0f01", 0 }, // CHARACTER { 10, "D6C479", "2b0f01", 0 }, // OPERATOR { 13, "BCBB80", "2b0f01", 0 }, // VERBATIM { 14, "0088CE", "2b0f01", 0 }, // REGEX { 1, "255C08", "2b0f01", 2 }, // COMMENT { 2, "255C08", "2b0f01", 2 }, // COMMENT LINE { 3, "255C08", "2b0f01", 2 }, // COMMENT DOC { 15, "255C08", "2b0f01", 2 }, // COMMENT LINE DOC { 17, "255C08", "2b0f01", 3 }, // COMMENT DOC KEYWORD { 18, "ff00ff", "2b0f01", 3 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle java_HotFudgeSundae[] = { { 9, "C11418", "2b0f01", 0 }, // PREPROCESSOR { 11, "B7975D", "2b0f01", 0 }, // DEFAULT { 5, "42A658", "2b0f01", 0 }, // INSTRUCTION WORD { 16, "cfba28", "2b0f01", 0 }, // TYPE WORD { 4, "AFA7D6", "2b0f01", 0 }, // NUMBER { 6, "BCBB80", "2b0f01", 0 }, // STRING { 7, "BCBB80", "2b0f01", 0 }, // CHARACTER { 10, "D6C479", "2b0f01", 0 }, // OPERATOR { 13, "BCBB80", "2b0f01", 0 }, // VERBATIM { 14, "0088CE", "2b0f01", 0 }, // REGEX { 1, "255C08", "2b0f01", 2 }, // COMMENT { 2, "255C08", "2b0f01", 2 }, // COMMENT LINE { 3, "255C08", "2b0f01", 2 }, // COMMENT DOC { 15, "255C08", "2b0f01", 2 }, // COMMENT LINE DOC { 17, "0088CE", "2b0f01", 3 }, // COMMENT DOC KEYWORD { 18, "ff00ff", "2b0f01", 3 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle javascript_HotFudgeSundae[] = { { 41, "B7975D", "2b0f01", 0 }, // DEFAULT { 45, "AFA7D6", "2b0f01", 0 }, // NUMBER { 46, "cfba28", "2b0f01", 0 }, // WORD { 47, "42A658", "2b0f01", 0 }, // KEYWORD { 48, "BCBB80", "2b0f01", 0 }, // DOUBLESTRING { 49, "BCBB80", "2b0f01", 0 }, // SINGLESTRING { 50, "B7975D", "2b0f01", 0 }, // SYMBOLS { 51, "C11418", "2b0f01", 0 }, // STRINGEOL { 52, "0088CE", "2b0f01", 0 }, // REGEX { 42, "255C08", "2b0f01", 2 }, // COMMENT { 43, "255C08", "2b0f01", 2 }, // COMMENTLINE { 44, "255C08", "2b0f01", 2 }, // COMMENTDOC { 17, "0088CE", "2b0f01", 3 }, // COMMENT DOC KEYWORD { 18, "ff00ff", "2b0f01", 3 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle python_HotFudgeSundae[] = { { 0, "B7975D", "2b0f01", 0 }, // DEFAULT { 1, "255C08", "2b0f01", 2 }, // COMMENTLINE { 2, "AFA7D6", "2b0f01", 0 }, // NUMBER { 3, "BCBB80", "2b0f01", 0 }, // STRING { 4, "BCBB80", "2b0f01", 0 }, // CHARACTER { 5, "42A658", "2b0f01", 0 }, // KEYWORDS { 6, "BCBB80", "2b0f01", 0 }, // TRIPLE { 7, "BCBB80", "2b0f01", 0 }, // TRIPLEDOUBLE { 8, "d92b10", "2b0f01", 0 }, // CLASSNAME { 9, "d92b10", "2b0f01", 0 }, // DEFNAME { 10, "D6C479", "2b0f01", 0 }, // OPERATOR { 11, "cfba28", "2b0f01", 0 }, // IDENTIFIER { 12, "255C08", "2b0f01", 2 }, // COMMENTBLOCK { 12, "255C08", "2b0f01", 0 }, // STRINGEOL }; static const lexstyle ruby_HotFudgeSundae[] = { { 0, "B7975D", "2b0f01", 0 }, // DEFAULT { 1, "C11418", "2b0f01", 0 }, // ERROR { 2, "255C08", "2b0f01", 2 }, // COMMENTLINE { 3, "B7975D", "2b0f01", 2 }, // POD { 4, "AFA7D6", "2b0f01", 0 }, // NUMBER { 5, "42A658", "2b0f01", 0 }, // INSTRUCTION { 6, "BCBB80", "2b0f01", 0 }, // STRING { 7, "BCBB80", "2b0f01", 0 }, // CHARACTER { 8, "cfba28", "2b0f01", 0 }, // CLASS NAME { 9, "0088CE", "2b0f01", 0 }, // DEF NAME { 10, "D6C479", "2b0f01", 0 }, // OPERATOR { 11, "cfba28", "2b0f01", 0 }, // IDENTIFIER { 12, "0088CE", "2b0f01", 0 }, // REGEX { 13, "cfba28", "2b0f01", 0 }, // GLOBAL { 14, "B7975D", "2b0f01", 0 }, // SYMBOL { 15, "d92b10", "2b0f01", 0 }, // MODULE NAME { 16, "cfba28", "2b0f01", 0 }, // INSTANCE VAR { 17, "B7975D", "2b0f01", 0 }, // CLASS VAR { 18, "98AE66", "602F1A", 0 }, // BACKTICKS { 19, "BCBB80", "2b0f01", 0 }, // DATA SECTION { 24, "BCBB80", "2b0f01", 0 }, // STRING Q { 25, "0088CE", "2b0f01", 0 }, // BOOLEAN }; static const lexstyle global_Black_board[] = { { 32, "F8F8F8", "0C1021", 0 }, // Default Style { 37, "888A85", "0C1021", 0 }, // Indent guideline style { 34, "FCE94F", "0C1021", 1 }, // Brace highlight style { 35, "EF2929", "0C1021", 0 }, // Bad brace colour { 2069, "FFFFFF", "112435", 0 }, // Caret colour { 31, "CC0000", "EDD400", 0 }, // Find Mark Style { 33, "EEEEEC", "2E3436", 0 }, // Line number margin { 29, "555753", "00FF00", 0 }, // Smart HighLighting { 31, "FCAF3E", "FF0000", 0 }, // Find Mark Style { 25, "F8F8F8", "00FFFF", 0 }, // Mark Style 1 { 24, "F8F8F8", "FF8000", 0 }, // Mark Style 2 { 23, "F8F8F8", "FFFF00", 0 }, // Mark Style 3 { 22, "F8F8F8", "8000FF", 0 }, // Mark Style 4 { 21, "F8F8F8", "008000", 0 }, // Mark Style 5 { 28, "FFCAB0", "0080FF", 0 }, // Incremental highlight all { 27, "000000", "8000FF", 0 }, // Tags match highlighting { 26, "8080C0", "FFFF00", 0 }, // Tags attribute }; static const lexstyle cpp_Black_board[] = { { 9, "FBDE2D", "0C1021", 0 }, // PREPROCESSOR { 11, "F8F8F8", "0C1021", 0 }, // DEFAULT { 5, "FBDE2D", "0C1021", 0 }, // INSTRUCTION WORD { 16, "FBDE2D", "0C1021", 0 }, // TYPE WORD { 4, "D8FA3C", "0C1021", 0 }, // NUMBER { 6, "61CE3C", "0C1021", 0 }, // STRING { 7, "61CE3C", "0C1021", 0 }, // CHARACTER { 10, "FBDE2D", "0C1021", 0 }, // OPERATOR { 13, "D8FA3C", "0C1021", 0 }, // VERBATIM { 14, "61CE3C", "0C1021", 0 }, // REGEX { 1, "AEAEAE", "0C1021", 0 }, // COMMENT { 2, "AEAEAE", "0C1021", 0 }, // COMMENT LINE { 3, "AEAEAE", "0C1021", 0 }, // COMMENT DOC { 15, "AEAEAE", "0C1021", 0 }, // COMMENT LINE DOC { 17, "AEAEAE", "0C1021", 0 }, // COMMENT DOC KEYWORD { 18, "AEAEAE", "0C1021", 0 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle java_Black_board[] = { { 9, "FBDE2D", "0C1021", 0 }, // PREPROCESSOR { 11, "F8F8F8", "0C1021", 0 }, // DEFAULT { 5, "FBDE2D", "0C1021", 0 }, // INSTRUCTION WORD { 16, "FBDE2D", "0C1021", 0 }, // TYPE WORD { 4, "D8FA3C", "0C1021", 0 }, // NUMBER { 6, "61CE3C", "0C1021", 0 }, // STRING { 7, "61CE3C", "0C1021", 0 }, // CHARACTER { 10, "FBDE2D", "0C1021", 0 }, // OPERATOR { 13, "D8FA3C", "0C1021", 0 }, // VERBATIM { 14, "61CE3C", "0C1021", 0 }, // REGEX { 1, "AEAEAE", "0C1021", 0 }, // COMMENT { 2, "AEAEAE", "0C1021", 0 }, // COMMENT LINE { 3, "AEAEAE", "0C1021", 0 }, // COMMENT DOC { 15, "AEAEAE", "0C1021", 0 }, // COMMENT LINE DOC { 17, "AEAEAE", "0C1021", 0 }, // COMMENT DOC KEYWORD { 18, "AEAEAE", "0C1021", 0 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle javascript_Black_board[] = { { 41, "F8F8F8", "0C1021", 0 }, // DEFAULT { 45, "D8FA3C", "0C1021", 0 }, // NUMBER { 46, "F8F8F8", "0C1021", 0 }, // WORD { 47, "FBDE2D", "0C1021", 0 }, // KEYWORD { 48, "61CE3C", "0C1021", 0 }, // DOUBLESTRING { 49, "61CE3C", "0C1021", 0 }, // SINGLESTRING { 50, "F8F8F8", "0C1021", 0 }, // SYMBOLS { 51, "61CE3C", "0C1021", 0 }, // STRINGEOL { 52, "61CE3C", "0C1021", 0 }, // REGEX { 42, "AEAEAE", "0C1021", 0 }, // COMMENT { 43, "AEAEAE", "0C1021", 0 }, // COMMENTLINE { 44, "AEAEAE", "0C1021", 0 }, // COMMENTDOC }; static const lexstyle python_Black_board[] = { { 0, "F8F8F8", "0C1021", 0 }, // DEFAULT { 1, "AEAEAE", "0C1021", 0 }, // COMMENTLINE { 2, "D8FA3C", "0C1021", 0 }, // NUMBER { 3, "61CE3C", "0C1021", 0 }, // STRING { 4, "61CE3C", "0C1021", 0 }, // CHARACTER { 5, "FBDE2D", "0C1021", 0 }, // KEYWORDS { 6, "000000", "0C1021", 0 }, // TRIPLE { 7, "000000", "0C1021", 0 }, // TRIPLEDOUBLE { 8, "000000", "0C1021", 0 }, // CLASSNAME { 9, "000000", "0C1021", 0 }, // DEFNAME { 10, "FBDE2D", "0C1021", 0 }, // OPERATOR { 11, "8DA6CE", "0C1021", 0 }, // IDENTIFIER { 12, "AEAEAE", "0C1021", 0 }, // COMMENTBLOCK { 12, "61CE3C", "0C1021", 0 }, // STRINGEOL }; static const lexstyle ruby_Black_board[] = { { 0, "F8F8F8", "0C1021", 0 }, // DEFAULT { 1, "000000", "0C1021", 0 }, // ERROR { 2, "AEAEAE", "0C1021", 0 }, // COMMENTLINE { 3, "000000", "0C1021", 0 }, // POD { 4, "D8FA3C", "0C1021", 0 }, // NUMBER { 5, "FBDE2D", "0C1021", 0 }, // INSTRUCTION { 6, "61CE3C", "0C1021", 0 }, // STRING { 7, "61CE3C", "0C1021", 0 }, // CHARACTER { 8, "FF6400", "0C1021", 0 }, // CLASS NAME { 9, "FF6400", "0C1021", 0 }, // DEF NAME { 10, "FBDE2D", "0C1021", 0 }, // OPERATOR { 11, "8DA6CE", "0C1021", 0 }, // IDENTIFIER { 12, "61CE3C", "0C1021", 0 }, // REGEX { 13, "F8F8F8", "0C1021", 0 }, // GLOBAL { 14, "F8F8F8", "0C1021", 0 }, // SYMBOL { 15, "000000", "0C1021", 0 }, // MODULE NAME { 16, "F8F8F8", "0C1021", 0 }, // INSTANCE VAR { 17, "000000", "0C1021", 0 }, // CLASS VAR { 18, "000000", "0C1021", 0 }, // BACKTICKS { 19, "000000", "0C1021", 0 }, // DATA SECTION { 24, "61CE3C", "0C1021", 0 }, // STRING Q }; static const lexstyle global_MossyLawn[] = { { 32, "f2c476", "6c7d51", 0 }, // Default Style { 37, "003709", "6c7d51", 0 }, // Indent guideline style { 34, "561e0f", "9ece3c", 1 }, // Brace highlight style { 35, "981f0e", "6c7d51", 0 }, // Bad brace colour { 2069, "ffc973", "6c7d51", 0 }, // Caret colour { 33, "603d13", "7e8a28", 0 }, // Line number margin { 29, "f2c476", "bf8830", 0 }, // Smart HighLighting { 31, "f2c476", "6a1a01", 0 }, // Find Mark Style { 25, "f2c476", "fdd64a", 0 }, // Mark Style 1 { 24, "f2c476", "afcf90", 0 }, // Mark Style 2 { 23, "f2c476", "ffdc87", 0 }, // Mark Style 3 { 22, "f2c476", "cbe248", 0 }, // Mark Style 4 { 21, "f2c476", "8abbe4", 0 }, // Mark Style 5 { 28, "f2c476", "6a1a01", 0 }, // Incremental highlight all { 27, "f2c476", "92983e", 0 }, // Tags match highlighting { 26, "f2c476", "dab57e", 0 }, // Tags attribute }; static const lexstyle cpp_MossyLawn[] = { { 9, "a32129", "6c7d51", 0 }, // PREPROCESSOR { 11, "f2c476", "6c7d51", 0 }, // DEFAULT { 5, "cbe248", "6c7d51", 0 }, // INSTRUCTION WORD { 16, "efc53d", "6c7d51", 0 }, // TYPE WORD { 4, "ffdc87", "6c7d51", 0 }, // NUMBER { 6, "ffdc87", "6c7d51", 0 }, // STRING { 7, "ffdc87", "6c7d51", 0 }, // CHARACTER { 10, "ffee88", "6c7d51", 1 }, // OPERATOR { 13, "ffdc87", "6c7d51", 0 }, // VERBATIM { 14, "afcf90", "6c7d51", 0 }, // REGEX { 1, "2a390e", "6c7d51", 2 }, // COMMENT { 2, "2a390e", "6c7d51", 2 }, // COMMENT LINE { 3, "2a390e", "6c7d51", 2 }, // COMMENT DOC { 15, "2a390e", "6c7d51", 2 }, // COMMENT LINE DOC { 17, "2a390e", "6c7d51", 3 }, // COMMENT DOC KEYWORD { 18, "981f0e", "fdd64a", 3 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle java_MossyLawn[] = { { 9, "a32129", "6c7d51", 0 }, // PREPROCESSOR { 11, "f2c476", "6c7d51", 0 }, // DEFAULT { 5, "cbe248", "6c7d51", 0 }, // INSTRUCTION WORD { 16, "efc53d", "6c7d51", 0 }, // TYPE WORD { 4, "ffdc87", "6c7d51", 0 }, // NUMBER { 6, "ffdc87", "6c7d51", 0 }, // STRING { 7, "ffdc87", "6c7d51", 0 }, // CHARACTER { 10, "ffee88", "6c7d51", 1 }, // OPERATOR { 13, "ffdc87", "6c7d51", 0 }, // VERBATIM { 14, "afcf90", "6c7d51", 0 }, // REGEX { 1, "2a390e", "6c7d51", 2 }, // COMMENT { 2, "2a390e", "6c7d51", 2 }, // COMMENT LINE { 3, "2a390e", "6c7d51", 2 }, // COMMENT DOC { 15, "2a390e", "6c7d51", 2 }, // COMMENT LINE DOC { 17, "afcf90", "6c7d51", 3 }, // COMMENT DOC KEYWORD { 18, "981f0e", "fdd64a", 3 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle javascript_MossyLawn[] = { { 41, "f2c476", "6c7d51", 0 }, // DEFAULT { 45, "ffdc87", "6c7d51", 0 }, // NUMBER { 46, "efc53d", "6c7d51", 0 }, // WORD { 47, "cbe248", "6c7d51", 0 }, // KEYWORD { 48, "ffdc87", "6c7d51", 0 }, // DOUBLESTRING { 49, "ffdc87", "6c7d51", 0 }, // SINGLESTRING { 50, "f2c476", "6c7d51", 0 }, // SYMBOLS { 51, "a32129", "6c7d51", 0 }, // STRINGEOL { 52, "afcf90", "6c7d51", 0 }, // REGEX { 42, "2a390e", "6c7d51", 2 }, // COMMENT { 43, "2a390e", "6c7d51", 2 }, // COMMENTLINE { 44, "2a390e", "6c7d51", 2 }, // COMMENTDOC { 17, "afcf90", "6c7d51", 3 }, // COMMENT DOC KEYWORD { 18, "981f0e", "fdd64a", 3 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle python_MossyLawn[] = { { 0, "f2c476", "6c7d51", 0 }, // DEFAULT { 1, "2a390e", "6c7d51", 2 }, // COMMENTLINE { 2, "ffdc87", "6c7d51", 0 }, // NUMBER { 3, "ffdc87", "6c7d51", 0 }, // STRING { 4, "ffdc87", "6c7d51", 0 }, // CHARACTER { 5, "cbe248", "6c7d51", 0 }, // KEYWORDS { 6, "ffdc87", "6c7d51", 0 }, // TRIPLE { 7, "ffdc87", "6c7d51", 0 }, // TRIPLEDOUBLE { 8, "a32129", "6c7d51", 0 }, // CLASSNAME { 9, "a32129", "6c7d51", 0 }, // DEFNAME { 10, "ffee88", "6c7d51", 1 }, // OPERATOR { 11, "efc53d", "6c7d51", 0 }, // IDENTIFIER { 12, "2a390e", "6c7d51", 2 }, // COMMENTBLOCK { 12, "2a390e", "6c7d51", 0 }, // STRINGEOL }; static const lexstyle ruby_MossyLawn[] = { { 0, "f2c476", "6c7d51", 0 }, // DEFAULT { 1, "a32129", "6c7d51", 0 }, // ERROR { 2, "2a390e", "6c7d51", 2 }, // COMMENTLINE { 3, "f2c476", "6c7d51", 2 }, // POD { 4, "ffdc87", "6c7d51", 0 }, // NUMBER { 5, "cbe248", "6c7d51", 0 }, // INSTRUCTION { 6, "ffdc87", "6c7d51", 0 }, // STRING { 7, "ffdc87", "6c7d51", 0 }, // CHARACTER { 8, "efc53d", "6c7d51", 0 }, // CLASS NAME { 9, "afcf90", "6c7d51", 0 }, // DEF NAME { 10, "ffee88", "6c7d51", 1 }, // OPERATOR { 11, "efc53d", "6c7d51", 0 }, // IDENTIFIER { 12, "afcf90", "6c7d51", 0 }, // REGEX { 13, "efc53d", "6c7d51", 0 }, // GLOBAL { 14, "f2c476", "6c7d51", 0 }, // SYMBOL { 15, "a32129", "6c7d51", 0 }, // MODULE NAME { 16, "efc53d", "6c7d51", 0 }, // INSTANCE VAR { 17, "f2c476", "6c7d51", 0 }, // CLASS VAR { 18, "bfb8c4", "7e8a28", 0 }, // BACKTICKS { 19, "ffdc87", "6c7d51", 0 }, // DATA SECTION { 24, "ffdc87", "6c7d51", 0 }, // STRING Q { 25, "afcf90", "6c7d51", 0 }, // BOOLEAN }; static const lexstyle global_Obsidian[] = { { 32, "E0E2E4", "293134", 0 }, // Default Style { 37, "394448", "293134", 0 }, // Indent guideline style { 34, "F3DB2E", "293134", 1 }, // Brace highlight style { 35, "FB0000", "293134", 0 }, // Bad brace colour { 2069, "C1CBD2", "6699CC", 0 }, // Caret colour { 33, "81969A", "3F4B4E", 0 }, // Line number margin { 29, "222222", "56676D", 0 }, // Smart HighLighting { 31, "E0E2E4", "6B8189", 1 }, // Find Mark Style { 25, "E0E2E4", "00659B", 0 }, // Mark Style 1 { 24, "E0E2E4", "00880B", 0 }, // Mark Style 2 { 23, "E0E2E4", "A6AA00", 0 }, // Mark Style 3 { 22, "E0E2E4", "8A0B0B", 0 }, // Mark Style 4 { 21, "E0E2E4", "44116F", 0 }, // Mark Style 5 { 28, "FFFF80", "0080FF", 0 }, // Incremental highlight all { 27, "E0E2E4", "4D5C62", 0 }, // Tags match highlighting { 26, "FFCAB0", "93975E", 0 }, // Tags attribute }; static const lexstyle cpp_Obsidian[] = { { 9, "A082BD", "293134", 0 }, // PREPROCESSOR { 11, "E0E2E4", "293134", 0 }, // DEFAULT { 5, "93C763", "293134", 1 }, // INSTRUCTION WORD { 16, "678CB1", "293134", 0 }, // TYPE WORD { 4, "FFCD22", "293134", 0 }, // NUMBER { 6, "EC7600", "293134", 0 }, // STRING { 7, "FF8409", "293134", 0 }, // CHARACTER { 10, "E8E2B7", "293134", 0 }, // OPERATOR { 13, "E0E2E4", "293134", 0 }, // VERBATIM { 14, "D39745", "293134", 0 }, // REGEX { 1, "66747B", "293134", 0 }, // COMMENT { 2, "66747B", "293134", 0 }, // COMMENT LINE { 3, "6C788C", "293134", 0 }, // COMMENT DOC { 15, "6C788C", "293134", 0 }, // COMMENT LINE DOC { 17, "6C788C", "293134", 1 }, // COMMENT DOC KEYWORD { 18, "6C788C", "293134", 1 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle java_Obsidian[] = { { 9, "A082BD", "293134", 0 }, // PREPROCESSOR { 11, "E0E2E4", "293134", 0 }, // DEFAULT { 5, "93C763", "293134", 1 }, // INSTRUCTION WORD { 16, "678CB1", "293134", 0 }, // TYPE WORD { 4, "FFCD22", "293134", 0 }, // NUMBER { 6, "EC7600", "293134", 0 }, // STRING { 7, "FF8409", "293134", 0 }, // CHARACTER { 10, "E8E2B7", "293134", 0 }, // OPERATOR { 13, "E0E2E4", "293134", 0 }, // VERBATIM { 14, "D39745", "293134", 0 }, // REGEX { 1, "66747B", "293134", 0 }, // COMMENT { 2, "66747B", "293134", 0 }, // COMMENT LINE { 3, "6C788C", "293134", 0 }, // COMMENT DOC { 15, "6C788C", "293134", 0 }, // COMMENT LINE DOC { 17, "6C788C", "293134", 1 }, // COMMENT DOC KEYWORD { 18, "6C788C", "293134", 1 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle javascript_Obsidian[] = { { 41, "E0E2E4", "293134", 0 }, // DEFAULT { 45, "FFCD22", "293134", 0 }, // NUMBER { 46, "E0E2E4", "293134", 0 }, // WORD { 47, "93C763", "293134", 1 }, // KEYWORD { 48, "EC7600", "293134", 0 }, // DOUBLESTRING { 49, "EC7600", "293134", 0 }, // SINGLESTRING { 50, "E8E2B7", "293134", 0 }, // SYMBOLS { 51, "E0E2E4", "293134", 0 }, // STRINGEOL { 52, "D39745", "293134", 0 }, // REGEX { 42, "818E96", "293134", 0 }, // COMMENT { 43, "818E96", "293134", 0 }, // COMMENTLINE { 44, "6C788C", "293134", 0 }, // COMMENTDOC }; static const lexstyle python_Obsidian[] = { { 0, "E0E2E4", "293134", 0 }, // DEFAULT { 1, "66747B", "293134", 0 }, // COMMENTLINE { 2, "FFCD22", "293134", 0 }, // NUMBER { 3, "EC7600", "293134", 0 }, // STRING { 4, "FF8409", "293134", 0 }, // CHARACTER { 5, "93C763", "293134", 1 }, // KEYWORDS { 6, "66747B", "293134", 0 }, // TRIPLE { 7, "66747B", "293134", 0 }, // TRIPLEDOUBLE { 8, "A082BD", "293134", 1 }, // CLASSNAME { 9, "678CB1", "293134", 1 }, // DEFNAME { 10, "E8E2B7", "293134", 0 }, // OPERATOR { 11, "E0E2E4", "293134", 0 }, // IDENTIFIER { 12, "66747B", "293134", 0 }, // COMMENTBLOCK { 12, "E0E2E4", "293134", 0 }, // STRINGEOL }; static const lexstyle ruby_Obsidian[] = { { 0, "E0E2E4", "293134", 0 }, // DEFAULT { 1, "E0E2E4", "293134", 0 }, // ERROR { 2, "66747B", "293134", 0 }, // COMMENTLINE { 3, "E0E2E4", "293134", 0 }, // POD { 4, "FFCD22", "293134", 0 }, // NUMBER { 5, "93C763", "293134", 1 }, // INSTRUCTION { 6, "EC7600", "293134", 0 }, // STRING { 7, "FF8409", "293134", 0 }, // CHARACTER { 8, "A082BD", "293134", 1 }, // CLASS NAME { 9, "678CB1", "293134", 1 }, // DEF NAME { 10, "E8E2B7", "293134", 0 }, // OPERATOR { 11, "E0E2E4", "293134", 0 }, // IDENTIFIER { 12, "D39745", "293134", 0 }, // REGEX { 13, "E0E2E4", "293134", 0 }, // GLOBAL { 14, "E0E2E4", "293134", 0 }, // SYMBOL { 15, "E0E2E4", "293134", 0 }, // MODULE NAME { 16, "B6C8DA", "293134", 0 }, // INSTANCE VAR { 17, "E0E2E4", "293134", 0 }, // CLASS VAR { 18, "E0E2E4", "293134", 0 }, // BACKTICKS { 19, "E0E2E4", "293134", 0 }, // DATA SECTION { 24, "E0E2E4", "293134", 0 }, // STRING Q }; static const lexstyle global_Eclipse_Default[] = { { 32, "000000", "FFFFFF", 0 }, // Default Style { 37, "C0C0C0", "FFFFFF", 0 }, // Indent guideline style { 34, "FF0000", "FFFFFF", 1 }, // Brace highlight style { 35, "800000", "FFFFFF", 1 }, // Bad brace colour { 2069, "000000", "FFFFFF", 0 }, // Caret colour { 33, "808080", "E4E4E4", 0 }, // Line number margin { 29, "000000", "A3A3A3", 0 }, // Smart HighLighting { 31, "000000", "FF0000", 0 }, // Find Mark Style { 28, "000000", "FFFF00", 0 }, // Incremental highlight all { 27, "000000", "FFFF00", 0 }, // Tags match highlighting { 26, "000000", "FFFFFF", 0 }, // Tags attribute }; static const lexstyle cpp_Eclipse_Default[] = { { 9, "7F7F9F", "FFFFFF", 1 }, // PREPROCESSOR { 11, "000000", "FFFFFF", 0 }, // DEFAULT { 5, "7F0055", "FFFFFF", 1 }, // INSTRUCTION WORD { 16, "7F0055", "FFFFFF", 1 }, // TYPE WORD { 4, "000000", "FFFFFF", 0 }, // NUMBER { 6, "2A00FF", "FFFFFF", 0 }, // STRING { 7, "2A00FF", "FFFFFF", 0 }, // CHARACTER { 10, "000000", "FFFFFF", 0 }, // OPERATOR { 13, "646464", "FFFFFF", 0 }, // VERBATIM { 14, "646464", "FFFFFF", 0 }, // REGEX { 1, "3F7F5F", "FFFFFF", 0 }, // COMMENT { 2, "3F7F5F", "FFFFFF", 0 }, // COMMENT LINE { 3, "3F5FBF", "FFFFFF", 0 }, // COMMENT DOC { 15, "3F5FBF", "FFFFFF", 0 }, // COMMENT LINE DOC { 17, "7F9FBF", "FFFFFF", 1 }, // COMMENT DOC KEYWORD { 18, "7F9FBF", "FFFFFF", 1 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle java_Eclipse_Default[] = { { 9, "7F7F9F", "FFFFFF", 1 }, // PREPROCESSOR { 11, "000000", "FFFFFF", 0 }, // DEFAULT { 5, "7F0055", "FFFFFF", 1 }, // INSTRUCTION WORD { 16, "7F0055", "FFFFFF", 1 }, // TYPE WORD { 4, "000000", "FFFFFF", 0 }, // NUMBER { 6, "2A00FF", "FFFFFF", 0 }, // STRING { 7, "2A00FF", "FFFFFF", 0 }, // CHARACTER { 10, "000000", "FFFFFF", 0 }, // OPERATOR { 13, "646464", "FFFFFF", 0 }, // VERBATIM { 14, "646464", "FFFFFF", 0 }, // REGEX { 1, "3F7F5F", "FFFFFF", 0 }, // COMMENT { 2, "3F7F5F", "FFFFFF", 0 }, // COMMENT LINE { 3, "3F5FBF", "FFFFFF", 0 }, // COMMENT DOC { 15, "3F5FBF", "FFFFFF", 0 }, // COMMENT LINE DOC { 17, "7F9FBF", "FFFFFF", 1 }, // COMMENT DOC KEYWORD { 18, "7F9FBF", "FFFFFF", 1 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle javascript_Eclipse_Default[] = { { 41, "000000", "FFFFFF", 0 }, // DEFAULT { 45, "000000", "FFFFFF", 0 }, // NUMBER { 46, "000000", "FFFFFF", 0 }, // WORD { 47, "7F0055", "FFFFFF", 1 }, // KEYWORD { 48, "2A00FF", "FFFFFF", 0 }, // DOUBLESTRING { 49, "2A00FF", "FFFFFF", 0 }, // SINGLESTRING { 50, "000000", "FFFFFF", 0 }, // SYMBOLS { 51, "2A00FF", "FFFFFF", 0 }, // STRINGEOL { 52, "646464", "FFFFFF", 0 }, // REGEX { 42, "3F7F5F", "FFFFFF", 0 }, // COMMENT { 43, "3F7F5F", "FFFFFF", 0 }, // COMMENTLINE { 44, "3F5FBF", "FFFFFF", 0 }, // COMMENTDOC }; static const lexstyle python_Eclipse_Default[] = { { 0, "000000", "FFFFFF", 0 }, // DEFAULT { 1, "3F7F5F", "FFFFFF", 0 }, // COMMENTLINE { 2, "000000", "FFFFFF", 0 }, // NUMBER { 3, "2A00FF", "FFFFFF", 0 }, // STRING { 4, "2A00FF", "FFFFFF", 0 }, // CHARACTER { 5, "7F0055", "FFFFFF", 1 }, // KEYWORDS { 6, "646464", "FFFFFF", 0 }, // TRIPLE { 7, "000000", "FFFFFF", 0 }, // TRIPLEDOUBLE { 8, "000000", "FFFFFF", 0 }, // CLASSNAME { 9, "3F5FBF", "FFFFFF", 1 }, // DEFNAME { 10, "000000", "FFFFFF", 0 }, // OPERATOR { 11, "000000", "FFFFFF", 0 }, // IDENTIFIER { 12, "3F7F5F", "FFFFFF", 0 }, // COMMENTBLOCK { 12, "2A00FF", "FFFFFF", 0 }, // STRINGEOL }; static const lexstyle ruby_Eclipse_Default[] = { { 0, "000000", "FFFFFF", 0 }, // DEFAULT { 1, "FF0000", "FFFFFF", 0 }, // ERROR { 2, "3F7F5F", "FFFFFF", 0 }, // COMMENTLINE { 3, "000000", "FFFFFF", 0 }, // POD { 4, "000000", "FFFFFF", 0 }, // NUMBER { 5, "7F0055", "FFFFFF", 1 }, // INSTRUCTION { 6, "2A00FF", "FFFFFF", 0 }, // STRING { 7, "2A00FF", "FFFFFF", 0 }, // CHARACTER { 8, "000000", "FFFFFF", 0 }, // CLASS NAME { 9, "3F5FBF", "FFFFFF", 1 }, // DEF NAME { 10, "000000", "FFFFFF", 0 }, // OPERATOR { 11, "000000", "FFFFFF", 0 }, // IDENTIFIER { 12, "646464", "FFFFFF", 0 }, // REGEX { 13, "0000C0", "FFFFFF", 0 }, // GLOBAL { 14, "000000", "FFFFFF", 0 }, // SYMBOL { 15, "7F7F9F", "FFFFFF", 1 }, // MODULE NAME { 16, "000000", "FFFFFF", 0 }, // INSTANCE VAR { 17, "000000", "FFFFFF", 0 }, // CLASS VAR { 18, "000000", "FFFFFF", 0 }, // BACKTICKS { 19, "646464", "FFFFFF", 0 }, // DATA SECTION { 24, "2A00FF", "FFFFFF", 0 }, // STRING Q }; static const lexstyle global_Navajo[] = { { 32, "000000", "BA9C80", 0 }, // Default Style { 37, "181880", "BA9C80", 0 }, // Indent guideline style { 34, "000000", "00FFFF", 1 }, // Brace highlight style { 35, "BCBCBC", "5F0000", 0 }, // Bad brace colour { 2069, "FFFFFF", "BA9C80", 0 }, // Caret colour { 33, "000000", "808080", 0 }, // Line number margin { 29, "000000", "BCBCBC", 0 }, // Smart HighLighting { 31, "000000", "3b4092", 0 }, // Find Mark Style { 25, "000000", "870087", 0 }, // Mark Style 1 { 24, "000000", "C00058", 0 }, // Mark Style 2 { 23, "000000", "181880", 0 }, // Mark Style 3 { 22, "000000", "804040", 0 }, // Mark Style 4 { 21, "000000", "106060", 0 }, // Mark Style 5 { 28, "000000", "BA9C80", 0 }, // Incremental highlight all { 27, "000000", "D92B10", 0 }, // Tags match highlighting { 26, "000000", "D92B10", 0 }, // Tags attribute }; static const lexstyle cpp_Navajo[] = { { 9, "870087", "BA9C80", 0 }, // PREPROCESSOR { 11, "000000", "BA9C80", 0 }, // DEFAULT { 5, "804040", "BA9C80", 0 }, // INSTRUCTION WORD { 16, "1E8B47", "BA9C80", 0 }, // TYPE WORD { 4, "C00058", "BA9C80", 0 }, // NUMBER { 6, "C00058", "BA9C80", 0 }, // STRING { 7, "C00058", "BA9C80", 0 }, // CHARACTER { 10, "010101", "BA9C80", 1 }, // OPERATOR { 13, "C00058", "BA9C80", 0 }, // VERBATIM { 14, "C00058", "BA9C80", 0 }, // REGEX { 1, "181880", "BA9C80", 2 }, // COMMENT { 2, "181880", "BA9C80", 2 }, // COMMENT LINE { 3, "181880", "BA9C80", 2 }, // COMMENT DOC { 15, "181880", "BA9C80", 2 }, // COMMENT LINE DOC { 17, "181880", "BA9C80", 3 }, // COMMENT DOC KEYWORD { 18, "BCBCBC", "5F0000", 3 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle java_Navajo[] = { { 9, "870087", "BA9C80", 0 }, // PREPROCESSOR { 11, "000000", "BA9C80", 0 }, // DEFAULT { 5, "804040", "BA9C80", 0 }, // INSTRUCTION WORD { 16, "1E8B47", "BA9C80", 0 }, // TYPE WORD { 4, "C00058", "BA9C80", 0 }, // NUMBER { 6, "C00058", "BA9C80", 0 }, // STRING { 7, "C00058", "BA9C80", 0 }, // CHARACTER { 10, "010101", "BA9C80", 1 }, // OPERATOR { 13, "C00058", "BA9C80", 0 }, // VERBATIM { 14, "C00058", "BA9C80", 0 }, // REGEX { 1, "181880", "BA9C80", 2 }, // COMMENT { 2, "181880", "BA9C80", 2 }, // COMMENT LINE { 3, "181880", "BA9C80", 2 }, // COMMENT DOC { 15, "181880", "BA9C80", 2 }, // COMMENT LINE DOC { 17, "C00058", "BA9C80", 3 }, // COMMENT DOC KEYWORD { 18, "BCBCBC", "5F0000", 3 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle javascript_Navajo[] = { { 41, "000000", "BA9C80", 0 }, // DEFAULT { 45, "C00058", "BA9C80", 0 }, // NUMBER { 46, "106060", "BA9C80", 0 }, // WORD { 47, "804040", "BA9C80", 0 }, // KEYWORD { 48, "C00058", "BA9C80", 0 }, // DOUBLESTRING { 49, "C00058", "BA9C80", 0 }, // SINGLESTRING { 50, "000000", "BA9C80", 0 }, // SYMBOLS { 51, "870087", "BA9C80", 0 }, // STRINGEOL { 52, "C00058", "BA9C80", 0 }, // REGEX { 42, "181880", "BA9C80", 2 }, // COMMENT { 43, "181880", "BA9C80", 2 }, // COMMENTLINE { 44, "181880", "BA9C80", 2 }, // COMMENTDOC { 17, "C00058", "BA9C80", 3 }, // COMMENT DOC KEYWORD { 18, "BCBCBC", "5F0000", 3 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle python_Navajo[] = { { 0, "000000", "BA9C80", 0 }, // DEFAULT { 1, "181880", "BA9C80", 2 }, // COMMENTLINE { 2, "C00058", "BA9C80", 0 }, // NUMBER { 3, "C00058", "BA9C80", 0 }, // STRING { 4, "C00058", "BA9C80", 0 }, // CHARACTER { 5, "804040", "BA9C80", 0 }, // KEYWORDS { 6, "C00058", "BA9C80", 0 }, // TRIPLE { 7, "C00058", "BA9C80", 0 }, // TRIPLEDOUBLE { 8, "D92B10", "BA9C80", 0 }, // CLASSNAME { 9, "D92B10", "BA9C80", 0 }, // DEFNAME { 10, "010101", "BA9C80", 1 }, // OPERATOR { 11, "106060", "BA9C80", 0 }, // IDENTIFIER { 12, "181880", "BA9C80", 2 }, // COMMENTBLOCK { 12, "181880", "BA9C80", 0 }, // STRINGEOL }; static const lexstyle ruby_Navajo[] = { { 0, "000000", "BA9C80", 0 }, // DEFAULT { 1, "870087", "BA9C80", 0 }, // ERROR { 2, "181880", "BA9C80", 2 }, // COMMENTLINE { 3, "000000", "BA9C80", 2 }, // POD { 4, "C00058", "BA9C80", 0 }, // NUMBER { 5, "804040", "BA9C80", 0 }, // INSTRUCTION { 6, "C00058", "BA9C80", 0 }, // STRING { 7, "C00058", "BA9C80", 0 }, // CHARACTER { 8, "106060", "BA9C80", 0 }, // CLASS NAME { 9, "C00058", "BA9C80", 0 }, // DEF NAME { 10, "010101", "BA9C80", 1 }, // OPERATOR { 11, "106060", "BA9C80", 0 }, // IDENTIFIER { 12, "C00058", "BA9C80", 0 }, // REGEX { 13, "106060", "BA9C80", 0 }, // GLOBAL { 14, "000000", "BA9C80", 0 }, // SYMBOL { 15, "D92B10", "BA9C80", 0 }, // MODULE NAME { 16, "106060", "BA9C80", 0 }, // INSTANCE VAR { 17, "000000", "BA9C80", 0 }, // CLASS VAR { 18, "C00058", "CDB38B", 0 }, // BACKTICKS { 19, "C00058", "BA9C80", 0 }, // DATA SECTION { 24, "C00058", "BA9C80", 0 }, // STRING Q { 25, "C00058", "BA9C80", 0 }, // BOOLEAN }; static const lexstyle global_NotepadPlusPlus[] = { { 32, "000000", "FFFFFF", 0 }, // Default Style { 37, "C0C0C0", "FFFFFF", 0 }, // Indent guideline style { 34, "FF0000", "FFFFFF", 1 }, // Brace highlight style { 35, "800000", "FFFFFF", 0 }, // Bad brace colour { 2069, "8000FF", "FFFFFF", 0 }, // Caret colour { 33, "808080", "E4E4E4", 0 }, // Line number margin { 29, "000000", "00FF00", 0 }, // Smart HighLighting { 31, "000000", "FF0000", 0 }, // Find Mark Style { 25, "000000", "00FFFF", 0 }, // Mark Style 1 { 24, "000000", "FF8000", 0 }, // Mark Style 2 { 23, "000000", "FFFF00", 0 }, // Mark Style 3 { 22, "000000", "8000FF", 0 }, // Mark Style 4 { 21, "000000", "008000", 0 }, // Mark Style 5 { 28, "000000", "0080FF", 0 }, // Incremental highlight all { 27, "000000", "8000FF", 0 }, // Tags match highlighting { 26, "000000", "FFFF00", 0 }, // Tags attribute }; static const lexstyle cpp_NotepadPlusPlus[] = { { 9, "804000", "FFFFFF", 0 }, // PREPROCESSOR { 11, "000000", "FFFFFF", 0 }, // DEFAULT { 5, "0000FF", "FFFFFF", 1 }, // INSTRUCTION WORD { 16, "8000FF", "FFFFFF", 0 }, // TYPE WORD { 4, "FF8000", "FFFFFF", 0 }, // NUMBER { 6, "808080", "FFFFFF", 0 }, // STRING { 7, "808080", "FFFFFF", 0 }, // CHARACTER { 10, "000080", "FFFFFF", 1 }, // OPERATOR { 13, "000000", "FFFFFF", 0 }, // VERBATIM { 14, "000000", "FFFFFF", 1 }, // REGEX { 1, "008000", "FFFFFF", 0 }, // COMMENT { 2, "008000", "FFFFFF", 0 }, // COMMENT LINE { 3, "008080", "FFFFFF", 0 }, // COMMENT DOC { 15, "008080", "FFFFFF", 0 }, // COMMENT LINE DOC { 17, "008080", "FFFFFF", 1 }, // COMMENT DOC KEYWORD { 18, "008080", "FFFFFF", 0 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle java_NotepadPlusPlus[] = { { 9, "804000", "FFFFFF", 0 }, // PREPROCESSOR { 11, "000000", "FFFFFF", 0 }, // DEFAULT { 5, "0000FF", "FFFFFF", 1 }, // INSTRUCTION WORD { 16, "8000FF", "FFFFFF", 0 }, // TYPE WORD { 4, "FF8000", "FFFFFF", 0 }, // NUMBER { 6, "808080", "FFFFFF", 0 }, // STRING { 7, "808080", "FFFFFF", 0 }, // CHARACTER { 10, "000080", "FFFFFF", 1 }, // OPERATOR { 13, "000000", "FFFFFF", 0 }, // VERBATIM { 14, "000000", "FFFFFF", 1 }, // REGEX { 1, "008000", "FFFFFF", 0 }, // COMMENT { 2, "008000", "FFFFFF", 0 }, // COMMENT LINE { 3, "008080", "FFFFFF", 0 }, // COMMENT DOC { 15, "008080", "FFFFFF", 0 }, // COMMENT LINE DOC { 17, "008080", "FFFFFF", 1 }, // COMMENT DOC KEYWORD { 18, "008080", "FFFFFF", 0 }, // COMMENT DOC KEYWORD ERROR }; static const lexstyle javascript_NotepadPlusPlus[] = { { 41, "000000", "F2F4FF", 0 }, // DEFAULT { 45, "FF0000", "F2F4FF", 0 }, // NUMBER { 46, "000000", "F2F4FF", 0 }, // WORD { 47, "000080", "F2F4FF", 3 }, // KEYWORD { 48, "808080", "F2F4FF", 0 }, // DOUBLESTRING { 49, "808080", "F2F4FF", 0 }, // SINGLESTRING { 50, "000000", "F2F4FF", 1 }, // SYMBOLS { 52, "8000FF", "F2F4FF", 0 }, // REGEX { 42, "008000", "F2F4FF", 0 }, // COMMENT { 43, "008000", "F2F4FF", 0 }, // COMMENTLINE { 44, "008080", "F2F4FF", 0 }, // COMMENTDOC }; static const lexstyle python_NotepadPlusPlus[] = { { 0, "000000", "FFFFFF", 0 }, // DEFAULT { 1, "008000", "FFFFFF", 0 }, // COMMENTLINE { 2, "FF0000", "FFFFFF", 0 }, // NUMBER { 3, "808080", "FFFFFF", 0 }, // STRING { 4, "808080", "FFFFFF", 0 }, // CHARACTER { 5, "0000FF", "FFFFFF", 1 }, // KEYWORDS { 6, "FF8000", "FFFFFF", 0 }, // TRIPLE { 7, "FF8000", "FFFFFF", 0 }, // TRIPLEDOUBLE { 8, "000000", "FFFFFF", 1 }, // CLASSNAME { 9, "FF00FF", "FFFFFF", 0 }, // DEFNAME { 10, "000080", "FFFFFF", 1 }, // OPERATOR { 11, "000000", "FFFFFF", 0 }, // IDENTIFIER { 12, "008000", "FFFFFF", 0 }, // COMMENTBLOCK }; static const lexstyle ruby_NotepadPlusPlus[] = { { 0, "000000", "FFFFFF", 0 }, // DEFAULT { 1, "000000", "FFFFFF", 0 }, // ERROR { 2, "008000", "FFFFFF", 0 }, // COMMENTLINE { 3, "004000", "C0FFC0", 0 }, // POD { 4, "FF8000", "FFFFFF", 0 }, // NUMBER { 5, "0000FF", "FFFFFF", 1 }, // INSTRUCTION { 6, "808080", "FFFFFF", 0 }, // STRING { 7, "808000", "FFFFFF", 0 }, // CHARACTER { 8, "0080C0", "FFFFFF", 1 }, // CLASS NAME { 9, "8080FF", "FFFFCC", 1 }, // DEF NAME { 10, "000080", "FFFFFF", 1 }, // OPERATOR { 11, "000000", "FFFFFF", 0 }, // IDENTIFIER { 12, "0080FF", "FFFFFF", 0 }, // REGEX { 13, "000080", "FFFFFF", 1 }, // GLOBAL { 14, "000000", "FFFFFF", 0 }, // SYMBOL { 15, "804000", "FFFFFF", 1 }, // MODULE NAME { 16, "000000", "FFFFFF", 0 }, // INSTANCE VAR { 17, "000000", "FFFFFF", 0 }, // CLASS VAR { 18, "FFFF00", "A08080", 0 }, // BACKTICKS { 19, "600000", "FFF0D8", 0 }, // DATA SECTION { 24, "808080", "FFFFFF", 0 }, // STRING Q }; static const langstyle cppstyle[] = { { "Monokai", "F8F8F2", "272822", "3E3D32", "EEEEEC", cpp_Monokai, global_Monokai, 16, 17 }, { "Vibrant Ink", "FFFFFF", "000000", "333333", "E4E4E4", cpp_Vibrant_Ink, global_Vibrant_Ink, 16, 17 }, { "Solarized light", "657B83", "FDF6E3", "EEE8D5", "93A1A1", cpp_Solarized_light, global_Solarized_light, 16, 16 }, { "Twilight", "F8F8F8", "141414", "292929", "EEEEEC", cpp_Twilight, global_Twilight, 16, 17 }, { "vim Dark Blue", "FFFFFF", "000040", "000040", "FFFFFF", cpp_vim_Dark_Blue, global_vim_Dark_Blue, 16, 11 }, { "Deep Black", "FFFFFF", "000000", "333333", "C0C0C0", cpp_Deep_Black, global_Deep_Black, 16, 11 }, { "Mono Industrial", "FFFFFF", "222C28", "2C3833", "EEEEEC", cpp_Mono_Industrial, global_Mono_Industrial, 16, 17 }, { "Ruby Blue", "FFFFFF", "112435", "273A4B", "FFFFFF", cpp_Ruby_Blue, global_Ruby_Blue, 16, 17 }, { "Choco", "C3BE98", "1A0F0B", "281711", "EEEEEC", cpp_Choco, global_Choco, 16, 17 }, { "khaki", "5f5f00", "d7d7af", "afaf87", "5f5f00", cpp_khaki, global_khaki, 16, 16 }, { "Bespin", "F8F8F8", "2A211C", "4B3C34", "E5C138", cpp_Bespin, global_Bespin, 16, 17 }, { "Zenburn", "DCDCCC", "3F3F3F", "101010", "8A8A8A", cpp_Zenburn, global_Zenburn, 16, 16 }, { "Plastic Code Wrap", "F8F8F8", "0B161D", "11222D", "EEEEEC", cpp_Plastic_Code_Wrap, global_Plastic_Code_Wrap, 16, 17 }, { "Solarized", "839496", "002B36", "073642", "586E75", cpp_Solarized, global_Solarized, 16, 16 }, { "Hello Kitty", "000000", "FFB0FF", "FF80C0", "FFFFFF", cpp_Hello_Kitty, global_Hello_Kitty, 16, 16 }, { "HotFudgeSundae", "B7975D", "2b0f01", "432c13", "8B642B", cpp_HotFudgeSundae, global_HotFudgeSundae, 16, 16 }, { "Black board", "F8F8F8", "0C1021", "121830", "EEEEEC", cpp_Black_board, global_Black_board, 16, 17 }, { "MossyLawn", "f2c476", "6c7d51", "858e4d", "603d13", cpp_MossyLawn, global_MossyLawn, 16, 16 }, { "Obsidian", "E0E2E4", "293134", "2F393C", "81969A", cpp_Obsidian, global_Obsidian, 16, 16 }, { "Eclipse Default", "000000", "FFFFFF", "E8F2FE", "808080", cpp_Eclipse_Default, global_Eclipse_Default, 16, 11 }, { "Navajo", "000000", "BA9C80", "B39674", "000000", cpp_Navajo, global_Navajo, 16, 16 }, { "NotepadPlusPlus", "000000", "FFFFFF", "E8E8FF", "808080", cpp_NotepadPlusPlus, global_NotepadPlusPlus, 16, 16 }, { NULL, NULL, NULL, 0 } }; static const langstyle javastyle[] = { { "Monokai", "F8F8F2", "272822", "3E3D32", "EEEEEC", java_Monokai, global_Monokai, 16, 17 }, { "Vibrant Ink", "FFFFFF", "000000", "333333", "E4E4E4", java_Vibrant_Ink, global_Vibrant_Ink, 16, 17 }, { "Solarized light", "657B83", "FDF6E3", "EEE8D5", "93A1A1", java_Solarized_light, global_Solarized_light, 16, 16 }, { "Twilight", "F8F8F8", "141414", "292929", "EEEEEC", java_Twilight, global_Twilight, 16, 17 }, { "vim Dark Blue", "FFFFFF", "000040", "000040", "FFFFFF", java_vim_Dark_Blue, global_vim_Dark_Blue, 16, 11 }, { "Deep Black", "FFFFFF", "000000", "333333", "C0C0C0", java_Deep_Black, global_Deep_Black, 16, 11 }, { "Mono Industrial", "FFFFFF", "222C28", "2C3833", "EEEEEC", java_Mono_Industrial, global_Mono_Industrial, 16, 17 }, { "Ruby Blue", "FFFFFF", "112435", "273A4B", "FFFFFF", java_Ruby_Blue, global_Ruby_Blue, 16, 17 }, { "Choco", "C3BE98", "1A0F0B", "281711", "EEEEEC", java_Choco, global_Choco, 16, 17 }, { "khaki", "5f5f00", "d7d7af", "afaf87", "5f5f00", java_khaki, global_khaki, 16, 16 }, { "Bespin", "F8F8F8", "2A211C", "4B3C34", "E5C138", java_Bespin, global_Bespin, 16, 17 }, { "Zenburn", "DCDCCC", "3F3F3F", "101010", "8A8A8A", java_Zenburn, global_Zenburn, 16, 16 }, { "Plastic Code Wrap", "F8F8F8", "0B161D", "11222D", "EEEEEC", java_Plastic_Code_Wrap, global_Plastic_Code_Wrap, 16, 17 }, { "Solarized", "839496", "002B36", "073642", "586E75", java_Solarized, global_Solarized, 16, 16 }, { "Hello Kitty", "000000", "FFB0FF", "FF80C0", "FFFFFF", java_Hello_Kitty, global_Hello_Kitty, 16, 16 }, { "HotFudgeSundae", "B7975D", "2b0f01", "432c13", "8B642B", java_HotFudgeSundae, global_HotFudgeSundae, 16, 16 }, { "Black board", "F8F8F8", "0C1021", "121830", "EEEEEC", java_Black_board, global_Black_board, 16, 17 }, { "MossyLawn", "f2c476", "6c7d51", "858e4d", "603d13", java_MossyLawn, global_MossyLawn, 16, 16 }, { "Obsidian", "E0E2E4", "293134", "2F393C", "81969A", java_Obsidian, global_Obsidian, 16, 16 }, { "Eclipse Default", "000000", "FFFFFF", "E8F2FE", "808080", java_Eclipse_Default, global_Eclipse_Default, 16, 11 }, { "Navajo", "000000", "BA9C80", "B39674", "000000", java_Navajo, global_Navajo, 16, 16 }, { "NotepadPlusPlus", "000000", "FFFFFF", "E8E8FF", "808080", java_NotepadPlusPlus, global_NotepadPlusPlus, 16, 16 }, { NULL, NULL, NULL, 0 } }; static const langstyle pythonstyle[] = { { "Monokai", "F8F8F2", "272822", "3E3D32", "EEEEEC", python_Monokai, global_Monokai, 14, 17 }, { "Vibrant Ink", "FFFFFF", "000000", "333333", "E4E4E4", python_Vibrant_Ink, global_Vibrant_Ink, 14, 17 }, { "Solarized light", "657B83", "FDF6E3", "EEE8D5", "93A1A1", python_Solarized_light, global_Solarized_light, 14, 16 }, { "Twilight", "F8F8F8", "141414", "292929", "EEEEEC", python_Twilight, global_Twilight, 14, 17 }, { "vim Dark Blue", "FFFFFF", "000040", "000040", "FFFFFF", python_vim_Dark_Blue, global_vim_Dark_Blue, 14, 11 }, { "Deep Black", "FFFFFF", "000000", "333333", "C0C0C0", python_Deep_Black, global_Deep_Black, 14, 11 }, { "Mono Industrial", "FFFFFF", "222C28", "2C3833", "EEEEEC", python_Mono_Industrial, global_Mono_Industrial, 14, 17 }, { "Ruby Blue", "FFFFFF", "112435", "273A4B", "FFFFFF", python_Ruby_Blue, global_Ruby_Blue, 14, 17 }, { "Choco", "C3BE98", "1A0F0B", "281711", "EEEEEC", python_Choco, global_Choco, 14, 17 }, { "khaki", "5f5f00", "d7d7af", "afaf87", "5f5f00", python_khaki, global_khaki, 14, 16 }, { "Bespin", "F8F8F8", "2A211C", "4B3C34", "E5C138", python_Bespin, global_Bespin, 14, 17 }, { "Zenburn", "DCDCCC", "3F3F3F", "101010", "8A8A8A", python_Zenburn, global_Zenburn, 13, 16 }, { "Plastic Code Wrap", "F8F8F8", "0B161D", "11222D", "EEEEEC", python_Plastic_Code_Wrap, global_Plastic_Code_Wrap, 14, 17 }, { "Solarized", "839496", "002B36", "073642", "586E75", python_Solarized, global_Solarized, 14, 16 }, { "Hello Kitty", "000000", "FFB0FF", "FF80C0", "FFFFFF", python_Hello_Kitty, global_Hello_Kitty, 14, 16 }, { "HotFudgeSundae", "B7975D", "2b0f01", "432c13", "8B642B", python_HotFudgeSundae, global_HotFudgeSundae, 14, 16 }, { "Black board", "F8F8F8", "0C1021", "121830", "EEEEEC", python_Black_board, global_Black_board, 14, 17 }, { "MossyLawn", "f2c476", "6c7d51", "858e4d", "603d13", python_MossyLawn, global_MossyLawn, 14, 16 }, { "Obsidian", "E0E2E4", "293134", "2F393C", "81969A", python_Obsidian, global_Obsidian, 14, 16 }, { "Eclipse Default", "000000", "FFFFFF", "E8F2FE", "808080", python_Eclipse_Default, global_Eclipse_Default, 14, 11 }, { "Navajo", "000000", "BA9C80", "B39674", "000000", python_Navajo, global_Navajo, 14, 16 }, { "NotepadPlusPlus", "000000", "FFFFFF", "E8E8FF", "808080", python_NotepadPlusPlus, global_NotepadPlusPlus, 13, 16 }, { NULL, NULL, NULL, 0 } }; static const langstyle rubystyle[] = { { "Monokai", "F8F8F2", "272822", "3E3D32", "EEEEEC", ruby_Monokai, global_Monokai, 21, 17 }, { "Vibrant Ink", "FFFFFF", "000000", "333333", "E4E4E4", ruby_Vibrant_Ink, global_Vibrant_Ink, 21, 17 }, { "Solarized light", "657B83", "FDF6E3", "EEE8D5", "93A1A1", ruby_Solarized_light, global_Solarized_light, 22, 16 }, { "Twilight", "F8F8F8", "141414", "292929", "EEEEEC", ruby_Twilight, global_Twilight, 21, 17 }, { "vim Dark Blue", "FFFFFF", "000040", "000040", "FFFFFF", ruby_vim_Dark_Blue, global_vim_Dark_Blue, 21, 11 }, { "Deep Black", "FFFFFF", "000000", "333333", "C0C0C0", ruby_Deep_Black, global_Deep_Black, 21, 11 }, { "Mono Industrial", "FFFFFF", "222C28", "2C3833", "EEEEEC", ruby_Mono_Industrial, global_Mono_Industrial, 21, 17 }, { "Ruby Blue", "FFFFFF", "112435", "273A4B", "FFFFFF", ruby_Ruby_Blue, global_Ruby_Blue, 21, 17 }, { "Choco", "C3BE98", "1A0F0B", "281711", "EEEEEC", ruby_Choco, global_Choco, 21, 17 }, { "khaki", "5f5f00", "d7d7af", "afaf87", "5f5f00", ruby_khaki, global_khaki, 22, 16 }, { "Bespin", "F8F8F8", "2A211C", "4B3C34", "E5C138", ruby_Bespin, global_Bespin, 21, 17 }, { "Zenburn", "DCDCCC", "3F3F3F", "101010", "8A8A8A", ruby_Zenburn, global_Zenburn, 21, 16 }, { "Plastic Code Wrap", "F8F8F8", "0B161D", "11222D", "EEEEEC", ruby_Plastic_Code_Wrap, global_Plastic_Code_Wrap, 21, 17 }, { "Solarized", "839496", "002B36", "073642", "586E75", ruby_Solarized, global_Solarized, 22, 16 }, { "Hello Kitty", "000000", "FFB0FF", "FF80C0", "FFFFFF", ruby_Hello_Kitty, global_Hello_Kitty, 21, 16 }, { "HotFudgeSundae", "B7975D", "2b0f01", "432c13", "8B642B", ruby_HotFudgeSundae, global_HotFudgeSundae, 22, 16 }, { "Black board", "F8F8F8", "0C1021", "121830", "EEEEEC", ruby_Black_board, global_Black_board, 21, 17 }, { "MossyLawn", "f2c476", "6c7d51", "858e4d", "603d13", ruby_MossyLawn, global_MossyLawn, 22, 16 }, { "Obsidian", "E0E2E4", "293134", "2F393C", "81969A", ruby_Obsidian, global_Obsidian, 21, 16 }, { "Eclipse Default", "000000", "FFFFFF", "E8F2FE", "808080", ruby_Eclipse_Default, global_Eclipse_Default, 21, 11 }, { "Navajo", "000000", "BA9C80", "B39674", "000000", ruby_Navajo, global_Navajo, 22, 16 }, { "NotepadPlusPlus", "000000", "FFFFFF", "E8E8FF", "808080", ruby_NotepadPlusPlus, global_NotepadPlusPlus, 21, 16 }, { NULL, NULL, NULL, 0 } }; static const langstyle javascriptstyle[] = { { "Monokai", "F8F8F2", "272822", "3E3D32", "EEEEEC", javascript_Monokai, global_Monokai, 12, 17 }, { "Vibrant Ink", "FFFFFF", "000000", "333333", "E4E4E4", javascript_Vibrant_Ink, global_Vibrant_Ink, 12, 17 }, { "Solarized light", "657B83", "FDF6E3", "EEE8D5", "93A1A1", javascript_Solarized_light, global_Solarized_light, 14, 16 }, { "Twilight", "F8F8F8", "141414", "292929", "EEEEEC", javascript_Twilight, global_Twilight, 12, 17 }, { "vim Dark Blue", "FFFFFF", "000040", "000040", "FFFFFF", javascript_vim_Dark_Blue, global_vim_Dark_Blue, 12, 11 }, { "Deep Black", "FFFFFF", "000000", "333333", "C0C0C0", javascript_Deep_Black, global_Deep_Black, 12, 11 }, { "Mono Industrial", "FFFFFF", "222C28", "2C3833", "EEEEEC", javascript_Mono_Industrial, global_Mono_Industrial, 12, 17 }, { "Ruby Blue", "FFFFFF", "112435", "273A4B", "FFFFFF", javascript_Ruby_Blue, global_Ruby_Blue, 12, 17 }, { "Choco", "C3BE98", "1A0F0B", "281711", "EEEEEC", javascript_Choco, global_Choco, 12, 17 }, { "khaki", "5f5f00", "d7d7af", "afaf87", "5f5f00", javascript_khaki, global_khaki, 14, 16 }, { "Bespin", "BDAF9D", "2A211C", "4B3C34", "E5C138", javascript_Bespin, global_Bespin, 15, 17 }, { "Zenburn", "DCDCCC", "3F3F3F", "101010", "8A8A8A", javascript_Zenburn, global_Zenburn, 11, 16 }, { "Plastic Code Wrap", "F8F8F8", "0B161D", "11222D", "EEEEEC", javascript_Plastic_Code_Wrap, global_Plastic_Code_Wrap, 12, 17 }, { "Solarized", "839496", "002B36", "073642", "586E75", javascript_Solarized, global_Solarized, 14, 16 }, { "Hello Kitty", "000000", "F2F4FF", "FF80C0", "FFFFFF", javascript_Hello_Kitty, global_Hello_Kitty, 12, 16 }, { "HotFudgeSundae", "B7975D", "2b0f01", "432c13", "8B642B", javascript_HotFudgeSundae, global_HotFudgeSundae, 14, 16 }, { "Black board", "F8F8F8", "0C1021", "121830", "EEEEEC", javascript_Black_board, global_Black_board, 12, 17 }, { "MossyLawn", "f2c476", "6c7d51", "858e4d", "603d13", javascript_MossyLawn, global_MossyLawn, 14, 16 }, { "Obsidian", "E0E2E4", "293134", "2F393C", "81969A", javascript_Obsidian, global_Obsidian, 12, 16 }, { "Eclipse Default", "000000", "FFFFFF", "E8F2FE", "808080", javascript_Eclipse_Default, global_Eclipse_Default, 12, 11 }, { "Navajo", "000000", "BA9C80", "B39674", "000000", javascript_Navajo, global_Navajo, 14, 16 }, { "NotepadPlusPlus", "000000", "F2F4FF", "E8E8FF", "808080", javascript_NotepadPlusPlus, global_NotepadPlusPlus, 11, 16 }, { NULL, NULL, NULL, 0 } }; codequery-0.18.1/gui/translations/000077500000000000000000000000001300045745200171065ustar00rootroot00000000000000codequery-0.18.1/gui/translations/codequery_de.ts000066400000000000000000000550151300045745200221340ustar00rootroot00000000000000 DialogGraph Graph Graph Please wait ... Bitte warten... Zoom Out Verkleinern Zoom In Vergrößern Number of levels: Anzahl der Ebenen: Save to DOT file DOT-Datei speichern Save Image Bild speichern Close Schließen MainWindow CodeQuery CodeQuery Open Database Datenbank öffnen Auto-complete Automatische Vervollständigung Exact match Genaue Ãœbereinstimmung File path filter Pfad Dateifilter Filter Filter File path filter, wildcard searches (* and ?) are supported Pfad Dateifilter, Platzhaltersuche (* und?) werden unterstützt Previous search term Vorherigen Suchbegriff Next search term Nächsten Suchbegriff If Exact Match is switched off, wildcard searches (* and ?) are supported Wenn genaue Ãœbereinstimmung Platzhaltersuche ausgeschaltet ist (* und?) werden unterstützt Search Suche Paste and Search Paste und Suche Draw graph Zeichnen von Graphen Previous File Vorherige Datei Next File Nächste Datei Open in Editor Im Editor geöffnet Go to selected line Gehen Sie zu ausgewählten Zeile Reduce font size Schrift verkleinern Increase font size Schriftgrad erhöhen Copy, paste and search Kopieren, einfügen und Suche Symbol search only for paste and search Symbolsuche nur nach einfügen und Suche Symbol only Symbol nur Previous search result in this file Vorherige Suchergebnis in dieser Datei Next search result in this file Nächste Suchergebnis in dieser Datei FilePath:0 FilePath:0 Sort by line number Sortieren nach Zeilennummer Sort by name Nach Namen sortieren File Datei Options Optionen Help Hilfe Exit Ausfahrt Open Offene About Ãœber External Editor Externer Editor Open CQ Database Offene CQ-Datenbank Language Sprache About Qt Ãœber Qt File Viewer Settings Datei-Viewer-Einstellungen aboutDialog About CodeQuery Ãœber CodeQuery OK Okay cqDialogGraph Images Bilder und Videos Export Image Bild exportieren File could not be saved! Datei konnte nicht gespeichert werden! Export DOT file DOT-Datei exportieren fileViewSettingsDialog File Viewer Settings Datei-Viewer-Einstellungen Font Schriftart Syntax highlight theme Syntax-Highlight-Thema Tab Width (number of spaces) Tab-Schrittweite (Anzahl der Räume) Cancel Abbrechen OK Okay fileviewer File not found Datei nicht gefunden File could not be opened Datei konnte nicht geöffnet werden The source file to be viewed is newer than the CodeQuery database file. You are recommended to manually regenerate the CodeQuery database file. Die Quelldatei angezeigt werden ist neuer als die CodeQuery-Datenbank-Datei. Wir empfehlen Ihnen, die CodeQuery-Datenbank-Datei manuell zu regenerieren. Cancel Abbrechen OK Okay External Editor Configuration Externer Editor Konfiguration Please enter the path and arguments for the external editor. Replace as follows: Bitte geben Sie den Pfad und die Argumente für den externen Editor. Wie folgt ersetzen: for file path für Dateipfad for line number für Zeilennummer For example: Zum Beispiel: File could not be opened! Datei konnte nicht geöffnet werden! External editor could not be started. Please check Options! Externer Editor konnte nicht gestartet werden. Bitte überprüfen Sie die Optionen! listhandler Symbol Symbol File Datei Line Linie Preview Vorschau mainwindow Cancel Abbrechen OK Okay Language Sprache Select language: Sprache auswählen: searchhandler Symbol Symbol Function or macro definition (Graph available) Funktion oder ein Makro-Definition (Graph verfügbar) Class or struct (Graph available) Klasse oder Struktur (Graph verfügbar) Functions calling this function Funktionen aufrufen dieser Funktion Functions called by this function Von dieser Funktion aufgerufenen Funktionen Calls of this function or macro Aufrufe dieser Funktion oder Makro Class which owns this member or method Klasse, die dieses Mitglied oder Methode besitzt Members or methods of this class Mitglieder oder Methoden dieser Klasse Parent of this class Eltern dieser Klasse Children of this class Kinder dieser Klasse Files including this file Dateien einschließlich dieser Full path for file Vollständiger Pfad für die Datei Functions or macros inside this file Funktionen oder Makros in dieser Datei CodeQuery DB Files CodeQuery DB-Dateien Open CQ database file Offene CQ-Datenbankdatei Function Call Graph Funktion Anruf-Diagramm Class Inheritance Graph Klasse Vererbung Graph If Exact Match is switched off, wildcard searches (* and ?) are supported Wenn genaue Ãœbereinstimmung Platzhaltersuche ausgeschaltet ist (* und?) werden unterstützt results found Treffer gefunden in progress in Bearbeitung Cancel Abbrechen You have to first select an item from the list before pushing the Graph button. Du musst zuerst ein Element aus der Liste auswählen, bevor Sie sich die Schaltfläche \"Graph\". File open error Offene Dateifehler Wrong file format Falsches Dateiformat Incorrect CQ database version Falsche CQ-Datenbankversion OK Okay Unknown Error Unbekannter Fehler codequery-0.18.1/gui/translations/codequery_en.ts000066400000000000000000000536301300045745200221470ustar00rootroot00000000000000 DialogGraph Graph Please wait ... Zoom Out Zoom In Number of levels: Save to DOT file Save Image Close MainWindow CodeQuery Open Database Auto-complete Exact match File path filter Filter File path filter, wildcard searches (* and ?) are supported Previous search term Next search term If Exact Match is switched off, wildcard searches (* and ?) are supported Search Paste and Search Draw graph Previous File Next File Open in Editor Go to selected line Reduce font size Increase font size Copy, paste and search Symbol search only for paste and search Symbol only Previous search result in this file Next search result in this file FilePath:0 Sort by line number Sort by name File Options Help Exit Open About External Editor Open CQ Database Language About Qt File Viewer Settings aboutDialog About CodeQuery OK cqDialogGraph Images Export Image File could not be saved! Export DOT file fileViewSettingsDialog File Viewer Settings Font Syntax highlight theme Tab Width (number of spaces) Cancel OK fileviewer File not found File could not be opened The source file to be viewed is newer than the CodeQuery database file. You are recommended to manually regenerate the CodeQuery database file. Cancel OK External Editor Configuration Please enter the path and arguments for the external editor. Replace as follows: for file path for line number For example: File could not be opened! External editor could not be started. Please check Options! listhandler Symbol File Line Preview mainwindow Cancel OK Language Select language: searchhandler Symbol Function or macro definition (Graph available) Class or struct (Graph available) Functions calling this function Functions called by this function Calls of this function or macro Class which owns this member or method Members or methods of this class Parent of this class Children of this class Files including this file Full path for file Functions or macros inside this file CodeQuery DB Files Open CQ database file Function Call Graph Class Inheritance Graph If Exact Match is switched off, wildcard searches (* and ?) are supported results found in progress Cancel You have to first select an item from the list before pushing the Graph button. File open error Wrong file format Incorrect CQ database version OK Unknown Error codequery-0.18.1/gui/translations/codequery_es.ts000066400000000000000000000552441300045745200221570ustar00rootroot00000000000000 DialogGraph Graph Gráfico Please wait ... Espera... Zoom Out Alejar Zoom In Zoom Number of levels: Número de niveles: Save to DOT file Guardar en un archivo de punto Save Image Guardar imagen Close Cerrar MainWindow CodeQuery CodeQuery Open Database Base de datos abierta Auto-complete Completar automáticamente Exact match Coincidencia exacta File path filter Filtro de ruta de archivo Filter Filtro File path filter, wildcard searches (* and ?) are supported Filtro de ruta de acceso de archivo, búsquedas de comodín (* y?) son compatibles Previous search term Término de búsqueda anterior Next search term Al término de la búsqueda If Exact Match is switched off, wildcard searches (* and ?) are supported Si está apagado coincidencia exacta, búsquedas de comodín (* y?) son compatibles Search Búsqueda Paste and Search Pasta y búsqueda Draw graph Gráfica Previous File Archivo anterior Next File Siguiente archivo Open in Editor Abierto en el Editor Go to selected line Ir a la línea seleccionada Reduce font size Reducir el tamaño de la fuente Increase font size Aumentar tamaño de fuente Copy, paste and search Copiar, pegar y buscar Symbol search only for paste and search Búsqueda de símbolo sólo para pasta y búsqueda Symbol only Símbolo sólo Previous search result in this file Resultado de la búsqueda anterior en este archivo Next search result in this file A continuación resultados de la búsqueda en este archivo FilePath:0 FilePath:0 Sort by line number Ordenar por número de línea Sort by name Ordenar por nombre File Archivo Options Opciones Help Ayuda Exit Salida Open Abierto About Acerca de External Editor Editor externo Open CQ Database Base de datos abierta CQ Language Idioma About Qt Acerca de Qt File Viewer Settings Configuraciones de visor de archivos aboutDialog About CodeQuery Acerca de CodeQuery OK Vale cqDialogGraph Images Imágenes Export Image Exportar imagen File could not be saved! No se han podido guardar archivo! Export DOT file Archivo de punto de exportación fileViewSettingsDialog File Viewer Settings Configuraciones de visor de archivos Font Fuente Syntax highlight theme Tema de resaltado de sintaxis Tab Width (number of spaces) Ficha anchura (número de espacios) Cancel Cancelar OK Vale fileviewer File not found Archivo no encontrado File could not be opened No se pudo abrir el archivo The source file to be viewed is newer than the CodeQuery database file. You are recommended to manually regenerate the CodeQuery database file. El archivo de origen para ser visto es más reciente que el archivo de base de datos de CodeQuery. Se recomienda para regenerar manualmente el archivo de base de datos de CodeQuery. Cancel Cancelar OK Vale External Editor Configuration Configuración del Editor externo Please enter the path and arguments for the external editor. Replace as follows: Por favor ingrese la ruta y argumentos para el editor externo. Reemplace como sigue: for file path para la ruta del archivo for line number para el número de línea For example: Por ejemplo: File could not be opened! No se pudo abrir el archivo! External editor could not be started. Please check Options! No se pudo iniciar el editor externo. Consulte Opciones! listhandler Symbol Símbolo File Archivo Line Línea Preview Vista previa mainwindow Cancel Cancelar OK Vale Language Idioma Select language: Seleccionar idioma: searchhandler Symbol Símbolo Function or macro definition (Graph available) Definición de función o macro (gráfico disponible) Class or struct (Graph available) Clase o estructura (gráfico disponible) Functions calling this function Funciones llamar a esta función Functions called by this function Funciones de llamada por esta función Calls of this function or macro Llamadas de esta función o macro Class which owns this member or method Clase que posee este miembro o método Members or methods of this class Miembros o métodos de esta clase Parent of this class Padres de esta clase Children of this class Niños de esta clase Files including this file Archivos incluyendo este archivo Full path for file Ruta de acceso completa de archivo Functions or macros inside this file Funciones o macros dentro de este archivo CodeQuery DB Files CodeQuery DB archivos Open CQ database file Abrir archivo de base de datos de CQ Function Call Graph Gráfico de la llamada de función Class Inheritance Graph Gráfico de la herencia de clase If Exact Match is switched off, wildcard searches (* and ?) are supported Si está apagado coincidencia exacta, búsquedas de comodín (* y?) son compatibles results found se han encontrado resultados in progress en progreso Cancel Cancelar You have to first select an item from the list before pushing the Graph button. Tienes que seleccionar primero un elemento de la lista antes de presionar el botón gráfico. File open error Error de archivo abierto Wrong file format Formato de archivo incorrecto Incorrect CQ database version Versión incorrecta de la base de datos de CQ OK Vale Unknown Error Error desconocido codequery-0.18.1/gui/translations/codequery_fr.ts000066400000000000000000000555451300045745200221630ustar00rootroot00000000000000 DialogGraph Graph Graphique Please wait ... Veuillez patienter... Zoom Out Effectuer un zoom arrière Zoom In Effectuez un zoom avant Number of levels: Nombre de niveaux: Save to DOT file Enregistrer dans fichier DOT Save Image Enregistrer l'Image Close Fermer MainWindow CodeQuery CodeQuery Open Database Base de données ouverte Auto-complete Semi-automatique Exact match Correspondance exacte File path filter Filtre de chemin de fichier Filter Filtre File path filter, wildcard searches (* and ?) are supported Filtre de chemin d'accès de fichier, les recherches génériques (* et?) sont pris en charge Previous search term Terme de la recherche précédente Next search term Prochain mandat de recherche If Exact Match is switched off, wildcard searches (* and ?) are supported Si une correspondance exacte déconnexion, recherches génériques (* et?) sont pris en charge Search Rechercher Paste and Search Pâte et recherche Draw graph Tracer graphique Previous File Fichier précédent Next File Fichier suivant Open in Editor Ouvert dans l'éditeur Go to selected line Aller à la ligne sélectionnée Reduce font size Réduire la taille de police Increase font size Augmenter la taille de police Copy, paste and search Copier, coller et Rechercher Symbol search only for paste and search Recherche de symbole que pour la pâte et de la recherche Symbol only Symbole seulement Previous search result in this file Résultat de la recherche précédente dans ce fichier Next search result in this file Résultat de la recherche suivante dans ce fichier FilePath:0 FilePath:0 Sort by line number Trier par numéro de ligne Sort by name Trier par nom File Fichier Options Options Help Aide Exit Sortie Open Ouvert About Sur External Editor External Editor Open CQ Database Base de données ouverte CQ Language Langue About Qt Sur Qt File Viewer Settings Paramètres de visionneuse de fichiers aboutDialog About CodeQuery Sur CodeQuery OK Bien cqDialogGraph Images Images Export Image Exporter Image File could not be saved! Fichier n'a pas pu être sauvé ! Export DOT file Exporter fichier DOT fileViewSettingsDialog File Viewer Settings Paramètres de visionneuse de fichiers Font Polices Syntax highlight theme Thème de point culminant de syntaxe Tab Width (number of spaces) Onglet largeur (nombre de places) Cancel Annuler OK Bien fileviewer File not found Fichier non trouvé File could not be opened Fichier n'a pas pu être ouvert The source file to be viewed is newer than the CodeQuery database file. You are recommended to manually regenerate the CodeQuery database file. Le fichier source à afficher est plus récent que le fichier de base de données CodeQuery. Il est conseillé de régénérer manuellement le fichier de base de données CodeQuery. Cancel Annuler OK Bien External Editor Configuration Configuration de l'éditeur externe Please enter the path and arguments for the external editor. Replace as follows: Veuillez entrer le chemin d'accès et les arguments de l'éditeur externe. Remplacer comme suit : for file path pour le chemin du fichier for line number pour le numéro de ligne For example: Par exemple : File could not be opened! Fichier n'a pas pu être ouvert ! External editor could not be started. Please check Options! Éditeur externe n'a pas pu être démarré. Vérifiez les Options ! listhandler Symbol Symbole File Fichier Line Ligne Preview Aperçu mainwindow Cancel Annuler OK Bien Language Langue Select language: Sélectionner une langue: searchhandler Symbol Symbole Function or macro definition (Graph available) Définition de fonction ou de la macro (graphique disponible) Class or struct (Graph available) Classe ou struct (graphique disponible) Functions calling this function Fonctions d'appel de cette fonction Functions called by this function Fonctions appelées par cette fonction Calls of this function or macro Appels de la fonction ou la macro Class which owns this member or method Classe qui possède ce membre ou la méthode Members or methods of this class Membres ou méthodes de cette classe Parent of this class Parent de cette classe Children of this class Enfants de cette classe Files including this file Fichiers à inclure ce fichier Full path for file Chemin d'accès complet pour le fichier Functions or macros inside this file Fonctions ou des macros à l'intérieur de ce fichier CodeQuery DB Files CodeQuery DB fichiers Open CQ database file Ouvrir le fichier de base de données CQ Function Call Graph Fonction Call Graph Class Inheritance Graph Classe héritage graphique If Exact Match is switched off, wildcard searches (* and ?) are supported Si une correspondance exacte déconnexion, recherches génériques (* et?) sont pris en charge results found résultats trouvés in progress en cours Cancel Annuler You have to first select an item from the list before pushing the Graph button. Vous devez d'abord sélectionner un élément dans la liste avant de pousser le bouton graphique. File open error Erreur de fichier ouvert Wrong file format Format de fichier incorrect Incorrect CQ database version Version de base de données incorrecte CQ OK Bien Unknown Error Erreur inconnue codequery-0.18.1/gui/translations/codequery_id.ts000066400000000000000000000544051300045745200221420ustar00rootroot00000000000000 DialogGraph Graph Grafik Please wait ... Harap tunggu... Zoom Out Zoom Out Zoom In Memperbesar Number of levels: Jumlah tingkat: Save to DOT file Menyimpan DOT file Save Image Simpan gambar Close Dekat MainWindow CodeQuery CodeQuery Open Database Buka Database Auto-complete Auto-lengkap Exact match Pencocokan sama persis File path filter File path filter Filter Filter File path filter, wildcard searches (* and ?) are supported File path filter, pencarian wildcard (* dan?) yang didukung Previous search term Istilah penelusuran sebelumnya Next search term Istilah pencarian berikutnya If Exact Match is switched off, wildcard searches (* and ?) are supported Jika pencocokan sama persis dimatikan, pencarian wildcard (* dan?) yang didukung Search Cari Paste and Search Tempel dan telusuri Draw graph Menggambar grafik Previous File File sebelumnya Next File Sebelumnya/berikutnya Open in Editor Terbuka di Editor Go to selected line Pergi ke saluran yang dipilih Reduce font size Mengurangi ukuran font Increase font size Meningkatkan ukuran font Copy, paste and search Salin, Tempel dan telusuri Symbol search only for paste and search Simbol pencarian hanya untuk Tempel dan telusuri Symbol only Simbol hanya Previous search result in this file Hasil penelusuran sebelumnya dalam file ini Next search result in this file Hasil pencarian berikutnya dalam file ini FilePath:0 FilePath:0 Sort by line number Urut berdasarkan nomor baris Sort by name Urut berdasarkan nama File File Options Pilihan Help Tolong Exit Keluar Open Buka About Tentang External Editor Editor eksternal Open CQ Database CQ buka Database Language Bahasa About Qt Tentang Qt File Viewer Settings Pengaturan file Viewer aboutDialog About CodeQuery Tentang CodeQuery OK Oke cqDialogGraph Images Gambar Export Image Ekspor gambar File could not be saved! File tidak bisa diselamatkan! Export DOT file Mengekspor DOT file fileViewSettingsDialog File Viewer Settings Pengaturan file Viewer Font Font Syntax highlight theme Sintaks sorot tema Tab Width (number of spaces) Tab lebar (jumlah ruang) Cancel Batal OK Oke fileviewer File not found File tidak ditemukan File could not be opened File tidak bisa dibuka The source file to be viewed is newer than the CodeQuery database file. You are recommended to manually regenerate the CodeQuery database file. File sumber untuk dilihat lebih baru daripada CodeQuery database file. Anda disarankan untuk secara manual regenerasi CodeQuery database file. Cancel Batal OK Oke External Editor Configuration Konfigurasi eksternal Editor Please enter the path and arguments for the external editor. Replace as follows: Harap masukkan path dan argumen untuk editor eksternal. Ganti sebagai berikut: for file path untuk file path for line number untuk nomor baris For example: Sebagai contoh: File could not be opened! File tidak bisa dibuka! External editor could not be started. Please check Options! Editor eksternal tidak dapat dimulai. Silakan periksa pilihan! listhandler Symbol Simbol File File Line Baris Preview Tinjauan mainwindow Cancel Batal OK Oke Language Bahasa Select language: Pilih bahasa: searchhandler Symbol Simbol Function or macro definition (Graph available) Definisi fungsi atau makro (grafik tersedia) Class or struct (Graph available) Kelas atau struct (grafik tersedia) Functions calling this function Fungsi-fungsi yang memanggil fungsi ini Functions called by this function Fungsi-fungsi yang disebut oleh fungsi ini Calls of this function or macro Panggilan ini fungsi atau makro Class which owns this member or method Kelas yang memiliki anggota atau metode ini Members or methods of this class Anggota atau metode kelas ini Parent of this class Orang tua dari kelas ini Children of this class Anak-anak kelas ini Files including this file File termasuk file ini Full path for file Path lengkap untuk file Functions or macros inside this file Fungsi atau Macro di dalam file ini CodeQuery DB Files CodeQuery DB file Open CQ database file Buka file database CQ Function Call Graph Grafik fungsi panggilan Class Inheritance Graph Kelas warisan grafik If Exact Match is switched off, wildcard searches (* and ?) are supported Jika pencocokan sama persis dimatikan, pencarian wildcard (* dan?) yang didukung results found hasil ditemukan in progress sedang berlangsung Cancel Batal You have to first select an item from the list before pushing the Graph button. Anda harus memilih dulu item dari daftar sebelum menekan tombol grafik. File open error Buka file kesalahan Wrong file format Format file salah Incorrect CQ database version Salah CQ database versi OK Oke Unknown Error Error tidak diketahui codequery-0.18.1/gui/translations/codequery_it.ts000066400000000000000000000550731300045745200221640ustar00rootroot00000000000000 DialogGraph Graph Grafico Please wait ... Attendere prego... Zoom Out Zoom indietro Zoom In Zoom In Number of levels: Numero di livelli: Save to DOT file Salvare file DOT Save Image Salva immagine Close Chiudere MainWindow CodeQuery CodeQuery Open Database Database aperto Auto-complete Completamento automatico Exact match Corrispondenza esatta File path filter Filtro percorso file Filter Filtro File path filter, wildcard searches (* and ?) are supported Filtro percorso file, ricerche con caratteri jolly (* e?) sono supportati Previous search term Termine di ricerca precedente Next search term Successivo al termine di ricerca If Exact Match is switched off, wildcard searches (* and ?) are supported Se la corrispondenza esatta è spento, ricerche con caratteri jolly (* e?) sono supportati Search Ricerca Paste and Search Incolla e ricerca Draw graph Disegnare il grafico Previous File Precedente File Next File File successivo Open in Editor Aperto nell'Editor Go to selected line Vai alla riga selezionata. Reduce font size Ridurre la dimensione del carattere Increase font size Aumentare la dimensione del carattere Copy, paste and search Copia, incolla e ricerca Symbol search only for paste and search Simbolo cerca solo pasta e ricerca Symbol only Unico simbolo Previous search result in this file Risultato della ricerca precedente in questo file Next search result in this file Risultati di ricerca successivo in questo file FilePath:0 FilePath:0 Sort by line number Ordina per numero di riga Sort by name Ordina per nome File File Options Opzioni Help Guida Exit Uscita Open Open About Info su External Editor Editor esterno Open CQ Database CQ Open Database Language Lingua About Qt Info su Qt File Viewer Settings Impostazioni del file Viewer aboutDialog About CodeQuery Info su CodeQuery OK Ok cqDialogGraph Images Immagini Export Image Esportazione immagine File could not be saved! File non poteva essere salvato! Export DOT file Esportare file DOT fileViewSettingsDialog File Viewer Settings Impostazioni del file Viewer Font Tipo di carattere Syntax highlight theme Tema di evidenziazione sintassi Tab Width (number of spaces) Larghezza scheda (numero di spazi) Cancel Annulla OK Ok fileviewer File not found File non trovato File could not be opened File non può essere aperto The source file to be viewed is newer than the CodeQuery database file. You are recommended to manually regenerate the CodeQuery database file. Il file di origine per essere visualizzati è più recente rispetto al file di database CodeQuery. Si raccomanda di rigenerare manualmente il file di database CodeQuery. Cancel Annulla OK Ok External Editor Configuration Configurazione Editor esterno Please enter the path and arguments for the external editor. Replace as follows: Inserisci il percorso e gli argomenti per l'editor esterno. Sostituire come segue: for file path per il percorso del file for line number per numero di riga For example: Ad esempio: File could not be opened! File non può essere aperto! External editor could not be started. Please check Options! Editor esterno potrebbe non essere avviato. Si prega di controllare le opzioni! listhandler Symbol Simbolo File File Line Linea Preview Anteprima mainwindow Cancel Annulla OK Ok Language Lingua Select language: Seleziona lingua: searchhandler Symbol Simbolo Function or macro definition (Graph available) Definizione di funzione o macro (grafico disponibile) Class or struct (Graph available) Classe o struttura (grafico disponibile) Functions calling this function Funzioni di chiamata a questa funzione Functions called by this function Funzioni chiamate da questa funzione Calls of this function or macro Chiamate di questa funzione o macro Class which owns this member or method Classe che possiede questo membro o metodo. Members or methods of this class Membri o i metodi di questa classe Parent of this class Padre di questa classe Children of this class Bambini di questa classe Files including this file File incluso questo file Full path for file Percorso completo per il file Functions or macros inside this file Macro o funzioni all'interno di questo file. CodeQuery DB Files CodeQuery DB file Open CQ database file Aprire il file database CQ Function Call Graph Funzione Call Graph Class Inheritance Graph Grafico di ereditarietà di classe If Exact Match is switched off, wildcard searches (* and ?) are supported Se la corrispondenza esatta è spento, ricerche con caratteri jolly (* e?) sono supportati results found risultati trovati in progress in corso Cancel Annulla You have to first select an item from the list before pushing the Graph button. È necessario innanzitutto selezionare un elemento dall'elenco prima di spingere il pulsante grafico. File open error Errore di file aperti Wrong file format Formato di file sbagliato Incorrect CQ database version Versione del database corretto CQ OK Ok Unknown Error Errore sconosciuto codequery-0.18.1/gui/translations/codequery_ja.ts000066400000000000000000000565251300045745200221450ustar00rootroot00000000000000 DialogGraph Graph グラフ Please wait ... ãŠå¾…ã¡ãã ã•ã„。。。 Zoom Out ズーム アウト Zoom In ズームインã—ã¾ã™ã€‚ Number of levels: レベル数: Save to DOT file ドット ファイルã«ä¿å­˜ã—ã¾ã™ã€‚ Save Image ç”»åƒã‚’ä¿å­˜ã—ã¾ã™ã€‚ Close é–‰ã˜ã‚‹ MainWindow CodeQuery CodeQuery Open Database データベースを開ã Auto-complete 自動車-完全㪠Exact match 完全ã«ä¸€è‡´ã—ã¾ã™ã€‚ File path filter ファイル パス フィルター Filter フィルター File path filter, wildcard searches (* and ?) are supported ファイル パス フィルターã€ãƒ¯ã‚¤ãƒ«ãƒ‰ã‚«ãƒ¼ãƒ‰æ¤œç´¢ (* ã¨?) ãŒã‚µãƒãƒ¼ãƒˆã•ã‚Œã¦ã„ã¾ã™ Previous search term å‰ã®æ¤œç´¢ã‚¯ã‚¨ãƒª Next search term 次ã®æ¤œç´¢ç”¨èªž If Exact Match is switched off, wildcard searches (* and ?) are supported 完全ã«ä¸€è‡´ã™ã‚‹ãƒ¯ã‚¤ãƒ«ãƒ‰ã‚«ãƒ¼ãƒ‰æ¤œç´¢ã‚’切り替ãˆãŸå ´åˆ (* ã¨?) サãƒãƒ¼ãƒˆã•ã‚Œã¦ã„ã¾ã™ã€‚ Search 検索 Paste and Search 貼り付ã‘ã€æ¤œç´¢ Draw graph グラフをæã Previous File 以å‰ã®ãƒ•ã‚¡ã‚¤ãƒ« Next File 次ã®ãƒ•ã‚¡ã‚¤ãƒ« Open in Editor エディターã§é–‹ã Go to selected line é¸æŠžã—ãŸè¡Œã«ç§»å‹•ã—ã¾ã™ã€‚ Reduce font size フォント サイズをå°ã•ã Increase font size フォント サイズを大ãã Copy, paste and search コピーã€è²¼ã‚Šä»˜ã‘ã€æ¤œç´¢ Symbol search only for paste and search シンボル検索ã¯ã€è²¼ã‚Šä»˜ã‘ã€æ¤œç´¢ã®ã¿ Symbol only シンボルã®ã¿ Previous search result in this file ã“ã®ãƒ•ã‚¡ã‚¤ãƒ«ã®å‰ã®æ¤œç´¢çµæžœ Next search result in this file ã“ã®ãƒ•ã‚¡ã‚¤ãƒ«ã®æ¬¡ã®æ¤œç´¢çµæžœ FilePath:0 FilePath:0 Sort by line number 行番å·é †ã«ä¸¦ã¹æ›¿ãˆã¾ã™ Sort by name åå‰é †ã«ä¸¦ã¹æ›¿ãˆã¾ã™ File ファイル Options オプション Help ヘルプ Exit 終了 Open オープン About ã«ã¤ã„㦠External Editor 外部エディター Open CQ Database オープン cq, データベース Language 言語 About Qt Qt ã«ã¤ã„㦠File Viewer Settings ファイル ビューアーã®è¨­å®š aboutDialog About CodeQuery CodeQuery ã«ã¤ã„㦠OK ã‚ã‹ã‚Šã¾ã—㟠cqDialogGraph Images ç”»åƒ Export Image イメージをエクスãƒãƒ¼ãƒˆã—ã¾ã™ã€‚ File could not be saved! ファイルをä¿å­˜ã§ãã¾ã›ã‚“ã§ã—ãŸ ï¼ Export DOT file ドット ファイルをエクスãƒãƒ¼ãƒˆã—ã¾ã™ã€‚ fileViewSettingsDialog File Viewer Settings ファイル ビューアーã®è¨­å®š Font フォント Syntax highlight theme 構文強調表示テーマ Tab Width (number of spaces) タブ幅 (スペース数) Cancel キャンセル OK ã‚ã‹ã‚Šã¾ã—㟠fileviewer File not found ファイルãŒè¦‹ã¤ã‹ã‚Šã¾ã›ã‚“ File could not be opened ファイルを開ãã“ã¨ãŒã§ãã¾ã›ã‚“。 The source file to be viewed is newer than the CodeQuery database file. You are recommended to manually regenerate the CodeQuery database file. ソース ファイルを表示ã™ã‚‹ã®ã«ã¯ã€CodeQuery データベース ファイルよりも新ã—ã„ã§ã™ã€‚CodeQuery データベース ファイルを手動ã§å†ç”Ÿæˆã«æŽ¨å¥¨ã•ã‚Œã¾ã™ã€‚ Cancel キャンセル OK ã‚ã‹ã‚Šã¾ã—㟠External Editor Configuration 外部エディターã®æ§‹æˆ Please enter the path and arguments for the external editor. Replace as follows: 外部エディターã®å¼•æ•°ã¨ãƒ‘スを入力ã—ã¦ãã ã•ã„。次ã®ã‚ˆã†ã«ç½®ãæ›ãˆã¾ã™ã€‚ for file path ファイルã®ãƒ‘ス for line number 行番å·ã«ã¤ã„㦠For example: ãŸã¨ãˆã°ã€‚ File could not be opened! ファイルを開ãã“ã¨ãŒã§ãã¾ã›ã‚“ ï¼ External editor could not be started. Please check Options! 外部エディターを開始ã§ãã¾ã›ã‚“ã§ã—ãŸã€‚オプションを確èªã—ã¦ãã ã•ã„ ï¼ listhandler Symbol シンボル File ファイル Line ライン Preview プレビュー mainwindow Cancel キャンセル OK ã‚ã‹ã‚Šã¾ã—㟠Language 言語 Select language: 言語ã®é¸æŠžï¼š searchhandler Symbol シンボル Function or macro definition (Graph available) 関数ã¾ãŸã¯ãƒžã‚¯ãƒ­ã®å®šç¾© (グラフ) Class or struct (Graph available) クラスã¾ãŸã¯æ§‹é€ ä½“ (利用å¯èƒ½ãªã‚°ãƒ©ãƒ•) Functions calling this function ã“ã®é–¢æ•°ã‚’呼ã³å‡ºã™é–¢æ•° Functions called by this function ã“ã®é–¢æ•°ã«ã‚ˆã£ã¦å‘¼ã³å‡ºã•ã‚ŒãŸé–¢æ•° Calls of this function or macro ã“ã®é–¢æ•°ã‚„マクロã®å‘¼ã³å‡ºã— Class which owns this member or method ã“ã®ãƒ¡ãƒ³ãƒãƒ¼ã¾ãŸã¯ãƒ¡ã‚½ãƒƒãƒ‰ã‚’所有ã—ã¦ã„るクラス Members or methods of this class ã“ã®ã‚¯ãƒ©ã‚¹ã®ãƒ¡ãƒ³ãƒãƒ¼ã‚„メソッド Parent of this class ã“ã®ã‚¯ãƒ©ã‚¹ã®è¦ª Children of this class ã“ã®ã‚¯ãƒ©ã‚¹ã®å­ä¾›ãŸã¡ Files including this file ã“ã®ãƒ•ã‚¡ã‚¤ãƒ«ã‚’å«ã‚€ãƒ•ã‚¡ã‚¤ãƒ« Full path for file ファイルã®å®Œå…¨ãªãƒ‘ス Functions or macros inside this file 関数ã¾ãŸã¯ã“ã®ãƒ•ã‚¡ã‚¤ãƒ«å†…ã®ãƒžã‚¯ãƒ­ CodeQuery DB Files CodeQuery DB ファイル Open CQ database file Cq, データベース ファイルを開ã Function Call Graph 関数コール グラフ Class Inheritance Graph クラス継承グラフ If Exact Match is switched off, wildcard searches (* and ?) are supported 完全ã«ä¸€è‡´ã™ã‚‹ãƒ¯ã‚¤ãƒ«ãƒ‰ã‚«ãƒ¼ãƒ‰æ¤œç´¢ã‚’切り替ãˆãŸå ´åˆ (* ã¨?) サãƒãƒ¼ãƒˆã•ã‚Œã¦ã„ã¾ã™ã€‚ results found 検索çµæžœ in progress 進行中 Cancel キャンセル You have to first select an item from the list before pushing the Graph button. [グラフ] ボタンを押ã™å‰ã«ã¾ãšä¸€è¦§ã‹ã‚‰é …目をé¸æŠžã™ã‚‹å¿…è¦ãŒã‚ã‚Šã¾ã™ã€‚ File open error ファイルを開ãエラー Wrong file format ファイル フォーマット Incorrect CQ database version Cq, データベース ãƒãƒ¼ã‚¸ãƒ§ãƒ³ãŒæ­£ã—ããªã„ã§ã™ã€‚ OK ã‚ã‹ã‚Šã¾ã—㟠Unknown Error ä¸æ˜Žãªã‚¨ãƒ©ãƒ¼ codequery-0.18.1/gui/translations/codequery_ko.ts000066400000000000000000000552341300045745200221600ustar00rootroot00000000000000 DialogGraph Graph 그래프 Please wait ... 잠시만 기다려 주십시오... Zoom Out 축소 Zoom In 확대 Number of levels: ìˆ˜ì¤€ì˜ ìˆ˜: Save to DOT file ì  íŒŒì¼ì— 저장 Save Image ì´ë¯¸ì§€ 저장 Close 닫기 MainWindow CodeQuery CodeQuery Open Database ë°ì´í„°ë² ì´ìŠ¤ 열기 Auto-complete ìžë™ 완성 Exact match 정확 하 게 ì¼ì¹˜ File path filter íŒŒì¼ ê²½ë¡œ í•„í„° Filter í•„í„° File path filter, wildcard searches (* and ?) are supported íŒŒì¼ ê²½ë¡œ í•„í„°, 와ì¼ë“œ ì¹´ë“œ 검색 (* ë°?) ì§€ì› Previous search term ì´ì „ 검색어 Next search term ë‹¤ìŒ ê²€ìƒ‰ì–´ If Exact Match is switched off, wildcard searches (* and ?) are supported 정확히 ì¼ì¹˜ 하는 와ì¼ë“œ ì¹´ë“œ ê²€ìƒ‰ì„ ì „í™˜ 하는 경우 (* ë°?) ì§€ì› Search 검색 Paste and Search 붙여넣기 ë° ê²€ìƒ‰ Draw graph 그래프 그리기 Previous File ì´ì „ íŒŒì¼ Next File ë‹¤ìŒ íŒŒì¼ Open in Editor 편집기ì—ì„œ ì—´ë ¤ Go to selected line ì„ íƒ ëœ ì¤„ìœ¼ë¡œ ì´ë™ Reduce font size 글꼴 í¬ê¸° 줄ì´ê¸° Increase font size 글꼴 í¬ê¸° ì¦ê°€ Copy, paste and search 복사, 붙여넣기 ë° ê²€ìƒ‰ Symbol search only for paste and search 붙여넣기 ë° ê²€ìƒ‰ì— ëŒ€í•´ì„œë§Œ 기호 검색 Symbol only ìƒì§•ë§Œ Previous search result in this file ì´ íŒŒì¼ì—ì„œ ì´ì „ 검색 ê²°ê³¼ Next search result in this file ì´ íŒŒì¼ì—ì„œ ë‹¤ìŒ ê²€ìƒ‰ ê²°ê³¼ FilePath:0 FilePath:0 Sort by line number 줄 번호로 ì •ë ¬ 합니다 Sort by name ì´ë¦„으로 ì •ë ¬ 합니다 File íŒŒì¼ Options 옵션 Help ë„ì›€ë§ Exit 출구 Open 오픈 About ì— ëŒ€ í•œ External Editor 외부 편집기 Open CQ Database 오픈 CQ ë°ì´í„°ë² ì´ìŠ¤ Language 언어 About Qt Qtì— ëŒ€ í•œ File Viewer Settings íŒŒì¼ ë·°ì–´ 설정 aboutDialog About CodeQuery CodeQueryì— ëŒ€ í•œ OK ê´œì°®ì•˜ë˜ ê²ƒ cqDialogGraph Images ì´ë¯¸ì§€ Export Image ì´ë¯¸ì§€ 내보내기 File could not be saved! 파ì¼ì„ 저장할 수 없습니다! Export DOT file ë„트 íŒŒì¼ ë‚´ë³´ë‚´ê¸° fileViewSettingsDialog File Viewer Settings íŒŒì¼ ë·°ì–´ 설정 Font 글꼴 Syntax highlight theme 구문 하ì´ë¼ì´íŠ¸ 테마 Tab Width (number of spaces) 탭 너비 (공백 수) Cancel 취소 OK ê´œì°®ì•˜ë˜ ê²ƒ fileviewer File not found 파ì¼ì„ ì°¾ì„ ìˆ˜ 없습니다 File could not be opened 파ì¼ì„ ì—´ 수 없습니다. The source file to be viewed is newer than the CodeQuery database file. You are recommended to manually regenerate the CodeQuery database file. 소스 파ì¼ì„ ë³¼ 수 CodeQuery ë°ì´í„°ë² ì´ìŠ¤ íŒŒì¼ ë³´ë‹¤ 최신입니다. CodeQuery ë°ì´í„°ë² ì´ìŠ¤ 파ì¼ì„ 수ë™ìœ¼ë¡œ 다시 ìƒì„± 하는 ê²ƒì´ ì¢‹ìŠµë‹ˆë‹¤. Cancel 취소 OK ê´œì°®ì•˜ë˜ ê²ƒ External Editor Configuration 외부 편집기 구성 Please enter the path and arguments for the external editor. Replace as follows: 경로 ë° ì™¸ë¶€ íŽ¸ì§‘ê¸°ì— ëŒ€ í•œ ì¸ìˆ˜ë¥¼ ìž…ë ¥ í•´ 주시기 ë°”ëžë‹ˆë‹¤. 다ìŒê³¼ ê°™ì´ ë°”ê¿‰ë‹ˆë‹¤. for file path íŒŒì¼ ê²½ë¡œ 대 í•œ for line number 줄 ë²ˆí˜¸ì— ëŒ€ í•œ For example: 예를 들어: File could not be opened! 파ì¼ì„ ì—´ 수 없습니다! External editor could not be started. Please check Options! 외부 편집기를 시작할 수 없습니다. ì˜µì…˜ì„ í™•ì¸ í•˜ì‹­ì‹œì˜¤! listhandler Symbol 기호 File íŒŒì¼ Line ì„  Preview 미리 보기 mainwindow Cancel 취소 OK ê´œì°®ì•˜ë˜ ê²ƒ Language 언어 Select language: 언어 ì„ íƒ: searchhandler Symbol 기호 Function or macro definition (Graph available) 함수 ë˜ëŠ” 매í¬ë¡œ ì •ì˜ (그래프 제공) Class or struct (Graph available) í´ëž˜ìŠ¤ ë˜ëŠ” 구조체 (그래프 제공) Functions calling this function ì´ í•¨ìˆ˜ë¥¼ 호출 하는 함수 Functions called by this function ì´ í•¨ìˆ˜ì— ì˜í•´ 호출 ëœ í•¨ìˆ˜ Calls of this function or macro ì´ í•¨ìˆ˜ ë˜ëŠ” 매í¬ë¡œì˜ 호출 Class which owns this member or method í´ëž˜ìŠ¤ 멤버 ë˜ëŠ” 메서드가 소유 하 ê³  있는 Members or methods of this class íšŒì› ë˜ëŠ”ì´ í´ëž˜ìŠ¤ì˜ 메서드 Parent of this class ì´ í´ëž˜ìŠ¤ì˜ 부모 Children of this class ì´ í´ëž˜ìŠ¤ì˜ ìžì‹ Files including this file ì´ íŒŒì¼ì„ í¬í•¨ í•œ íŒŒì¼ Full path for file 파ì¼ì˜ ì „ì²´ 경로 Functions or macros inside this file ì´ íŒŒì¼ ì•ˆì— ë§¤í¬ë¡œ ë˜ëŠ” 함수 CodeQuery DB Files CodeQuery DB íŒŒì¼ Open CQ database file CQ ë°ì´í„°ë² ì´ìŠ¤ íŒŒì¼ ì—´ê¸° Function Call Graph 함수 호출 그래프 Class Inheritance Graph í´ëž˜ìŠ¤ ìƒì† 그래프 If Exact Match is switched off, wildcard searches (* and ?) are supported 정확히 ì¼ì¹˜ 하는 와ì¼ë“œ ì¹´ë“œ ê²€ìƒ‰ì„ ì „í™˜ 하는 경우 (* ë°?) ì§€ì› results found ì°¾ì€ ê²°ê³¼ in progress 진행 중 Cancel 취소 You have to first select an item from the list before pushing the Graph button. 먼저 그래프 ë²„íŠ¼ì„ ì¶”ì§„ 하기 ì „ì— ëª©ë¡ì—ì„œ í•­ëª©ì„ ì„ íƒ í•´ì•¼ 합니다. File open error íŒŒì¼ ì—´ê¸° 오류 Wrong file format 잘못 ëœ íŒŒì¼ í˜•ì‹ Incorrect CQ database version 잘못 ëœ CQ ë°ì´í„°ë² ì´ìŠ¤ 버전 OK ê´œì°®ì•˜ë˜ ê²ƒ Unknown Error ì•Œ 수 없는 오류 codequery-0.18.1/gui/translations/codequery_zh-CHS.ts000066400000000000000000000537441300045745200226070ustar00rootroot00000000000000 DialogGraph Graph 图 Please wait ... 请ç¨å€™ã€‚。。 Zoom Out ç¼©å° Zoom In 放大 Number of levels: 级别数: Save to DOT file å°†ä¿å­˜åˆ°ç‚¹æ–‡ä»¶ Save Image ä¿å­˜å›¾åƒ Close 关闭 MainWindow CodeQuery CodeQuery Open Database 打开的数æ®åº“ Auto-complete è‡ªåŠ¨å®Œæˆ Exact match ç²¾ç¡®åŒ¹é… File path filter 文件路径筛选器 Filter 筛选器 File path filter, wildcard searches (* and ?) are supported 文件路径筛选器〠通é…符æœç´¢ （* å’Œ?） æ”¯æŒ Previous search term 以å‰çš„æœç´¢è¯ Next search term 下一个æœç´¢è¯ If Exact Match is switched off, wildcard searches (* and ?) are supported 如果精确匹é…关掉，通é…符æœç´¢ （* å’Œ?） æ”¯æŒ Search æœç´¢ Paste and Search 粘贴并æœç´¢ Draw graph 绘制关系图 Previous File 以å‰çš„文件 Next File 下一个文件 Open in Editor 在编辑器中打开 Go to selected line 转到所选行 Reduce font size å‡å°å­—ä½“å¤§å° Increase font size å¢žåŠ å­—ä½“å¤§å° Copy, paste and search å¤åˆ¶ã€ 粘贴和æœç´¢ Symbol search only for paste and search 仅用于粘贴和æœç´¢ç¬¦å·æœç´¢ Symbol only åªæœ‰ç¬¦å· Previous search result in this file 此文件中的上一个æœç´¢ç»“æžœ Next search result in this file 在此文件中的下一个æœç´¢ç»“æžœ FilePath:0 FilePath:0 Sort by line number 按行å·æŽ’åº Sort by name 按åç§°æŽ’åº File 文件 Options 选项 Help 帮助 Exit 退出 Open 开放 About 关于 External Editor 外部编辑器 Open CQ Database 打开 CQ æ•°æ®åº“ Language 语言 About Qt 关于 Qt File Viewer Settings 文件查看器设置 aboutDialog About CodeQuery 关于 CodeQuery OK 还行 cqDialogGraph Images å›¾åƒ Export Image å¯¼å‡ºå›¾åƒ File could not be saved! 无法ä¿å­˜æ–‡ä»¶ ï¼ Export DOT file 出å£ç‚¹æ–‡ä»¶ fileViewSettingsDialog File Viewer Settings 文件查看器设置 Font 字体 Syntax highlight theme 语法çªå‡ºæ˜¾ç¤ºä¸»é¢˜ Tab Width (number of spaces) 标签宽度 （空格的数é‡ï¼‰ Cancel å–消 OK 还行 fileviewer File not found 找ä¸åˆ°æ–‡ä»¶ File could not be opened ä¸èƒ½æ‰“开文件 The source file to be viewed is newer than the CodeQuery database file. You are recommended to manually regenerate the CodeQuery database file. è¦æŸ¥çœ‹æºæ–‡ä»¶æ˜¯æ¯” CodeQuery æ•°æ®åº“文件更新。建议您手动é‡æ–°ç”Ÿæˆçš„ CodeQuery æ•°æ®åº“文件。 Cancel å–消 OK 还行 External Editor Configuration 外部编辑器é…ç½® Please enter the path and arguments for the external editor. Replace as follows: 请输入路径和å‚数的外部编辑器。替æ¢ï¼Œå¦‚下所示： for file path 文件路径 for line number ä¸ºè¡Œå· For example: 例如： File could not be opened! ä¸èƒ½æ‰“开文件 ï¼ External editor could not be started. Please check Options! 无法å¯åŠ¨å¤–部编辑器。请检查选项 ï¼ listhandler Symbol ç¬¦å· File 文件 Line è¡Œ Preview 预览 mainwindow Cancel å–消 OK 还行 Language 语言 Select language: 选择语言： searchhandler Symbol ç¬¦å· Function or macro definition (Graph available) 函数或å®çš„定义 （Graph 中å¯ç”¨) Class or struct (Graph available) 类或结构 （Graph 中å¯ç”¨ï¼‰ Functions calling this function 调用此函数的函数 Functions called by this function 此函数调用的函数 Calls of this function or macro 此函数或å®çš„调用 Class which owns this member or method 拥有此æˆå‘˜æˆ–方法的类 Members or methods of this class 此类方法或æˆå‘˜ Parent of this class 此类的父 Children of this class 儿童的此类 Files including this file 此文件包括文件 Full path for file 文件的完整路径 Functions or macros inside this file å‡½æ•°æˆ–æ­¤æ–‡ä»¶ä¸­çš„å® CodeQuery DB Files CodeQuery DB 文件 Open CQ database file 打开 CQ æ•°æ®åº“文件 Function Call Graph 函数的调用关系图 Class Inheritance Graph 类继承关系图 If Exact Match is switched off, wildcard searches (* and ?) are supported 如果精确匹é…关掉，通é…符æœç´¢ （* å’Œ?） æ”¯æŒ results found 找到的结果 in progress 在进行中 Cancel å–消 You have to first select an item from the list before pushing the Graph button. 您必须先推图形按钮之å‰ä»Žåˆ—表中选择一个项。 File open error 文件打开错误 Wrong file format é”™è¯¯çš„æ–‡ä»¶æ ¼å¼ Incorrect CQ database version CQ æ•°æ®åº“版本ä¸æ­£ç¡® OK 还行 Unknown Error 未知的错误 codequery-0.18.1/gui/translations/codequery_zh-CHT.ts000066400000000000000000000536531300045745200226070ustar00rootroot00000000000000 DialogGraph Graph 圖 Please wait ... è«‹ç¨å€™ã€‚。。 Zoom Out ç¸®å° Zoom In 放大 Number of levels: 級別數: Save to DOT file å°‡ä¿å­˜åˆ°é»žæª” Save Image ä¿å­˜åœ–åƒ Close 關閉 MainWindow CodeQuery CodeQuery Open Database 打開的資料庫 Auto-complete è‡ªå‹•å®Œæˆ Exact match ç²¾ç¢ºåŒ¹é… File path filter 檔路徑篩é¸å™¨ Filter 篩é¸å™¨ File path filter, wildcard searches (* and ?) are supported 檔路徑篩é¸å™¨ã€ è¬ç”¨å­—å…ƒæœå°‹ （* å’Œ?） æ”¯æ´ Previous search term 以å‰çš„æœç´¢è©ž Next search term 下一個æœç´¢è©ž If Exact Match is switched off, wildcard searches (* and ?) are supported 如果精確匹é…關掉，è¬ç”¨å­—å…ƒæœå°‹ （* å’Œ?） æ”¯æ´ Search æœç´¢ Paste and Search 粘貼並æœç´¢ Draw graph 繪製關係圖 Previous File 以å‰çš„檔 Next File 下一個檔 Open in Editor 在編輯器中打開 Go to selected line 轉到所é¸è¡Œ Reduce font size 減å°å­—é«”å¤§å° Increase font size å¢žåŠ å­—é«”å¤§å° Copy, paste and search 複製〠粘貼和æœç´¢ Symbol search only for paste and search 僅用於粘貼和æœç´¢ç¬¦è™Ÿæœç´¢ Symbol only åªæœ‰ç¬¦è™Ÿ Previous search result in this file 此檔中的上一個æœå°‹çµæžœ Next search result in this file 在此檔中的下一個æœå°‹çµæžœ FilePath:0 FilePath:0 Sort by line number æŒ‰è¡Œè™ŸæŽ’åº Sort by name 按åç¨±æŽ’åº File 檔 Options é¸é … Help 説明 Exit 退出 Open 開放 About 關於 External Editor 外部編輯器 Open CQ Database 打開 CQ 資料庫 Language 語言 About Qt 關於 Qt File Viewer Settings 檔檢視器設置 aboutDialog About CodeQuery 關於 CodeQuery OK é‚„è¡Œ cqDialogGraph Images åœ–åƒ Export Image åŒ¯å‡ºåœ–åƒ File could not be saved! 無法ä¿å­˜æª” ï¼ Export DOT file 出å£é»žæª” fileViewSettingsDialog File Viewer Settings 檔檢視器設置 Font å­—é«” Syntax highlight theme 語法çªå‡ºé¡¯ç¤ºä¸»é¡Œ Tab Width (number of spaces) 標籤寬度 （空格的數é‡ï¼‰ Cancel å–消 OK é‚„è¡Œ fileviewer File not found 找ä¸åˆ°æª” File could not be opened ä¸èƒ½æ‰“開檔 The source file to be viewed is newer than the CodeQuery database file. You are recommended to manually regenerate the CodeQuery database file. è¦æŸ¥çœ‹åŽŸå§‹æª”案是比 CodeQuery 資料庫檔案更新。建議您手動é‡æ–°ç”Ÿæˆçš„ CodeQuery 資料庫檔案。 Cancel å–消 OK é‚„è¡Œ External Editor Configuration 外部編輯器é…ç½® Please enter the path and arguments for the external editor. Replace as follows: 請輸入路徑和åƒæ•¸çš„外部編輯器。替æ›ï¼Œå¦‚下所示： for file path 檔路徑 for line number 為行號 For example: 例如： File could not be opened! ä¸èƒ½æ‰“開檔 ï¼ External editor could not be started. Please check Options! 無法啟動外部編輯器。請檢查é¸é … ï¼ listhandler Symbol 符號 File 檔 Line è¡Œ Preview é è¦½ mainwindow Cancel å–消 OK é‚„è¡Œ Language 語言 Select language: é¸æ“‡èªžè¨€ï¼š searchhandler Symbol 符號 Function or macro definition (Graph available) 函數或å®çš„定義 （Graph 中å¯ç”¨) Class or struct (Graph available) 類或çµæ§‹ （Graph 中å¯ç”¨ï¼‰ Functions calling this function 調用此函數的函數 Functions called by this function 此函å¼å‘¼å«çš„函數 Calls of this function or macro 此函數或å®çš„調用 Class which owns this member or method æ“有此æˆå“¡æˆ–方法的類 Members or methods of this class 此類方法或æˆå“¡ Parent of this class 此類的父 Children of this class 兒童的此類 Files including this file 此檔包括檔 Full path for file 檔的完整路徑 Functions or macros inside this file å‡½æ•¸æˆ–æ­¤æª”ä¸­çš„å® CodeQuery DB Files CodeQuery DB 檔 Open CQ database file 打開 CQ 資料庫檔案 Function Call Graph 函數的調用關係圖 Class Inheritance Graph 類繼承關係圖 If Exact Match is switched off, wildcard searches (* and ?) are supported 如果精確匹é…關掉，è¬ç”¨å­—å…ƒæœå°‹ （* å’Œ?） æ”¯æ´ results found 找到的çµæžœ in progress 在進行中 Cancel å–消 You have to first select an item from the list before pushing the Graph button. 您必須先推圖形按鈕之å‰å¾žæ¸…單中é¸æ“‡ä¸€å€‹é …。 File open error 檔打開錯誤 Wrong file format éŒ¯èª¤çš„æª”æ¡ˆæ ¼å¼ Incorrect CQ database version CQ 資料庫版本ä¸æ­£ç¢º OK é‚„è¡Œ Unknown Error 未知的錯誤 codequery-0.18.1/gui/translations/dolupdate.pl000066400000000000000000000026111300045745200214240ustar00rootroot00000000000000 # lupdate # # This license applies only to this file: # # Copyright (c) 2013 ruben2020 # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to # deal in the Software without restriction, including without limitation the # rights to use, copy, modify, merge, publish, distribute, sublicense, and/or # sell copies of the Software, and to permit persons to whom the Software is # furnished to do so, subject to the following conditions: # # The above copyright notice and this permission notice shall be included in # all copies or substantial portions of the Software. # # THE SOTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR # IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, # FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE # AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER # LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING # FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS # IN THE SOFTWARE. # use strict; my @langfiles; open(FIL, "./tslist.txt"); while() { chomp; if (/\{[ \t]*\"(.+)\"[ \t]*,[ \t]*\"(.+)\"[ \t]*\}/) { push @langfiles, $2; } } close(FIL); foreach(@langfiles) { system("lupdate-qt4 -no-obsolete ../*.cpp ../ui/*.ui -ts ./$_.ts"); } codequery-0.18.1/gui/translations/dowebtranslate.pl000066400000000000000000000046651300045745200224740ustar00rootroot00000000000000 # Automatically web-translate ts files. # # This license applies only to this file: # # Copyright (c) 2013 ruben2020 # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to # deal in the Software without restriction, including without limitation the # rights to use, copy, modify, merge, publish, distribute, sublicense, and/or # sell copies of the Software, and to permit persons to whom the Software is # furnished to do so, subject to the following conditions: # # The above copyright notice and this permission notice shall be included in # all copies or substantial portions of the Software. # # THE SOTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR # IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, # FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE # AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER # LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING # FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS # IN THE SOFTWARE. # use strict; use HTTP::Request::Common qw(POST); use LWP::UserAgent; my @langfiles; open(FIL, "./tslist.txt"); while() { chomp; if (/\{[ \t]*\"(.+)\"[ \t]*,[ \t]*\"(.+)\"[ \t]*\}/) { push @langfiles, $2; } } close(FIL); foreach(@langfiles) { system("lupdate-qt4 -no-obsolete ../*.cpp ../ui/*.ui -ts ./$_.ts"); } my $langout; my $langfil; foreach(@langfiles) { $langfil = "./$_.ts"; if ($_ =~ /codequery\_([A-Za-z0-9-]+)/) {$langout = $1;} if ($langout eq 'en') {next;} print "Web translating $langfil $langout ...\n"; &translatedoc($langfil, $langout); } ############################################# sub translatedoc { my ($fn, $lang) = @_; my $ua = LWP::UserAgent->new(); my $req = POST 'http://maille.tk/translate/index-curl.php', Content_Type => 'multipart/form-data', Content => [ "bingkey" => "689AC7C9ABE8CF4C53B930FE1A0019F73C0C8AB5", "languagein" => "en", "languageout" => $lang, "output" => "pofile", "pofile" => [$fn] ]; my $resp = $ua->request($req); my @respxml; if ($resp->is_success) { open(FILO, ">$fn"); @respxml = split /\n/, $resp->content; $respxml[0] =~ s/^[ \t]*<\?xml/as_string;} } codequery-0.18.1/gui/translations/tslist.txt000066400000000000000000000005351300045745200211740ustar00rootroot00000000000000{"English", "codequery_en" }, {"Deutsch", "codequery_de" }, {"Fran\347ais", "codequery_fr" }, {"Espa\361ol", "codequery_es" }, {"Italiano", "codequery_it" }, {"Bahasa Indonesia", "codequery_id" }, {"Chinese Simplified", "codequery_zh-CHS" }, {"Chinese Traditional", "codequery_zh-CHT" }, {"Japanese", "codequery_ja" }, {"Korean", "codequery_ko" }, codequery-0.18.1/gui/ui/000077500000000000000000000000001300045745200150025ustar00rootroot00000000000000codequery-0.18.1/gui/ui/aboutDialog.ui000066400000000000000000000071001300045745200175710ustar00rootroot00000000000000 aboutDialog 0 0 400 300 0 0 About CodeQuery true 0 0 :/mainwindow/images/logo.png false 0 0 Qt::AlignCenter true true 0 0 true true Qt::Horizontal 40 20 0 0 OK codequery-0.18.1/gui/ui/fileViewSettingsDialog.ui000066400000000000000000000106371300045745200217630ustar00rootroot00000000000000 fileViewSettingsDialog 0 0 423 162 File Viewer Settings true 0 0 Font 0 0 Syntax highlight theme 0 0 Tab Width (number of spaces) 0 0 0 0 0 0 Qt::Horizontal 40 20 0 0 Cancel 0 0 OK comboBoxFont lineEditTabWidth comboBoxTheme codequery-0.18.1/gui/ui/graphDialog.ui000066400000000000000000000141241300045745200175640ustar00rootroot00000000000000 DialogGraph 0 0 999 713 Graph true Please wait ... Qt::AlignCenter true 0 0 979 591 Qt::LeftToRight 1 0 Zoom Out Zoom Out :/mainwindow/images/Zoom_Out.png:/mainwindow/images/Zoom_Out.png 1 0 Zoom In Zoom In :/mainwindow/images/Zoom_In.png:/mainwindow/images/Zoom_In.png Qt::Vertical 5 0 Number of levels: Qt::AlignRight|Qt::AlignTrailing|Qt::AlignVCenter 1 0 0 0 Save to DOT file Save to DOT file Save to DOT file 0 0 Save Image Save Image Save Image 0 0 Close Close Close pushButtonZoomOut pushButtonZoomIn pushButtonSaveDot pushButtonSave pushButtonClose codequery-0.18.1/gui/ui/mainWindow.ui000066400000000000000000000617061300045745200174670ustar00rootroot00000000000000 MainWindow 0 0 967 813 CodeQuery :/mainwindow/images/logo.png:/mainwindow/images/logo.png Open Database Open Database :/mainwindow/images/Database.png:/mainwindow/images/Database.png 24 24 0 0 Qt::RightToLeft QComboBox::AdjustToMinimumContentsLength Qt::Vertical Qt::LeftToRight Auto-complete Qt::Vertical Exact match Qt::Vertical File path filter File path filter Filter true 0 0 File path filter, wildcard searches (* and ?) are supported File path filter, wildcard searches (* and ?) are supported Qt::RightToLeft true QComboBox::NoInsert QComboBox::AdjustToMinimumContentsLength Previous search term Previous search term :/mainwindow/images/Arrow2_Left.png:/mainwindow/images/Arrow2_Left.png 24 24 Next search term Next search term :/mainwindow/images/Arrow2_Right.png:/mainwindow/images/Arrow2_Right.png 24 24 0 0 If Exact Match is switched off, wildcard searches (* and ?) are supported If Exact Match is switched off, wildcard searches (* and ?) are supported true QComboBox::NoInsert QComboBox::AdjustToMinimumContentsLength true Search Search :/mainwindow/images/Search.png:/mainwindow/images/Search.png 24 24 Paste and Search Paste and Search :/mainwindow/images/Clipboard_Paste.png:/mainwindow/images/Clipboard_Paste.png 24 24 false Draw graph Draw graph :/mainwindow/images/Graph.png:/mainwindow/images/Graph.png 24 24 0 0 15 QComboBox::NoInsert QComboBox::AdjustToMinimumContentsLength Qt::Vertical 1 Previous File Previous File :/mainwindow/images/Arrow2_Left.png:/mainwindow/images/Arrow2_Left.png 24 24 Next File Next File :/mainwindow/images/Arrow2_Right.png:/mainwindow/images/Arrow2_Right.png 24 24 Open in Editor Open in Editor :/mainwindow/images/Document2.png:/mainwindow/images/Document2.png 24 24 Go to selected line Go to selected line :/mainwindow/images/Flag.png:/mainwindow/images/Flag.png 24 24 Reduce font size Reduce font size :/mainwindow/images/Text_Minus.png:/mainwindow/images/Text_Minus.png 24 24 Increase font size Increase font size :/mainwindow/images/Text_Plus.png:/mainwindow/images/Text_Plus.png 24 24 Qt::Vertical Copy, paste and search Copy, paste and search :/mainwindow/images/Clipboard_Paste.png:/mainwindow/images/Clipboard_Paste.png 24 24 Symbol search only for paste and search Symbol search only for paste and search Symbol only Qt::Vertical Previous search result in this file Previous search result in this file :/mainwindow/images/Arrow2_Up.png:/mainwindow/images/Arrow2_Up.png 24 24 Next search result in this file Next search result in this file :/mainwindow/images/Arrow2_Down.png:/mainwindow/images/Arrow2_Down.png 24 24 0 0 QFrame::Box QFrame::Sunken FilePath:0 Qt::AlignBottom|Qt::AlignRight|Qt::AlignTrailing Qt::LinksAccessibleByMouse|Qt::TextSelectableByKeyboard|Qt::TextSelectableByMouse Qt::Horizontal 100 QComboBox::NoInsert Sort by line number Sort by name 1 0 4 0 0 0 967 28 File Options Help Exit QAction::QuitRole Open About External Editor Open CQ Database Language About Qt QAction::AboutQtRole File Viewer Settings QsciScintilla QFrame
Qsci/qsciscintilla.h
 pushButtonOpenDB comboBoxDB checkBoxAutoComplete checkBoxExactMatch checkBoxFilter comboBoxFilter pushButtonSearchPrev pushButtonSearchNext comboBoxSearch pushButtonSearch pushButtonClipSearch pushButtonGraph comboBoxQueryType treeWidgetSearchResults pushButtonPrev pushButtonNext pushButtonOpenInEditor pushButtonGoToLine pushButtonTextShrink pushButtonTextEnlarge pushButtonPaste checkBoxSymbolOnly pushButtonUp pushButtonDown checkBoxFilter toggled(bool) comboBoxFilter setEnabled(bool) 675 65 956 68 codequery-0.18.1/gui/winmain.cpp000066400000000000000000000055721300045745200165440ustar00rootroot00000000000000 #ifdef _MSC_VER /* Taken from: https://github.com/jlnr/gosu/blob/master/GosuImpl/WinMain.cpp Copyright (C) 2004-2013 Julian Raschke, Jan Lücker and all contributors. Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. Julian Raschke & contributors http://www.libgosu.org/ */ #include #include #include #include using namespace std; vector splitCmdLine() { vector result; const char* cmdLine = ::GetCommandLineA(); const char* argBegin = 0; bool isQuotedArg = false; while (*cmdLine) { if (*cmdLine == '"') { if (argBegin == 0) { argBegin = cmdLine + 1; isQuotedArg = true; } else if (isQuotedArg) { result.push_back(std::string(argBegin, cmdLine)); argBegin = 0; } } else if (!isspace((unsigned char)*cmdLine) && argBegin == 0) { argBegin = cmdLine; isQuotedArg = false; } else if (isspace((unsigned char)*cmdLine) && argBegin != 0 && !isQuotedArg) { result.push_back(std::string(argBegin, cmdLine + 1)); argBegin = 0; } ++cmdLine; } if (argBegin != 0) result.push_back(argBegin); return result; } int main(int argc, char* argv[]); int WINAPI WinMain(HINSTANCE, HINSTANCE, LPSTR, int) { try { vector arguments = splitCmdLine(); vector argv(arguments.size()); for (unsigned i = 0; i < argv.size(); ++i) argv[i] = const_cast(arguments[i].c_str()); return main(argv.size(), &argv[0]); } catch (const std::exception& e) { ::MessageBoxA(0, e.what(), "Uncaught Exception", MB_OK | MB_ICONERROR); return EXIT_FAILURE; } } #endif codequery-0.18.1/makedb/000077500000000000000000000000001300045745200150245ustar00rootroot00000000000000codequery-0.18.1/makedb/CMakeLists.txt000066400000000000000000000010161300045745200175620ustar00rootroot00000000000000cmake_minimum_required(VERSION 2.8.12) project(CodeQueryDBMaker) #add_definitions( -Wall ) find_package(Sqlite REQUIRED) include_directories( "." ) include_directories( "../querylib" ) include_directories( "${SQLITE_INCLUDE_DIR}" ) set( CQMAKEDB_SRCS sqlbase.cpp csdbheader.cpp csdbparser.cpp cs2sq.cpp ctagread.cpp main.cpp ) add_executable( cqmakedb ${CQMAKEDB_SRCS} ) target_link_libraries( cqmakedb ${SQLITE_LIBRARIES} small_lib ) install(TARGETS cqmakedb RUNTIME DESTINATION bin) codequery-0.18.1/makedb/cs2sq.cpp000066400000000000000000000220361300045745200165660ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ #include "cs2sq.h" #include "small_lib.h" cs2sq::cs2sq() :m_csdbpLastErr(csdbparser::resOK) ,m_buf(NULL) ,m_filesstmt(NULL) ,m_linesstmt(NULL) ,m_callstmt(NULL) ,m_symstmt(NULL) { m_buf = new char[1000]; } cs2sq::~cs2sq() { close_csdb(); close_db(); if (m_buf != NULL) delete[] m_buf; } csdbparser::enResult cs2sq::open_csdb(const char* csdbfn) { return m_csdbp.open_file(csdbfn); } void cs2sq::close_csdb(void) { m_csdbp.close_file(); } csdbparser::enResult cs2sq::test_csdb(void) { csdbparser::enResult res; if (isCSDBFileOpen() == false) return csdbparser::resFILE_NOT_OPEN; if (m_debug) { printf("CSDB base path = %s\nChecking source files...\n", m_csdbp.getBasePath()); } res = m_csdbp.setup_srcfil_read(); if (res != csdbparser::resOK) return res; long int num = 0; std::string s; do { m_csdbp.get_next_srcfil(&s); if (s.length() == 0) break; num++; } while (s.length() > 0); if (m_debug) { printf("Number of source files = %ld\nReading symbols...\n", num); } res = m_csdbp.setup_symbol_read(); if (res != csdbparser::resOK) return res; num = 0; symdata_pack sp; sp.valid = true; while(sp.valid) { res = m_csdbp.get_next_symbol(&sp); if (res != csdbparser::resOK) { if (m_debug) {printf("Error at symbol %ld, retval=%d," " file=%s:%ld\n", num, res, sp.filename.c_str(), sp.line_num);} return res; } if (sp.line_num == -1) continue; // empty line if (sp.valid) num += sp.symbols.size(); } if (m_debug) { printf("Total number of symbols found = %ld\nCSDB file OK!\n",num); } m_csdbp.setDebug(false); return csdbparser::resOK; } cs2sq::enResult cs2sq::open_db(const char* sqldb) { int rc; rc = sqlite3_open_v2(sqldb, &m_db, SQLITE_OPEN_READWRITE | SQLITE_OPEN_CREATE, NULL); if (rc != SQLITE_OK) { sqlite3_close(m_db); return resFILE_ACCESS_ERR; } return resOK; } void cs2sq::close_db(void) { sqlite3_reset(m_filesstmt); sqlite3_reset(m_linesstmt); sqlite3_reset(m_callstmt); sqlite3_reset(m_symstmt); sqlite3_finalize(m_filesstmt); sqlite3_finalize(m_linesstmt); sqlite3_finalize(m_callstmt); sqlite3_finalize(m_symstmt); sqlite3_close(m_db); } cs2sq::enResult cs2sq::setup_tables(void) { std::string s; //enResult res; int rc; if (m_db == NULL) return resOTHER_ERR; if (m_csdbp.isFileOpen() == false) return resOTHER_ERR; s = "PRAGMA synchronous = OFF;"; s+= "PRAGMA journal_mode = OFF;"; s+= "PRAGMA locking_mode = EXCLUSIVE;"; s+= "PRAGMA automatic_index = FALSE;"; s+= "PRAGMA cache_size = 20000;"; s+= "BEGIN;"; s+= "DROP TABLE IF EXISTS symtbl;"; s+= "DROP TABLE IF EXISTS filestbl;"; s+= "DROP TABLE IF EXISTS linestbl;"; s+= "DROP TABLE IF EXISTS calltbl;"; s+= "DROP TABLE IF EXISTS inherittbl;"; s+= "DROP TABLE IF EXISTS configtbl;"; s+= "DROP TABLE IF EXISTS membertbl;"; s+= "DROP INDEX IF EXISTS symNameIdx;"; s+= "DROP INDEX IF EXISTS symName2Idx;"; s+= "DROP INDEX IF EXISTS filePathIdx;"; s+= "DROP INDEX IF EXISTS filePath2Idx;"; s+= "DROP INDEX IF EXISTS callerIDIdx;"; s+= "DROP INDEX IF EXISTS calledIDIdx;"; s+= "DROP INDEX IF EXISTS memberIDIdx;"; s+= "DROP INDEX IF EXISTS groupIDIdx;"; s+= "DROP INDEX IF EXISTS parentIDIdx;"; s+= "DROP INDEX IF EXISTS childIDIdx;"; s+= "DROP INDEX IF EXISTS lines_fileIDIDx;"; s+= "DROP INDEX IF EXISTS lines_linenumIDx;"; s+= "CREATE TABLE configtbl(configKey TEXT, configVal TEXT);"; s+= "CREATE TABLE filestbl(fileID INTEGER PRIMARY KEY ASC, filePath TEXT);"; s+= "CREATE TABLE linestbl(lineID INTEGER PRIMARY KEY ASC, linenum INTEGER, fileID INTEGER, linetext TEXT);"; s+= "CREATE TABLE calltbl(callerID INTEGER, calledID INTEGER);"; s+= "CREATE TABLE inherittbl(parentID INTEGER, childID INTEGER);"; s+= "CREATE TABLE symtbl(symID INTEGER PRIMARY KEY ASC, symName TEXT, symType TEXT, lineID INTEGER);"; s+= "CREATE TABLE membertbl(groupID INTEGER, memberID INTEGER, memberType TEXT);"; s+= "INSERT INTO configtbl VALUES (\"DB_MAJOR_VER\",\"0\");"; s+= "INSERT INTO configtbl VALUES (\"DB_MINOR_VER\",\"1\");"; s+= "INSERT INTO configtbl VALUES (\"DB_BASE_PATH\",\""; s+= m_csdbp.getBasePath(); s+= "\");COMMIT;"; rc=sqlite3_exec(m_db, s.c_str(), NULL, 0, NULL); if (rc != SQLITE_OK) { if (m_debug) printf("SQLErr1: %d, %s\n", rc, sqlite3_errmsg(m_db)); return resSQLError; } return resOK; } cs2sq::enResult cs2sq::add_symbols(void) { enResult res; int rc; if (m_db == NULL) return resOTHER_ERR; if (m_csdbp.isFileOpen() == false) return resOTHER_ERR; m_csdbpLastErr = m_csdbp.setup_symbol_read(); if (m_csdbpLastErr != csdbparser::resOK) return resCSDBPError; rc = prepare_stmt(&m_filesstmt, "INSERT INTO filestbl VALUES (?,?);"); if (rc!=0) return resSQLError; rc = prepare_stmt(&m_linesstmt, "INSERT INTO linestbl VALUES (?,?,?,?);"); if (rc!=0) return resSQLError; rc = prepare_stmt(&m_callstmt, "INSERT INTO calltbl VALUES (?,?);"); if (rc!=0) return resSQLError; rc = prepare_stmt(&m_symstmt, "INSERT INTO symtbl VALUES (?,?,?,?);"); if (rc!=0) return resSQLError; rc=sqlite3_exec(m_db, "BEGIN EXCLUSIVE;", NULL, 0, NULL); if (rc != SQLITE_OK) { if (m_debug) printf("SQLErr13: %d, %s\n", rc, sqlite3_errmsg(m_db)); return resSQLError; } idxcounter fileidx; idxcounter symidx; idxcounter lineidx; std::string current_file = ""; std::string s; symdata_pack sp; sp.valid = true; while(sp.valid) { m_csdbpLastErr = m_csdbp.get_next_symbol(&sp); if (m_csdbpLastErr != csdbparser::resOK) return resCSDBPError; if (sp.valid == false) break; //end of symbols if (sp.line_num == -1) continue; // empty line ++lineidx; if (current_file.compare(sp.filename) != 0) { ++fileidx; current_file = sp.filename; rc=execstmt(m_filesstmt, fileidx.getStr(), current_file.c_str()); if (rc!=0) return resSQLError; } rc=execstmt(m_linesstmt, lineidx.getStr(), sp.line_num_str().c_str(), fileidx.getStr(), sp.line_text_replacetab().c_str()); if (rc!=0) return resSQLError; if (sp.symbols.empty() == false) res = add_symdata(sp.symbols, lineidx.getStr(), &symidx); if (res != resOK) return res; } return resOK; } cs2sq::enResult cs2sq::add_symdata(symdatalist sdlist, const char* lineid, idxcounter* idx) { //enResult res; symdatalist::iterator it; char smallstr[2]; int rc; smallstr[1] = 0; // NULL-terminated for (it = sdlist.begin(); it < sdlist.end(); it++) { ++(*idx); smallstr[0] = it->getTypeChar(); rc=execstmt(m_symstmt, idx->getStr(), it->symbname.c_str(), smallstr, lineid); if (rc!=0) return resSQLError; if ((it->sym_type != sym_data::symMacroDef)&& (it->sym_type != sym_data::symFuncCall)&& (it->sym_type != sym_data::symFuncDef)) continue; switch (it->sym_type) { case sym_data::symMacroDef: m_calling_macro.str = it->symbname; m_calling_macro.id = idx->getStr(); break; case sym_data::symFuncDef: m_calling_func.str = it->symbname; m_calling_func.id = idx->getStr(); break; case sym_data::symFuncCall: if ((it->calling_func.empty() == false) &&(m_calling_func.str.compare(it->calling_func) == 0)) { rc=execstmt(m_callstmt, m_calling_func.id.c_str(), idx->getStr()); if (rc!=0) return resSQLError; } if ((it->calling_macro.empty() == false) &&(m_calling_macro.str.compare(it->calling_macro) == 0)) { rc=execstmt(m_callstmt, m_calling_macro.id.c_str(), idx->getStr()); if (rc!=0) return resSQLError; } break; default: break; }; } return resOK; } cs2sq::enResult cs2sq::finalize(void) { int rc=sqlite3_exec(m_db, "COMMIT;", NULL, 0, NULL); if (rc != SQLITE_OK) { if (m_debug) printf("SQLErr14: %d, %s\n", rc, sqlite3_errmsg(m_db)); return resSQLError; } std::string s; s = "BEGIN EXCLUSIVE;"; s += "CREATE INDEX filePathIdx ON filestbl (filePath);"; s += "CREATE INDEX filePath2Idx ON filestbl (filePath COLLATE NOCASE);"; s += "CREATE INDEX callerIDIdx ON calltbl (callerID);"; s += "CREATE INDEX calledIDIdx ON calltbl (calledID);"; s += "CREATE INDEX lines_fileIDIDx ON linestbl (fileID);"; s += "CREATE INDEX lines_linenumIDx ON linestbl (linenum);"; s += "CREATE INDEX symNameIdx ON symtbl (symName, symType);"; s += "CREATE INDEX symName2Idx ON symtbl (symName COLLATE NOCASE, symType COLLATE NOCASE);"; //s += "VACUUM;"; s += "COMMIT;"; rc=sqlite3_exec(m_db, s.c_str(), NULL, 0, NULL); if (rc != SQLITE_OK) { if (m_debug) printf("SQLErr15: %d, %s\n", rc, sqlite3_errmsg(m_db)); return resSQLError; } return resOK; } codequery-0.18.1/makedb/cs2sq.h000066400000000000000000000035741300045745200162410ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ #ifndef CS2SQ_H_CQ #define CS2SQ_H_CQ #include #include #include "sqlbase.h" #include "csdbparser.h" #include "small_lib.h" typedef struct { std::string str; std::string id; } stStrID; typedef std::vector strIDList; class cs2sq : public sqlbase { public: enum enResult { resOK = 0, resSQLError, resCSDBPFileNotOpen, resCSDBPError, resFilenameError, resFILE_ACCESS_ERR, resOTHER_ERR }; cs2sq(); ~cs2sq(); csdbparser::enResult open_csdb(const char* csdbfn); void close_csdb(void); csdbparser::enResult test_csdb(void); enResult open_db(const char* sqldb); void close_db(void); enResult setup_tables(void); enResult add_symbols(void); enResult finalize(void); csdbparser::enResult get_csdbpError(void) {return m_csdbpLastErr;} bool isCSDBFileOpen(void) {return m_csdbp.isFileOpen();} private: char* m_buf; csdbparser m_csdbp; csdbparser::enResult m_csdbpLastErr; stStrID m_calling_func; stStrID m_calling_macro; sqlite3_stmt* m_filesstmt; sqlite3_stmt* m_linesstmt; sqlite3_stmt* m_callstmt; sqlite3_stmt* m_symstmt; enResult add_symdata(symdatalist sdlist, const char* lineid, idxcounter* idx); }; // class cs2sq #endif codequery-0.18.1/makedb/cscommon.h000066400000000000000000000023341300045745200170150ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ #ifndef CSCOMMON_H_CQ #define CSCOMMON_H_CQ #define CSFuncCall '`' #define CSDirectAssgnIncrDecr '=' #define CSClass 'c' #define CSEnum 'e' #define CSOtherGlobal 'g' #define CSLocalFuncBlockDef 'l' #define CSGlobalEnumStructUnion 'm' #define CSFuncParam 'p' #define CSStruct 's' #define CSTypeDef 't' #define CSUnion 'u' #define CSFuncDef '$' #define CSMacroDef '#' #define CSInclude '~' #define CSFile '@' #define CSNoType 'X' #endif // CSCOMMON_H_CQ codequery-0.18.1/makedb/csdbheader.cpp000066400000000000000000000066311300045745200176220ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ // Cscope database header #include "csdbheader.h" #include csdbheader::csdbheader() :m_csdbver(0) ,m_trailer_start(0) { } csdbheader::csdbheader(tStr hdr) :m_csdbver(0) ,m_trailer_start(0) { m_header = hdr; } void csdbheader::set_header(tStr hdr) { m_header = hdr; } void csdbheader::set_header(const char* hdr) { m_header = hdr; } bool csdbheader::parse(void) { size_t pos; m_param_list.clear(); if (m_header.empty()) return false; // Header should be at least 19 bytes long and starts with "cscope " if ((m_header.length() <19)||(m_header.compare(0, strlen("cscope "), "cscope ") != 0)) {return false;} // Get the cscope version used to build the database // Assuming it is 2 digits always m_csdbver = strtol(m_header.substr(7, 2).c_str(), NULL, 10); // Get the trailer start position pos = m_header.find_last_of((char) ' '); m_trailer_start = strtol(m_header.substr(pos + 1).c_str(), NULL, 10); // Get rid of "cscope nn " and trailer start pos m_header = m_header.substr(10, pos - 10); // Get the first position of a param pos = m_header.find((const char*) " -"); // if no params, then whole string is db path if (pos == std::string::npos) { m_base_path = m_header.substr(0); // Trim db path pos = m_base_path.find_last_not_of((char) ' ') + 1; m_base_path = m_base_path.substr(0, pos); // If the last char of base path is \", remove it // Cannot remember why I needed to do this if (*(m_base_path.rbegin()) == '\"') m_base_path.erase(m_base_path.end() - 1); return true; } // Get db path m_base_path = m_header.substr(0, pos); // Get rid of db path m_header = m_header.substr(pos); // Trim db path pos = m_base_path.find_last_not_of((char) ' ') + 1; m_base_path = m_base_path.substr(0, pos); // If the last char of base path is \", remove it // Cannot remember why I needed to do this if (*(m_base_path.rbegin()) == '\"') m_base_path.erase(m_base_path.end() - 1); // Prepare a list of params pos = 0; tStr s; while ((pos != std::string::npos) && (pos < m_header.length())) { pos = m_header.find((char) '-', pos); if (pos != std::string::npos) { pos++; s = m_header.at(pos); m_param_list.push_back(s); } } return true; } long int csdbheader::get_version(void) { return m_csdbver; } tStr csdbheader::get_base_path(void) { return m_base_path; } tVecStr csdbheader::get_param_list(void) { return m_param_list; } long int csdbheader::get_trailer_start(void) { return m_trailer_start; } void csdbheader::print_contents(void) { unsigned int i; printf("Ver= %lu\nPath= \"%s\"\nTrailer start= %lu\nParam list= ", m_csdbver, m_base_path.c_str(), m_trailer_start); for (i=0; i< m_param_list.size(); i++) { printf("\"%s\", ", m_param_list[i].c_str()); } printf("\n\n"); } codequery-0.18.1/makedb/csdbheader.h000066400000000000000000000024061300045745200172630ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ // Cscope database header #ifndef CSDBHEADER_H #define CSDBHEADER_H #include "small_lib.h" class csdbheader { public: csdbheader(); csdbheader(tStr hdr); void set_header(tStr hdr); void set_header(const char* hdr); bool parse(void); long int get_version(void); tStr get_base_path(void); tVecStr get_param_list(void); long int get_trailer_start(void); void print_contents(void); tStr m_header; long int m_csdbver; tStr m_base_path; tVecStr m_param_list; long int m_trailer_start; }; // class csdbheader #endif // CSDBHEADER_H codequery-0.18.1/makedb/csdbparser.cpp000066400000000000000000000326671300045745200176760ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ // Cscope database parser #include //#include #include "csdbparser.h" #include "csdbheader.h" #include "small_lib.h" //#include "packtext.h" #define CSDBP_GENERAL_CHK() if ((m_fp == NULL) || \ (m_trailer_start <= 0) || \ (m_buf == NULL)) \ {return resOTHER_ERR;} typedef struct { int chr; sym_data::enSymType type; const char* desc; } chr2enum; static const chr2enum symbtypetbl[] = { {'`', sym_data::symFuncCall, "FuncCall"}, {'=', sym_data::symDrctAssgnIncrDecr, "DirectAssgnIncrDecr"}, {'c', sym_data::symClass, "Class"}, {'e', sym_data::symEnum, "Enum"}, {'g', sym_data::symGlobal, "OtherGlobal"}, {'l', sym_data::symLocalFuncBlockDef, "LocalFuncBlockDef"}, {'m', sym_data::symGlobalEnumStructUnion, "GlobalEnumStructUnion"}, {'p', sym_data::symFuncParam, "FuncParam"}, {'s', sym_data::symStruct, "Struct"}, {'t', sym_data::symTypeDef, "TypeDef"}, {'u', sym_data::symUnion, "Union"}, {'$', sym_data::symFuncDef, "FuncDef"}, {'#', sym_data::symMacroDef, "MacroDef"}, {'~', sym_data::symIncl, "Include"}, {'@', sym_data::symFile, "File"}, {'X', sym_data::symNone, "NoType"} }; #define symbtypetbl_SIZE (sizeof(symbtypetbl)/sizeof(chr2enum)) // sym_data /////////////////////////////////////////////////// sym_data::sym_data() :valid(false) ,sym_type(symNone) { } sym_data::sym_data(const sym_data& copy) { valid = copy.valid; symbname = copy.symbname; sym_type = copy.sym_type; calling_func = copy.calling_func; calling_macro = copy.calling_macro; } sym_data& sym_data::operator= (const sym_data& copy) { if (this != ©) { valid = copy.valid; symbname = copy.symbname; sym_type = copy.sym_type; calling_func = copy.calling_func; calling_macro = copy.calling_macro; } return *this; } void sym_data::clear(void) { valid = false; symbname.clear(); sym_type = symNone; calling_func.clear(); calling_macro.clear(); } std::string sym_data::symbname_escaped(void) { return add_escape_char(symbname, '"', '"'); } const char* sym_data::getTypeDesc(void) { for (int i=0; i(symbtypetbl[i].chr); } } return '\0'; } // symdata_pack /////////////////////////////////////////////////// symdata_pack::symdata_pack() :valid(false) ,line_num(0) { } symdata_pack::symdata_pack(const symdata_pack& copy) { valid = copy.valid; filename = copy.filename; line_num = copy.line_num; line_text = copy.line_text; symbols = copy.symbols; } symdata_pack& symdata_pack::operator= (const symdata_pack& copy) { if (this != ©) { valid = copy.valid; filename = copy.filename; line_num = copy.line_num; line_text = copy.line_text; symbols = copy.symbols; } return *this; } void symdata_pack::clear(void) { valid = false; filename.clear(); line_num = 0; line_text.clear(); symbols.clear(); } std::string symdata_pack::line_num_str(void) { char str[30]; sprintf(str, "%ld", line_num); std::string s(str); return s; } std::string symdata_pack::line_text_escaped(void) { return add_escape_char(line_text.substr(0, 80) , '"', '"'); } std::string symdata_pack::line_text_replacetab(void) { std::string s; unsigned int i; unsigned int n = line_text.length(); for (i=0; i < n; i++) { if (line_text[i] == '\t') s += ' '; else s += line_text[i]; } s = s.substr(0, 80); return s; } std::string symdata_pack::line_text_blob(void) { tempbuf buf(20000); strcpy(buf.get(), line_text.substr(0, 80).c_str()); //packtext(buf.get(), true); std::string s(buf.get()); return s; } // csdbparser /////////////////////////////////////////////////// csdbparser::csdbparser() : m_fp(NULL) ,m_buf(NULL) ,m_state(stIDLE) ,m_trailer_start(0) ,m_bufsize(0) ,m_debug(false) { } csdbparser::~csdbparser() { close_file(); } const char* csdbparser::getBasePath(void) { return m_base_path.c_str(); } void csdbparser::setDebug(bool val) { m_debug = val; } void csdbparser::create_buf(int size) { if (size >= CSDBP_MINIM_BUFSIZE) { destroy_buf(); m_buf = new char[size]; *m_buf = 0; m_bufsize = size; } } void csdbparser::destroy_buf(void) { if (m_buf != NULL) { delete[] m_buf; m_buf = NULL; m_bufsize = 0; } } csdbparser::enResult csdbparser::open_file(const char *fn) { enResult res = file_sanity_check(fn); if (res != resOK) {return res;} close_file(); m_fp = fopen(fn, "r"); res = parse_headers(); if (res != resOK) {close_file();} return res; } void csdbparser::close_file(void) { if (m_fp != NULL) { fclose(m_fp); m_fp = NULL; } m_trailer_start = 0; destroy_buf(); m_base_path.clear(); m_calling_func.clear(); m_calling_macro.clear(); m_current_srcfile.clear(); } csdbparser::enResult csdbparser::file_sanity_check(const char *fn) { smartFILE fp; tempbuf buf(20000); unsigned int i; std::string s; bool chkok; // Does the file exist? if (check_fileExists(fn) == false) {return resFILE_NOT_FOUND;} // Try to open the file for reading fp = fopen(fn, "r"); if (fp == NULL) {return resFILE_ACCESS_ERR;} // Read out the first line i.e. the header if (fgets(buf.get(), 20000, fp.get()) == NULL) {return resFILE_ACCESS_ERR;} chomp(buf.get()); s = static_cast(buf.get()); csdbheader hdr; hdr.set_header(s); if (hdr.parse() == false) {return resUNRECOG_FORMAT;} // Compare the cscope version used to build the database if (hdr.get_version() != CSDBP_SUPPORTED_VER_NUM) {return resINCORRECT_VER;} // Compare the parameters used to build the database with the supported one // We must have "c", we don't mind "q" and we cannot have any other chkok = false; tVecStr vs = hdr.get_param_list(); for(i=0; i< vs.size(); i++) { if (vs[i].compare("c") == 0) chkok = true; } if (chkok == false) {return resUNSUPPORTED_PARAM;} for(i=0; i< vs.size(); i++) { if ((vs[i].compare("c") != 0) && (vs[i].compare("q") != 0)) chkok = false; } if (chkok == false) {return resUNSUPPORTED_PARAM;} // Trailer offset should be a positive number, normally > 20 if (hdr.get_trailer_start() < 20) {return resUNRECOG_FORMAT;} // Header looks OK so far! return resOK; } csdbparser::enResult csdbparser::parse_headers(void) { int slen; if (m_fp == NULL) {return resFILE_NOT_OPEN;} create_buf(); m_base_path.clear(); m_calling_func.clear(); m_calling_macro.clear(); m_current_srcfile.clear(); csdbheader hdr; // Read out the first line i.e. the header if (fgets(m_buf, CSDBP_MINIM_BUFSIZE, m_fp) == NULL) {return resFILE_ACCESS_ERR;} slen = strlen(chomp(m_buf)); std::string s(static_cast(m_buf)); hdr.set_header(s); if (hdr.parse() == false) {return resUNRECOG_FORMAT;} m_trailer_start = hdr.get_trailer_start(); m_base_path = hdr.get_base_path(); return resOK; } csdbparser::enResult csdbparser::setup_srcfil_read(void) { CSDBP_GENERAL_CHK(); long int num; if (fseek(m_fp, m_trailer_start, SEEK_SET) != 0) {return resFILE_ACCESS_ERR;} fscanf(m_fp, "%ld\n", &num); // number of source directories while (num-- > 0) {fgets(m_buf, CSDBP_MINIM_BUFSIZE, m_fp);} fscanf(m_fp, "%ld\n", &num); // number of include directories while (num-- > 0) {fgets(m_buf, CSDBP_MINIM_BUFSIZE, m_fp);} fscanf(m_fp, "%ld\n", &num); // number of files fscanf(m_fp, "%ld\n", &num); // string size required create_buf(num); return resOK; } csdbparser::enResult csdbparser::get_next_srcfil(std::string* srcfil) { CSDBP_GENERAL_CHK(); if (ftell(m_fp) < m_trailer_start) setup_srcfil_read(); if (fgets(m_buf, m_bufsize, m_fp) != NULL) *srcfil = chomp(m_buf); else srcfil->clear(); return resOK; } csdbparser::enResult csdbparser::setup_symbol_read(void) { CSDBP_GENERAL_CHK(); rewind(m_fp); if (fgets(m_buf, m_bufsize, m_fp) == NULL) {return resFILE_ACCESS_ERR;} m_calling_func.clear(); m_calling_macro.clear(); m_current_srcfile.clear(); //m_state = stSYMB_SETUP_DONE; return resOK; } csdbparser::enResult csdbparser::get_next_symbol(symdata_pack* pack) { CSDBP_GENERAL_CHK(); enResult res; bool endOfSymbData; bool foundSomething; int ch; //if (m_state != stSYMB_SETUP_DONE) return resUNKNOWN_ERR; pack->clear(); if (m_debug) printf("=====> get_next_symbol\n"); do { res = single_line_symbol(endOfSymbData, foundSomething); if (res != resOK) return res; if (endOfSymbData) { pack->valid = false; if (m_debug) printf("End of symbols data!\n"); return resOK; } } while (foundSomething); pack->valid = true; pack->filename = m_current_srcfile; if (m_debug) printf("=====> Back from get_next_symbol\n"); ch = fgetc(m_fp); if (ch == 0x0A) { pack->line_num = -1; // empty line return resOK; //EOL } else ungetc(ch, m_fp); if (fscanf(m_fp, "%ld", &(pack->line_num)) != 1) { return resUNKNOWN_ERR; } ch = fgetc(m_fp); // the space after the line number if (fgets(m_buf, m_bufsize, m_fp) == NULL) {return resFILE_ACCESS_ERR;} pack->line_text = chomp(m_buf); if (m_debug) {printf("fn = %s, lineno=%ld, firstline=%s\n", pack->filename.c_str(), pack->line_num, pack->line_text.c_str());} int loopcheck = 0; // prevent infinite loop sym_data sd; while(loopcheck++ < 65500) { // symbol line ch = fgetc(m_fp); if ((ch == 0x0A)&&(loopcheck > 1)) { break; //EOL } else if ((ch >= 0x30)&&(ch <= 0x39)&&(loopcheck > 1)) { ungetc(ch, m_fp); break; // symbol shouldn't start with line numbers } else { ungetc(ch, m_fp); res = symbolread(&sd, pack); if (res != resOK) return res; pack->line_text += sd.symbname; if (sd.valid) {pack->symbols.push_back(sd);} } // no-symbol line ch = fgetc(m_fp); if ((ch == 0x0A)&&(loopcheck > 1)) {;} else { ungetc(ch, m_fp); if (fgets(m_buf, m_bufsize, m_fp) == NULL) {return resFILE_ACCESS_ERR;} pack->line_text += chomp(m_buf); } } return resOK; } csdbparser::enResult csdbparser::single_line_symbol(bool& endOfSymbData, bool& foundSomething) { if (m_debug) printf("=====> single_line_symbol\n"); endOfSymbData = false; foundSomething = false; int ch; ch = fgetc(m_fp); if (m_debug) printf("check1! %c\n", (char)ch); if (ch == 9) // TAB { ch = fgetc(m_fp); foundSomething = true; if (m_debug) printf("check2! %c\n", (char)ch); switch(ch) { case '@': // start of a new file if (fgets(m_buf, m_bufsize, m_fp) == NULL) return resFILE_ACCESS_ERR; m_current_srcfile = chomp(m_buf); if (m_debug) printf("New file=%s\n", m_buf); endOfSymbData = m_current_srcfile.empty(); break; case ')': // end of a definition if (m_calling_macro.size() > 0) m_calling_macro.clear(); else if (m_debug) printf("no macro to clear!\n"); if (fgets(m_buf, m_bufsize, m_fp) == NULL) {return resFILE_ACCESS_ERR;} break; default: return resUNKNOWN_ERR; }; fgets(m_buf, m_bufsize, m_fp); // empty line } else ungetc(ch, m_fp); return resOK; } csdbparser::enResult csdbparser::symbolread(sym_data *data, symdata_pack* pack) { if (m_debug) printf("=====> symbolread\n"); int ch, ch2; data->clear(); data->valid = true; data->sym_type = sym_data::symNone; ch = fgetc(m_fp); if (m_debug) printf("check3! %c\n", (char)ch); if (ch == 9) // TAB { ch = fgetc(m_fp); if (m_debug) printf("check4! %c\n", (char)ch); switch(ch) { case '}': // end of func if (m_calling_func.size() > 0) m_calling_func.clear(); else if (m_debug) printf("no func to clear!\n"); data->valid = false; if (m_debug) printf("End of func found\n"); break; case ')': // end of macro if (m_calling_macro.size() > 0) m_calling_macro.clear(); else if (m_debug) printf("no macro to clear!\n"); data->valid = false; if (m_debug) printf("End of macro found\n"); break; case '~': // include ch2 = fgetc(m_fp); if ((ch2 == '"')||(ch2 == '<')) { pack->line_text += (char) ch2; } else { ungetc(ch2, m_fp); } data->sym_type = sym_data::symIncl; if (m_debug) printf("Incl found\n"); break; default: for (int i=0; isym_type = symbtypetbl[i].type; break; } } if (data->sym_type == sym_data::symNone) return resUNKNOWN_ERR; break; }; } else ungetc(ch, m_fp); if (fgets(m_buf, m_bufsize, m_fp) == NULL) {return resFILE_ACCESS_ERR;} data->symbname = chomp(m_buf); if (data->valid) data->valid = (strlen(data->symbname.c_str()) > 0); if (m_debug) printf("sym name=%s, type = %s, valid=%d, ch=%c\n", data->symbname.c_str(), data->getTypeDesc(), data->valid, ch); if (ch == '$') {m_calling_func.assign(data->symbname);} else if (ch == '#') {m_calling_macro.assign(data->symbname);} else if (ch == '`') { data->calling_func = m_calling_func; data->calling_macro = m_calling_macro; } return resOK; } codequery-0.18.1/makedb/csdbparser.h000066400000000000000000000073251300045745200173340ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ // Cscope database parser #ifndef CSDBPARSER_H_CQ #define CSDBPARSER_H_CQ #include #include #include #include #include #include #define CSDBP_MINIM_BUFSIZE (20000) #define CSDBP_SUPPORTED_VER "15" #define CSDBP_SUPPORTED_VER_NUM (15) #define CSDBP_SUP_PARAM " -c " #define CSDBP_SUP_PARAM2 " -c " typedef std::vector strvect; // sym_data /////////////////////////////////////////////////// class sym_data { public: enum enSymType { symNone = 0, symFuncDef, symFuncCall, symMacroDef, symIncl, symDrctAssgnIncrDecr, symClass, symEnum, symGlobal, symLocalFuncBlockDef, symGlobalEnumStructUnion, symFuncParam, symStruct, symTypeDef, symUnion, symFile }; sym_data(); sym_data(const sym_data& copy); sym_data& operator= (const sym_data& copy); ~sym_data() { /* nothing to do */ } void clear(void); std::string symbname_escaped(void); const char* getTypeDesc(void); const char getTypeChar(void); bool valid; std::string symbname; enSymType sym_type; std::string calling_func; std::string calling_macro; }; // class sym_data typedef std::vector symdatalist; // symdata_pack /////////////////////////////////////////////////// class symdata_pack { public: bool valid; std::string filename; long int line_num; std::string line_text; symdatalist symbols; symdata_pack(); symdata_pack(const symdata_pack& copy); symdata_pack& operator= (const symdata_pack& copy); ~symdata_pack() { /* nothing to do */ } void clear(void); std::string line_num_str(void); std::string line_text_escaped(void); std::string line_text_blob(void); std::string line_text_replacetab(void); }; // class symdata_pack // csdbparser /////////////////////////////////////////////////// class csdbparser { public: enum enResult { resOK = 0, resFILE_NOT_FOUND, resFILE_ACCESS_ERR, resUNRECOG_FORMAT, resINCORRECT_VER, resUNSUPPORTED_PARAM, resOTHER_ERR, resUNKNOWN_ERR, resFILE_NOT_OPEN }; enum enState { stIDLE = 0, stSYMB_SETUP_DONE }; csdbparser(); ~csdbparser(); enResult open_file(const char *fn); bool isFileOpen(void) {return (m_fp != NULL);} void close_file(void); static enResult file_sanity_check(const char *fn); enResult setup_srcfil_read(void); enResult get_next_srcfil(std::string* srcfil); enResult setup_symbol_read(void); enResult get_next_symbol(symdata_pack* pack); const char* getBasePath(void); void setDebug(bool val); private: FILE *m_fp; char *m_buf; long int m_bufsize; enState m_state; long int m_trailer_start; std::string m_base_path; std::string m_calling_func; std::string m_calling_macro; std::string m_current_srcfile; bool m_debug; void create_buf(int size = CSDBP_MINIM_BUFSIZE); void destroy_buf(void); enResult parse_headers(void); enResult single_line_symbol(bool& endOfSymbData, bool& foundSomething); enResult symbolread(sym_data* data, symdata_pack* pack); }; // class csdbparser #endif //CSDBPARSER_H_CQ codequery-0.18.1/makedb/ctagread.cpp000066400000000000000000000235761300045745200173170ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ #include "ctagread.h" #include "small_lib.h" ctagread::ctagread() :f_tags(NULL) ,m_insertstmt(NULL) ,m_insertinheritstmt(NULL) ,m_readclassstmt(NULL) ,m_readsymstmt(NULL) ,m_writedeststmt(NULL) ,m_readsymfstmt(NULL) { } ctagread::~ctagread() { close_files(); } ctagread::enResult ctagread::open_files(const char* sqldb, const char* tagsfn) { int rc; f_tags = fopen(tagsfn, "r"); if (f_tags == NULL) return resFILE_ACCESS_ERR; rc = sqlite3_open_v2(sqldb, &m_db, SQLITE_OPEN_READWRITE, NULL); if (rc != SQLITE_OK) { sqlite3_close(m_db); return resFILE_ACCESS_ERR; } rc=sqlite3_exec(m_db, "PRAGMA synchronous = OFF;" "PRAGMA journal_mode = OFF;" "PRAGMA locking_mode = EXCLUSIVE;" "PRAGMA automatic_index = FALSE;" "PRAGMA cache_size = 20000;", NULL, 0, NULL); if (rc != SQLITE_OK) return resSQLError; return resOK; } void ctagread::close_files(void) { sqlite3_reset(m_insertstmt); sqlite3_reset(m_insertinheritstmt); sqlite3_reset(m_readclassstmt); sqlite3_reset(m_readsymstmt); sqlite3_reset(m_writedeststmt); sqlite3_reset(m_readsymfstmt); sqlite3_finalize(m_insertstmt); sqlite3_finalize(m_insertinheritstmt); sqlite3_finalize(m_readclassstmt); sqlite3_finalize(m_readsymstmt); sqlite3_finalize(m_writedeststmt); sqlite3_finalize(m_readsymfstmt); m_insertstmt = NULL; m_readclassstmt = NULL; m_readsymstmt = NULL; m_writedeststmt = NULL; m_readsymfstmt = NULL; fclose(f_tags); f_tags = NULL; sqlite3_close(m_db); } ctagread::enResult ctagread::prepare_cqdb(void) { int rc; rc = prepare_stmt(&m_insertstmt, "INSERT INTO membertbl VALUES (?,?,?);"); if (rc != SQLITE_OK) return resSQLError; rc = prepare_stmt(&m_insertinheritstmt, "INSERT INTO inherittbl VALUES (?,?);"); if (rc != SQLITE_OK) return resSQLError; rc = prepare_stmt(&m_readclassstmt, "SELECT symID FROM symtbl WHERE symName=? AND symType=\"c\";"); if (rc != SQLITE_OK) return resSQLError; //rc = prepare_stmt(&m_readsymstmt, "SELECT symID FROM symtbl WHERE symName=? AND lineid IN (SELECT lineID FROM linestbl WHERE linenum=? AND fileid IN (SELECT fileID FROM filestbl WHERE filePath LIKE ?));"); rc = prepare_stmt(&m_readsymstmt, "SELECT symtbl.symID FROM symtbl INNER JOIN linestbl ON (symtbl.symName=? AND symtbl.lineID = linestbl.lineID AND linestbl.linenum=?) INNER JOIN filestbl ON (linestbl.fileID = filestbl.fileID AND filePath LIKE ?);"); if (rc != SQLITE_OK) return resSQLError; rc = prepare_stmt(&m_writedeststmt, "UPDATE symtbl SET symName=? WHERE symID=?;"); if (rc != SQLITE_OK) return resSQLError; //rc = prepare_stmt(&m_readsymfstmt, "SELECT symID FROM symtbl WHERE symName=? AND symType=\"$\" AND lineid IN (SELECT lineID FROM linestbl WHERE linenum=? AND fileid IN (SELECT fileID FROM filestbl WHERE filePath LIKE ?));"); rc = prepare_stmt(&m_readsymfstmt, "SELECT symtbl.symID FROM symtbl INNER JOIN linestbl ON (symtbl.symName=? AND symtbl.symType=\"$\" AND symtbl.lineID = linestbl.lineID AND linestbl.linenum=?) INNER JOIN filestbl ON (linestbl.fileID = filestbl.fileID AND filePath LIKE ?);"); if (rc != SQLITE_OK) return resSQLError; rc=sqlite3_exec(m_db, "BEGIN EXCLUSIVE;" "DROP INDEX IF EXISTS memberIDIdx;" "DROP INDEX IF EXISTS groupIDIdx;" "DROP INDEX IF EXISTS parentIDIdx;" "DROP INDEX IF EXISTS childIDIdx;" "DELETE FROM membertbl;" "DELETE FROM inherittbl;" "COMMIT;", NULL, 0, NULL); if (rc != SQLITE_OK) { if (m_debug) printf("SQLErr13: %d, %s\n", rc, sqlite3_errmsg(m_db)); return resSQLError; } return resOK; } ctagread::enResult ctagread::process_ctags(void) { tempbuf sym(400), fil(500), classname(400), classname2(400); tempbuf numtxt(50), linetxt(4001), fil2(500); long int num; int numOfLines=0; int numOfLines2=0; char* retval; int scanretval = 0; int rc; char c; char smallstr[2]; char *cp; strctagIDList classIDs, symIDs, parentClassIDs, parentClassIDs_temp; enResult res; std::vector listClsHist; bool result; *(fil.get()) = '%'; // for SQL LIKE pattern recognition smallstr[1] = 0; res = prepare_cqdb(); if (res != resOK) return res; do{ retval = fgets(linetxt.get(), linetxt.size() - 1, f_tags); if (retval != NULL) { chomp(linetxt.get()); scanretval = sscanf(linetxt.get(), "%s\t%s\t%ld;\"\t%c\tclass:%s", sym.get(), fil2.get(), &num, &c, classname.get()); } if ((retval != NULL)&&(scanretval == 5)) { strcpy(fil.get(), "%"); strcat(fil.get(), extract_filename(fil2.get())); res = getHListOfClassIDs(&classIDs, get_last_part(classname.get(), '.'), &listClsHist); if (res != resOK) return res; if (classIDs.empty()) continue; cp = sym.get(); if (*(sym.get()) == '~') { cp = (sym.get()) + 1; //include destructors // which cscope missed out } sprintf(numtxt.get(), "%ld", num); if (c == 'f') res = getListOfSymIDs(m_readsymfstmt, &symIDs, cp, numtxt.get(), fil.get()); else res = getListOfSymIDs(m_readsymstmt, &symIDs, cp, numtxt.get(), fil.get()); if (res != resOK) {return res;} if (symIDs.empty() == false) { for (unsigned int i=0; i < symIDs.size(); i++) { smallstr[0] = c; rc=execstmt(m_insertstmt, classIDs[0].c_str(), symIDs[i].c_str(), smallstr); if (rc!=0) return resSQLError; if (*(sym.get()) == '~') { rc=execstmt(m_writedeststmt, sym.get(), symIDs[i].c_str()); if (rc!=0) return resSQLError; } numOfLines++; } } //else {if (m_debug) {printf("no match found for symbol: %s\n",sym.get());}} } else if (retval != NULL) { scanretval = sscanf(linetxt.get(), "%s\t%s\t%ld;\"\t%c\tinherits:%s", sym.get(), fil2.get(), &num, &c, classname.get()); result = ((scanretval == 5)&&(c == 'c')); if (!result) { scanretval = sscanf(linetxt.get(), "%s\t%s\t%ld;\"\t%c\tfile:\tinherits:%s", sym.get(), fil2.get(), &num, &c, classname.get()); result = ((scanretval == 5)&&(c == 'c')); } if (!result) { scanretval = sscanf(linetxt.get(), "%s\t%s\t%ld;\"\t%c\tclass:%s\tinherits:%s", sym.get(), fil2.get(), &num, &c, classname2.get(), classname.get()); result = ((scanretval == 6)&&(c == 'c')); } if (result) { res = getHListOfClassIDs(&classIDs, sym.get(), &listClsHist); if (res != resOK) return res; if (classIDs.empty()) continue; parentClassIDs.clear(); parentClassIDs_temp.clear(); std::vector vecstr = splitstr(classname.get(), ','); for (unsigned int i=0; i *listClsHist) { enResult res = resOK; idlist->clear(); for (unsigned int i=0; isize(); i++) { if ((*listClsHist)[i].cls.compare(v1) == 0) {idlist->push_back((*listClsHist)[i].id); break;} } if (idlist->empty()) { res = getListOfClassIDs(idlist, v1); if (res != resOK) {return res;} if (idlist->empty() == false) { stClsID tempClsID; tempClsID.cls = v1; tempClsID.id = (*idlist)[0]; (*listClsHist).insert((*listClsHist).begin(), tempClsID); if ((*listClsHist).size() > 50) (*listClsHist).pop_back(); } } return resOK; } ctagread::enResult ctagread::getListOfClassIDs(strctagIDList* idlist, const char* v1) { int rc; std::string s; idlist->clear(); rc = execstmt(m_readclassstmt, v1); while ((rc == SQLITE_ROW)||(rc == SQLITE_BUSY)) { if (rc == SQLITE_ROW) { s = (const char*) sqlite3_column_text(m_readclassstmt, 0); idlist->push_back(s); } rc = sqlite3_step(m_readclassstmt); } return resOK; } ctagread::enResult ctagread::getListOfSymIDs(sqlite3_stmt* pstmt, strctagIDList* idlist, const char* v1, const char* v2, const char* v3) { int rc; std::string s; idlist->clear(); rc = execstmt(pstmt, v1, v2, v3); while ((rc == SQLITE_ROW)||(rc == SQLITE_BUSY)) { if (rc == SQLITE_ROW) { s = (const char*) sqlite3_column_text(pstmt, 0); idlist->push_back(s); } rc = sqlite3_step(pstmt); } return resOK; } ctagread::enResult ctagread::finalize(void) { int rc; std::string s; s = "BEGIN EXCLUSIVE;"; s += "CREATE INDEX groupIDIdx ON membertbl (groupID);"; s += "CREATE INDEX memberIDIdx ON membertbl (memberID);"; s += "CREATE INDEX parentIDIdx ON inherittbl (parentID);"; s += "CREATE INDEX childIDIdx ON inherittbl (childID);"; s += "REINDEX symNameIdx;"; s += "REINDEX symName2Idx;"; s += "COMMIT;"; rc=sqlite3_exec(m_db, s.c_str(), NULL, 0, NULL); if (rc != SQLITE_OK) { if (m_debug) printf("SQLErr15: %d, %s\n", rc, sqlite3_errmsg(m_db)); return resSQLError; } return resOK; } codequery-0.18.1/makedb/ctagread.h000066400000000000000000000037551300045745200167610ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ #ifndef CTAGREAD_H_CQ #define CTAGREAD_H_CQ #include #include #include #include #include #include #include #include "sqlbase.h" typedef std::vector strctagIDList; typedef struct { std::string cls; std::string id; } stClsID; class ctagread : public sqlbase { public: enum enResult { resOK = 0, resSQLError, resFILE_NOT_FOUND, resFILE_ACCESS_ERR, resUNRECOG_FORMAT, resINCORRECT_VER, resUNSUPPORTED_PARAM, resOTHER_ERR, resUNKNOWN_ERR, resFILE_NOT_OPEN }; ctagread(); ~ctagread(); enResult open_files(const char* sqldb, const char* tagsfn); void close_files(void); enResult process_ctags(void); enResult finalize(void); private: FILE* f_tags; sqlite3_stmt* m_insertstmt; sqlite3_stmt* m_insertinheritstmt; sqlite3_stmt* m_readclassstmt; sqlite3_stmt* m_readsymstmt; sqlite3_stmt* m_readsymfstmt; sqlite3_stmt* m_writedeststmt; enResult getListOfClassIDs(strctagIDList* idlist, const char* v1); enResult getHListOfClassIDs(strctagIDList* idlist, const char* v1, std::vector *listClsHist); enResult getListOfSymIDs(sqlite3_stmt* pstmt, strctagIDList* idlist, const char* v1, const char* v2, const char* v3); enResult prepare_cqdb(void); }; #endif codequery-0.18.1/makedb/main.cpp000066400000000000000000000166571300045745200164730ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ #include #include "getopt2.h" #include "csdbparser.h" #include "cs2sq.h" #include "ctagread.h" #include "small_lib.h" #include "swver.h" #if 0 // test code for csdbparser - not needed int test_csdbparser (void) { csdbparser csdbp; std::string s; long int num = 0; csdbparser::enResult res; //csdbp.setDebug(true); int k = csdbparser::file_sanity_check("./cscope.out"); printf("%d\n",k); csdbp.open_file("./cscope.out"); //csdbp.setup_srcfil_read(); do { csdbp.get_next_srcfil(&s); if (s.length() == 0) break; num++; //printf("\"%s\"\n",s.data()); } while (s.length() > 0); printf("Total num of files = %ld\nBase path = %s\n\n", num, csdbp.getBasePath()); num = 0; res = csdbp.setup_symbol_read(); if (res != csdbparser::resOK) printf("Error in setup_symbol_read: %d\n", res); symdata_pack sp; sp.valid = true; while(sp.valid) { res = csdbp.get_next_symbol(&sp); if (res != csdbparser::resOK) { printf("Error in get_next_symbol: %d\n", res); break; } if (sp.valid) { printf("[[ %s, linenum=%ld, symbols=%d, \"%s\" ]]\n", sp.filename.c_str(), sp.line_num, sp.symbols.size(), sp.line_text.c_str()); if (sp.symbols.size() > 0) { for (int i=0; i < sp.symbols.size(); i++) { printf("{%s, %s", sp.symbols[i].symbname.c_str(), sp.symbols[i].getTypeDesc()); if (sp.symbols[i].sym_type == sym_data::symFuncCall) printf(", func[%s], macro[%s]", sp.symbols[i].calling_func.c_str(), sp.symbols[i].calling_macro.c_str()); printf("} "); } printf("\n"); } num += sp.symbols.size(); } } printf("Total number of symbols found = %ld\n",num); } #endif int process_cscope(const char* cscopefn, const char* sqfn, bool debug) { cs2sq::enResult res; cs2sq dbmaker; dbmaker.setDebug(debug); int k = csdbparser::file_sanity_check(cscopefn); printf("cscope.out sanity check %s\n",(k==csdbparser::resOK ? "OK" : "Error")); if (k == csdbparser::resUNSUPPORTED_PARAM) printf("Unsupported cscope parameters: -c is required. -q, -b and -R are optional. The rest should not be used.\n"); if (k != csdbparser::resOK) return 1; dbmaker.open_csdb(cscopefn); k = dbmaker.test_csdb(); printf("cscope.out detailed check %s\n",(k==0 ? "OK" : "Error")); if (k != 0) { printf("Please note that assembly code embedded in C/C++ files is unsupported.\n" "This might be the cause for this error.\n" "Please use the -d (for debug) argument to get more info.\n"); return 1; } remove(sqfn); res = dbmaker.open_db(sqfn); if (res != cs2sq::resOK) {printf("Error1! %d\n",res); return 1;} res = dbmaker.setup_tables(); if (res != cs2sq::resOK) {printf("Error2! %d\n",res); return 1;} printf("Adding symbols ...\n"); res = dbmaker.add_symbols(); if (res != cs2sq::resOK) {printf("Error3! %d\n",res); return 1;} printf("Finalizing ...\n"); res = dbmaker.finalize(); if (res != cs2sq::resOK) {printf("Error4! %d\n",res); return 1;} return 0; } int process_ctags(const char* ctagsfn, const char* sqfn, bool debug) { ctagread tagreader; ctagread::enResult restag; tagreader.setDebug(debug); restag = tagreader.open_files(sqfn, ctagsfn); if (restag != ctagread::resOK) {printf("Error!!!\n"); return 1;} printf("Processing ctags file ...\n"); restag = tagreader.process_ctags(); if (restag != ctagread::resOK) {printf("Error!!!\n"); return 1;} printf("Finalizing ...\n"); restag = tagreader.finalize(); if (restag != ctagread::resOK) {printf("Error!!!\n"); return 1;} return 0; } void printhelp(const char* str) { printf("Usage: %s [-s [-c ] [-t ]] [-p] [-d] [-v] [-h]\n\n", str); printf("options:\n"); printf(" -s : CodeQuery sqlite3 db file path\n"); printf(" -c : cscope.out file path\n"); printf(" -t : ctags tags file path\n"); printf(" -p : \"vacuum\", compact database (may take more time)\n"); printf(" -d : debug\n"); printf(" -v : version\n"); printf(" -h : help\n\n"); printf("The combinations possible are -s -c, -s -t, -s -c -t\n"); printf("The additional optional arguments are -p and -d\n"); printf("if -c is present then sqdbfile need not exist. It will be created.\n"); printf("if -t is present but not -c, then sqdbfile has to exist. Ctags info will be added to it.\n\n"); } void printlicense(void) { printf(CODEQUERY_SW_VERSION); printf("\n"); printf(CODEQUERY_SW_LICENSE); } bool fileexists(const char* fn) { bool retval; FILE *fp; fp = fopen(fn, "r"); retval = (fp != NULL); if (retval) fclose(fp); return retval; } void process_argwithopt(char* thisOpt, int option, bool& err, std::string& fnstr, bool filemustexist) { if (thisOpt != NULL) { fnstr = thisOpt; if (filemustexist && (fileexists(fnstr.c_str()) == false)) { printf("Error: File %s doesn't exist.\n", fnstr.c_str()); err = true; } } else { printf("Error: -%c used without file option.\n", option); err = true; } } int main(int argc, char *argv[]) { int c; bool bHelp, bSqlite, bCscope, bCtags, bDebug, bError, bVacuum, bVersion; bHelp = (argc <= 1); bVersion = false; bSqlite = false; bCscope = false; bCtags = false; bDebug = false; bError = false; bVacuum = false; std::string sqfn, csfn, ctfn; while ((c = getopt2(argc, argv, "s:c:t:pdvh")) != -1) { switch(c) { case 'v': bVersion = true; break; case 'h': bHelp = true; break; case 's': bSqlite = true; process_argwithopt(optarg, c, bError, sqfn, false); break; case 'c': bCscope = true; process_argwithopt(optarg, c, bError, csfn, true); break; case 't': bCtags = true; process_argwithopt(optarg, c, bError, ctfn, true); break; case 'd': bDebug = true; break; case 'p': bVacuum = true; break; case '?': bError = true; break; default: break; } } if (bVersion) { printlicense(); return 0; } if (bHelp || bError) { printhelp(extract_filename(argv[0])); return (bError ? 1 : 0); } if (!bSqlite) { printf("Error: -s is required.\n"); bError = true; } if ((bCscope == false)&&(bCtags == false)) { printf("Error: Either -c or -t or both must be present. Both are missing.\n"); bError = true; } if ((!bCscope) && (fileexists(sqfn.c_str()) == false)) { printf("Error: File %s doesn't exist.\n", sqfn.c_str()); printf("Error: Without -c, sqdbfile must exist.\n"); bError = true; } if (bError) { printhelp(extract_filename(argv[0])); return 1; } if (bCscope) { if (process_cscope(csfn.c_str(), sqfn.c_str(), bDebug) == 1) return 1; } if (bCtags) { if (process_ctags(ctfn.c_str(), sqfn.c_str(), bDebug) == 1) return 1; } if (bVacuum) { printf("Compacting database ...\n"); if (sqlbase::vacuum(sqfn.c_str(), bDebug) != 0) return 1; } else { if (sqlbase::analyze(sqfn.c_str(), bDebug) != 0) return 1; } return 0; } codequery-0.18.1/makedb/sqlbase.cpp000066400000000000000000000170661300045745200171740ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ #include "sqlbase.h" sqlbase::sqlbase() :m_db(NULL) ,m_debug(false) { } sqlbase::~sqlbase() { sqlite3_close(m_db); } void sqlbase::setDebug(bool val) { m_debug = val; } int sqlbase::vacuum(const char* fn, const bool& debug) { int rc; sqlite3 *sqdb; rc = sqlite3_open_v2(fn, &sqdb, SQLITE_OPEN_READWRITE, NULL); if (rc != SQLITE_OK) { sqlite3_close(sqdb); return rc; } rc=sqlite3_exec(sqdb, "PRAGMA synchronous = OFF;" "PRAGMA journal_mode = OFF;" "PRAGMA locking_mode = EXCLUSIVE;" "PRAGMA automatic_index = FALSE;" "PRAGMA cache_size = 20000;" "VACUUM;ANALYZE;", NULL, 0, NULL); if (rc != SQLITE_OK) { if (debug) printf("SQLBaseErr099: %d, %s\n", rc, sqlite3_errmsg(sqdb)); } sqlite3_close(sqdb); return rc; } int sqlbase::analyze(const char* fn, const bool& debug) { int rc; sqlite3 *sqdb; rc = sqlite3_open_v2(fn, &sqdb, SQLITE_OPEN_READWRITE, NULL); if (rc != SQLITE_OK) { sqlite3_close(sqdb); return rc; } rc=sqlite3_exec(sqdb, "PRAGMA synchronous = OFF;" "PRAGMA journal_mode = OFF;" "PRAGMA locking_mode = EXCLUSIVE;" "PRAGMA automatic_index = FALSE;" "PRAGMA cache_size = 20000;" "ANALYZE;", NULL, 0, NULL); if (rc != SQLITE_OK) { if (debug) printf("SQLBaseErr100: %d, %s\n", rc, sqlite3_errmsg(sqdb)); } sqlite3_close(sqdb); return rc; } int sqlbase::prepare_stmt(sqlite3_stmt** pStmt, const char* sqlquery) { int rc; rc = sqlite3_prepare_v2(m_db, sqlquery, strlen(sqlquery), pStmt, NULL); if (rc != SQLITE_OK) { if (m_debug) printf("SQLBaseErr001: %d, %s, line=%s\n", rc, sqlite3_errmsg(m_db), sqlquery); return SQLITE_ERROR; } return SQLITE_OK; } int sqlbase::execstmt(sqlite3_stmt* pstmt, const char* v1) { int rc; rc = sqlite3_reset(pstmt); if (rc != SQLITE_OK) { if (m_debug) printf("SQLBaseErr004: %d, %s\n", rc, sqlite3_errmsg(m_db)); return SQLITE_ERROR; } rc = sqlite3_bind_text(pstmt, 1, v1, strlen(v1), SQLITE_STATIC); if (rc != SQLITE_OK) { if (m_debug) printf("SQLBaseErr002: %d, %s\n", rc, sqlite3_errmsg(m_db)); return SQLITE_ERROR; } rc = sqlite3_step(pstmt); if ((rc == SQLITE_ROW)||(rc == SQLITE_BUSY)) return rc; if (rc != SQLITE_DONE) { if (m_debug) printf("SQLBaseErr003: %d, %s\n", rc, sqlite3_errmsg(m_db)); return SQLITE_ERROR; } return SQLITE_OK; } int sqlbase::execstmt(sqlite3_stmt* pstmt, const char* v1, const char* v2) { int rc; rc = sqlite3_reset(pstmt); if (rc != SQLITE_OK) { if (m_debug) printf("SQLBaseErr004: %d, %s\n", rc, sqlite3_errmsg(m_db)); return SQLITE_ERROR; } rc = sqlite3_bind_text(pstmt, 1, v1, strlen(v1), SQLITE_STATIC); if (rc != SQLITE_OK) { if (m_debug) printf("SQLBaseErr005: %d, %s\n", rc, sqlite3_errmsg(m_db)); return SQLITE_ERROR; } rc = sqlite3_bind_text(pstmt, 2, v2, strlen(v2), SQLITE_STATIC); if (rc != SQLITE_OK) { if (m_debug) printf("SQLBaseErr006: %d, %s\n", rc, sqlite3_errmsg(m_db)); return SQLITE_ERROR; } rc = sqlite3_step(pstmt); if ((rc == SQLITE_ROW)||(rc == SQLITE_BUSY)) return rc; if (rc != SQLITE_DONE) { if (m_debug) printf("SQLBaseErr007: %d, %s\n", rc, sqlite3_errmsg(m_db)); return SQLITE_ERROR; } return SQLITE_OK; } int sqlbase::execstmt(sqlite3_stmt* pstmt, const char* v1, const char* v2, const char* v3) { int rc; rc = sqlite3_reset(pstmt); if (rc != SQLITE_OK) { if (m_debug) printf("SQLBaseErr004: %d, %s\n", rc, sqlite3_errmsg(m_db)); return SQLITE_ERROR; } rc = sqlite3_bind_text(pstmt, 1, v1, strlen(v1), SQLITE_STATIC); if (rc != SQLITE_OK) { if (m_debug) printf("SQLBaseErr009: %d, %s\n", rc, sqlite3_errmsg(m_db)); return SQLITE_ERROR; } rc = sqlite3_bind_text(pstmt, 2, v2, strlen(v2), SQLITE_STATIC); if (rc != SQLITE_OK) { if (m_debug) printf("SQLBaseErr010: %d, %s\n", rc, sqlite3_errmsg(m_db)); return SQLITE_ERROR; } rc = sqlite3_bind_text(pstmt, 3, v3, strlen(v3), SQLITE_STATIC); if (rc != SQLITE_OK) { if (m_debug) printf("SQLBaseErr011: %d, %s\n", rc, sqlite3_errmsg(m_db)); return SQLITE_ERROR; } rc = sqlite3_step(pstmt); if ((rc == SQLITE_ROW)||(rc == SQLITE_BUSY)) return rc; if (rc != SQLITE_DONE) { if (m_debug) printf("SQLBaseErr012: %d, %s\n", rc, sqlite3_errmsg(m_db)); return SQLITE_ERROR; } return SQLITE_OK; } int sqlbase::execstmt(sqlite3_stmt* pstmt, const char* v1, const char* v2, const char* v3, const char* v4) { int rc; rc = sqlite3_reset(pstmt); if (rc != SQLITE_OK) { if (m_debug) printf("SQLBaseErr004: %d, %s\n", rc, sqlite3_errmsg(m_db)); return SQLITE_ERROR; } rc = sqlite3_bind_text(pstmt, 1, v1, strlen(v1), SQLITE_STATIC); if (rc != SQLITE_OK) { if (m_debug) printf("SQLBaseErr014: %d, %s\n", rc, sqlite3_errmsg(m_db)); return SQLITE_ERROR; } rc = sqlite3_bind_text(pstmt, 2, v2, strlen(v2), SQLITE_STATIC); if (rc != SQLITE_OK) { if (m_debug) printf("SQLBaseErr015: %d, %s\n", rc, sqlite3_errmsg(m_db)); return SQLITE_ERROR; } rc = sqlite3_bind_text(pstmt, 3, v3, strlen(v3), SQLITE_STATIC); if (rc != SQLITE_OK) { if (m_debug) printf("SQLBaseErr016: %d, %s\n", rc, sqlite3_errmsg(m_db)); return SQLITE_ERROR; } rc = sqlite3_bind_text(pstmt, 4, v4, strlen(v4), SQLITE_STATIC); if (rc != SQLITE_OK) { if (m_debug) printf("SQLBaseErr017: %d, %s\n", rc, sqlite3_errmsg(m_db)); return SQLITE_ERROR; } rc = sqlite3_step(pstmt); if ((rc == SQLITE_ROW)||(rc == SQLITE_BUSY)) return rc; if (rc != SQLITE_DONE) { if (m_debug) printf("SQLBaseErr018: %d, %s\n", rc, sqlite3_errmsg(m_db)); return SQLITE_ERROR; } return SQLITE_OK; } int sqlbase::execstmt(sqlite3_stmt* pstmt, const char* v1, const char* v2, const char* v3, const char* v4, const char* v5) { int rc; rc = sqlite3_reset(pstmt); if (rc != SQLITE_OK) { if (m_debug) printf("SQLBaseErr004: %d, %s\n", rc, sqlite3_errmsg(m_db)); return SQLITE_ERROR; } rc = sqlite3_bind_text(pstmt, 1, v1, strlen(v1), SQLITE_STATIC); if (rc != SQLITE_OK) { if (m_debug) printf("SQLBaseErr020: %d, %s\n", rc, sqlite3_errmsg(m_db)); return SQLITE_ERROR; } rc = sqlite3_bind_text(pstmt, 2, v2, strlen(v2), SQLITE_STATIC); if (rc != SQLITE_OK) { if (m_debug) printf("SQLBaseErr021: %d, %s\n", rc, sqlite3_errmsg(m_db)); return SQLITE_ERROR; } rc = sqlite3_bind_text(pstmt, 3, v3, strlen(v3), SQLITE_STATIC); if (rc != SQLITE_OK) { if (m_debug) printf("SQLBaseErr022: %d, %s\n", rc, sqlite3_errmsg(m_db)); return SQLITE_ERROR; } rc = sqlite3_bind_text(pstmt, 4, v4, strlen(v4), SQLITE_STATIC); if (rc != SQLITE_OK) { if (m_debug) printf("SQLBaseErr023: %d, %s\n", rc, sqlite3_errmsg(m_db)); return SQLITE_ERROR; } rc = sqlite3_bind_text(pstmt, 5, v5, strlen(v5), SQLITE_STATIC); if (rc != SQLITE_OK) { if (m_debug) printf("SQLBaseErr024: %d, %s\n", rc, sqlite3_errmsg(m_db)); return SQLITE_ERROR; } rc = sqlite3_step(pstmt); if ((rc == SQLITE_ROW)||(rc == SQLITE_BUSY)) return rc; if (rc != SQLITE_DONE) { if (m_debug) printf("SQLBaseErr025: %d, %s\n", rc, sqlite3_errmsg(m_db)); return SQLITE_ERROR; } return SQLITE_OK; } codequery-0.18.1/makedb/sqlbase.h000066400000000000000000000030601300045745200166260ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ #ifndef SQLBASE_H_CQ #define SQLBASE_H_CQ #include #include #include class sqlbase { public: sqlbase(); ~sqlbase(); void setDebug(bool val); static int vacuum(const char* fn, const bool& debug); static int analyze(const char* fn, const bool& debug); int prepare_stmt(sqlite3_stmt** pStmt, const char* sqlquery); int execstmt(sqlite3_stmt* pstmt, const char* v1); int execstmt(sqlite3_stmt* pstmt, const char* v1, const char* v2); int execstmt(sqlite3_stmt* pstmt, const char* v1, const char* v2, const char* v3); int execstmt(sqlite3_stmt* pstmt, const char* v1, const char* v2, const char* v3, const char* v4); int execstmt(sqlite3_stmt* pstmt, const char* v1, const char* v2, const char* v3, const char* v4, const char* v5); protected: bool m_debug; sqlite3 *m_db; }; #endif codequery-0.18.1/makedb/swver.h000066400000000000000000000103171300045745200163450ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ #ifndef SWVER_H_CQ #define SWVER_H_CQ #define CODEQUERY_SW_VERSION "CodeQuery 0.18.0" #define CODEQUERY_SW_VERSION_WEBSITE "

"\ CODEQUERY_SW_VERSION \ "

"\ "

Official Website

"\ "

GitHub Page

" #define CODEQUERY_SW_LICENSE \ "Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/\n\n" \ "Website: https://github.com/ruben2020/codequery\n\n" \ "This program is free software: you can redistribute it and/or modify\n" \ "it under the terms of the GNU General Public License as published by\n" \ "the Free Software Foundation, either version 2 of the License, or\n" \ "(at your option) any later version.\n\n" \ "This program is distributed in the hope that it will be useful,\n" \ "but WITHOUT ANY WARRANTY; without even the implied warranty of\n" \ "MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n" \ "GNU General Public License for more details.\n\n" \ "You should have received a copy of the GNU General Public License\n" \ "along with this program. If not, see \n\n" #define CODEQUERY_SW_LICENSE_PARA \ "Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/\n\n" \ "Website: https://github.com/ruben2020/codequery\n\n" \ "This program is free software: you can redistribute it and/or modify " \ "it under the terms of the GNU General Public License as published by " \ "the Free Software Foundation, either version 2 of the License, or " \ "(at your option) any later version.\n\n" \ "This program is distributed in the hope that it will be useful, " \ "but WITHOUT ANY WARRANTY; without even the implied warranty of " \ "MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the " \ "GNU General Public License for more details.\n\n" \ "You should have received a copy of the GNU General Public License " \ "along with this program. If not, see \n" #define CODEQUERY_SW_LICENSE_PARA_LINK \ "

Copyright (C) 2013-2016 ruben2020

\n\n" \ "

This program is free software: you can redistribute it and/or modify " \ "it under the terms of the GNU General Public License as published by " \ "the Free Software Foundation, either version 2 of the License, or " \ "(at your option) any later version.

\n\n" \ "

This program is distributed in the hope that it will be useful, " \ "but WITHOUT ANY WARRANTY; without even the implied warranty of " \ "MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the " \ "GNU General Public License for more details.

\n\n" \ "

You should have received a copy of the GNU General Public License " \ "along with this program. If not, see http://www.gnu.org/licenses

\n" /** * \mainpage CodeQuery Documentation * * GitHub: https://github.com/ruben2020/codequery * * Downloads: http://sourceforge.net/projects/codequery/files/ * * This is a tool to index, then query or search C, C++, Java, Python, Ruby, Go and Javascript source code. * It builds upon the databases of cscope and Exuberant ctags. * The databases of cscope and ctags would be processed by the cqmakedb tool to * generate the CodeQuery database file. * The CodeQuery database file can be viewed and queried using the codequery GUI tool. * * This contains only the Doxygen documentation of the source code. * For the rest, please see the Github page above. */ #endif // SWVER_H_CQ codequery-0.18.1/querylib/000077500000000000000000000000001300045745200154355ustar00rootroot00000000000000codequery-0.18.1/querylib/CMakeLists.txt000066400000000000000000000006461300045745200202030ustar00rootroot00000000000000cmake_minimum_required(VERSION 2.8.12) project(CodeQuery) find_package(Sqlite REQUIRED) include_directories( "." ) include_directories( "${SQLITE_INCLUDE_DIR}" ) set( SMALL_LIB_SRCS small_lib.cpp getopt2.cpp ) add_library( small_lib STATIC ${SMALL_LIB_SRCS} ) set( QUERY_LIB_SRCS sqlquery.cpp ) add_library( sqlquery_lib STATIC ${QUERY_LIB_SRCS} ) target_link_libraries( sqlquery_lib ${SQLITE_LIBRARIES} small_lib ) codequery-0.18.1/querylib/README.txt000066400000000000000000000024521300045745200171360ustar00rootroot00000000000000 Library to query CodeQuery database files This library is MIT-licensed, so that it may be used to create plugins for editors, IDEs and other software without license restrictions This license applies only to this directory and below. Copyright (c) 2011 ruben2020 https://github.com/ruben2020/ Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. codequery-0.18.1/querylib/getopt2.cpp000066400000000000000000000174121300045745200175320ustar00rootroot00000000000000// This license applies only to this file: // // Copyright (c) 2011 ruben2020 https://github.com/ruben2020/ // // Permission is hereby granted, free of charge, to any person obtaining a copy // of this software and associated documentation files (the "Software"), to // deal in the Software without restriction, including without limitation the // rights to use, copy, modify, merge, publish, distribute, sublicense, and/or // sell copies of the Software, and to permit persons to whom the Software is // furnished to do so, subject to the following conditions: // // The above copyright notice and this permission notice shall be included in // all copies or substantial portions of the Software. // // THE SOTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING // FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS // IN THE SOFTWARE. // /* $Id: getopt.c 4022 2008-03-31 06:11:07Z rra $ * * Replacement implementation of getopt. * * This is a replacement implementation for getopt based on the my_getopt * distribution by Benjamin Sittler. Only the getopt interface is included, * since remctl doesn't use GNU long options, and the code has been rearranged * and reworked somewhat to fit with the remctl coding style. * * Copyright 1997, 2000, 2001, 2002 Benjamin Sittler * Copyright 2008 Russ Allbery * * Permission is hereby granted, free of charge, to any person obtaining a * copy of this software and associated documentation files (the "Software"), * to deal in the Software without restriction, including without limitation * the rights to use, copy, modify, merge, publish, distribute, sublicense, * and/or sell copies of the Software, and to permit persons to whom the * Software is furnished to do so, subject to the following conditions: * * The above copyright notice and this permission notice shall be included in * all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER * DEALINGS IN THE SOFTWARE. */ #include #include #include "getopt2.h" /* Initialize global interface variables. */ int optind = 1; int opterr = 1; int optopt = 0; char *optarg = NULL; /* * This is the plain old UNIX getopt, with GNU-style extensions. If you're * porting some piece of UNIX software, this is all you need. It supports * GNU-style permutation and optional arguments, but does not support the GNU * -W extension. * * This function is not re-entrant or thread-safe, has static variables, and * generally isn't a great interface, but normally you only call it once. */ int getopt2(int argc, char *argv[], const char *optstring) { const char *p; size_t offset = 0; char mode = '\0'; int colon_mode = 0; int option = -1; /* Holds the current position in the parameter being parsed. */ static int charind = 0; /* * By default, getopt permutes argv as it scans and leaves all non-options * at the end. This can be changed with the first character of optstring * or the environment variable POSIXLY_CORRECT. With a first character of * '+' or when POSIXLY_CORRECT is set, option processing stops at the * first non-option. If the first character is '-', each non-option argv * element is handled as if it were the argument of an option with * character code 1. mode holds this character. * * After the optional leading '+' and '-', optstring may contain ':'. If * present, missing arguments return ':' instead of '?'. colon_mode holds * this setting. */ /* if (getenv("POSIXLY_CORRECT") != NULL) { mode = '+'; colon_mode = '+'; } else { */ if (optstring[offset] == '+' || optstring[offset] == '-') { mode = optstring[offset]; offset++; } if (optstring[offset] == ':') { colon_mode = 1; offset++; } /* }*/ /* * charind holds where we left off. If it's set, we were in the middle * of an argv element; if not, we pick up with the next element of * optind. */ optarg = NULL; if (charind == 0) { if (optind >= argc) option = -1; else if (strcmp(argv[optind], "--") == 0) { optind++; option = -1; } else if (argv[optind][0] != '-' || argv[optind][1] == '\0') { char *tmp; int i, j, k, end; if (mode == '+') option = -1; else if (mode == '-') { optarg = argv[optind]; optind++; option = 1; } else { for (i = optind + 1, j = optind; i < argc; i++) if ((argv[i][0] == '-') && (argv[i][1] != '\0')) { optind = i; option = getopt2(argc, argv, optstring); while (i > j) { --i; tmp = argv[i]; end = (charind == 0) ? optind - 1 : optind; for (k = i; k + 1 <= end; k++) { argv[k] = argv[k + 1]; } argv[end] = tmp; --optind; } break; } if (i == argc) option = -1; } return option; } else { charind = 1; } } if (charind != 0) { optopt = argv[optind][charind]; for (p = optstring + offset; *p != '\0'; p++) if (optopt == *p) { p++; if (*p == ':') { if (argv[optind][charind + 1] != '\0') { optarg = &argv[optind][charind + 1]; optind++; charind = 0; } else { p++; if (*p != ':') { charind = 0; optind++; if (optind >= argc) { if (opterr) fprintf(stderr, "%s: option requires" " an argument -- %c\n", argv[0], optopt); option = colon_mode ? ':' : '?'; goto done; } else { optarg = argv[optind]; optind++; } } } } option = optopt; } if (option == -1) { if (opterr) fprintf(stderr, "%s: illegal option -- %c\n", argv[0], optopt); option = '?'; } } done: if (charind != 0) { charind++; if (argv[optind][charind] == '\0') { optind++; charind = 0; } } if (optind > argc) optind = argc; return option; } codequery-0.18.1/querylib/getopt2.h000066400000000000000000000055161300045745200172010ustar00rootroot00000000000000// This license applies only to this file: // // Copyright (c) 2011 ruben2020 https://github.com/ruben2020/ // // Permission is hereby granted, free of charge, to any person obtaining a copy // of this software and associated documentation files (the "Software"), to // deal in the Software without restriction, including without limitation the // rights to use, copy, modify, merge, publish, distribute, sublicense, and/or // sell copies of the Software, and to permit persons to whom the Software is // furnished to do so, subject to the following conditions: // // The above copyright notice and this permission notice shall be included in // all copies or substantial portions of the Software. // // THE SOTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING // FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS // IN THE SOFTWARE. // /* $Id: getopt.c 4022 2008-03-31 06:11:07Z rra $ * * Replacement implementation of getopt. * * This is a replacement implementation for getopt based on the my_getopt * distribution by Benjamin Sittler. Only the getopt interface is included, * since remctl doesn't use GNU long options, and the code has been rearranged * and reworked somewhat to fit with the remctl coding style. * * Copyright 1997, 2000, 2001, 2002 Benjamin Sittler * Copyright 2008 Russ Allbery * * Permission is hereby granted, free of charge, to any person obtaining a * copy of this software and associated documentation files (the "Software"), * to deal in the Software without restriction, including without limitation * the rights to use, copy, modify, merge, publish, distribute, sublicense, * and/or sell copies of the Software, and to permit persons to whom the * Software is furnished to do so, subject to the following conditions: * * The above copyright notice and this permission notice shall be included in * all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER * DEALINGS IN THE SOFTWARE. */ #ifndef GETOPT2_H #define GETOPT2_H extern char *optarg; int getopt2(int argc, char *argv[], const char *optstring); #endif codequery-0.18.1/querylib/small_lib.cpp000066400000000000000000000171751300045745200201120ustar00rootroot00000000000000 // Small library of useful classes and functions // // This license applies only to this file: // // Copyright (c) 2011 ruben2020 https://github.com/ruben2020/ // // Permission is hereby granted, free of charge, to any person obtaining a copy // of this software and associated documentation files (the "Software"), to // deal in the Software without restriction, including without limitation the // rights to use, copy, modify, merge, publish, distribute, sublicense, and/or // sell copies of the Software, and to permit persons to whom the Software is // furnished to do so, subject to the following conditions: // // The above copyright notice and this permission notice shall be included in // all copies or substantial portions of the Software. // // THE SOTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING // FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS // IN THE SOFTWARE. // #ifdef _WIN32 #include #endif #ifndef _MSC_VER #include #endif #include "small_lib.h" #include bool check_fileExists(const char *fn) { #ifdef _MSC_VER DWORD dwAttrib = GetFileAttributes(fn); return ((dwAttrib != INVALID_FILE_ATTRIBUTES) && !(dwAttrib & FILE_ATTRIBUTE_DIRECTORY)); #else return (access(fn, F_OK) != -1); #endif } // is the file path given (fp), absolute or relative? bool isAbsolutePath(tStr fp) { bool result = false; // example: /usr/bin/local/file or \temp\file result = (fp[0] == DIRSEP); #ifdef _WIN32 // example: c:\temp\file result = result || ((fp[1] == ':')&&(fp[2] == DIRSEP)); #endif return result; } // reverse string compare bool strrevcmp(tStr str, tStr cmpstr) { bool retval = (1 == 1); int n = str.length(); if (n != cmpstr.length()) {retval = (1 == 0);} else for (int i = (n - 1); i >= 0; i--) { if (str[i] != cmpstr[i]) { retval = (1 == 0); break; } } return retval; } // return pointer to the last part of the string, // after the last occurrence of delimiter c char* get_last_part(char* str, int c) { char* retval; retval = strrchr(str, c); if (retval == NULL) { // not found, just return whole string retval = str; } else { retval += 1; } return retval; } // split string into an array based on a delimiter std::vector splitstr(const char* inpstr, const char delim) { size_t pos = 0, retpos = 0; std::vector vecstr; std::string str(inpstr); do { retpos = str.find_first_of(delim, pos); if (retpos == std::string::npos) { vecstr.push_back(str.substr(pos)); } else { vecstr.push_back(str.substr(pos, retpos - pos)); pos = retpos + 1; } } while (retpos != std::string::npos); return vecstr; } // replace char o with char r for every part of the string // from iterator i1 to iterator i2, excluding i2 int replacechar(std::string::iterator i1, std::string::iterator i2, const char o, const char r) { int count = 0; for(std::string::iterator i = i1; i != i2; ++i) { if (*i == o) { *i = r; count++; } } return count; } // remove EOL char const char* chomp(char* str) { if ((str != NULL)&&(strlen(str) > 0)) { char* charr = strrchr(str, 0xA); if (charr != NULL) { *charr = 0; // Unix chomp, Windows half-chomp charr--; if (*charr == 0xD) *charr = 0; // Windows chomp } else { charr = strrchr(str, 0xD); if (charr != NULL) *charr = 0; // MacOS chomp } } return static_cast(str); } // add an escape character in front of another predetermined character std::string add_escape_char(std::string ori, char chr2escp, char escpchr) { std::string s; int num = 0; size_t retval = -1; s = ori; do { retval = ori.find(chr2escp, retval+1); if (retval != std::string::npos) { s.insert(retval + num, 1, escpchr); num++; } } while (retval != std::string::npos); return s; } // add an escape character in front of another predetermined character std::string add_escape_char(const char* oristr, char chr2escp, char escpchr) { std::string ori(oristr); std::string s; int num = 0; size_t retval = -1; s = ori; do { retval = ori.find(chr2escp, retval+1); if (retval != std::string::npos) { s.insert(retval + num, 1, escpchr); num++; } } while (retval != std::string::npos); return s; } // extract the filename.ext from a file path const char* extract_filename(const char* filepath) { char* str = (char*) filepath; char* charr = NULL; char pathdelim[] = {'/', '\\', ':'}; if ((filepath != NULL)&&(strlen(filepath) > 0)) for (int i=0; i < sizeof(pathdelim); i++) { charr = (char*) strrchr(filepath, pathdelim[i]); if (charr != NULL) {str = charr+1; break;} } return static_cast(str); } void smartFILE::setme(FILE *fptr) {close_file(); m_fp = fptr;} smartFILE::smartFILE() :m_fp(NULL) {} smartFILE::smartFILE(FILE *fptr) :m_fp(fptr) {} smartFILE::smartFILE(const smartFILE& sfp) :m_fp(sfp.m_fp) {} smartFILE::~smartFILE() {close_file();} FILE* smartFILE::operator() () {return m_fp;} bool smartFILE::operator ==(FILE* fptr) const {return (m_fp == fptr);} bool smartFILE::operator !=(FILE* fptr) const {return (m_fp != fptr);} bool smartFILE::operator ==(const smartFILE& sfp) const {return (m_fp == sfp.m_fp);} bool smartFILE::operator !=(const smartFILE& sfp) const {return (m_fp != sfp.m_fp);} smartFILE& smartFILE::operator =(FILE *fptr) {setme(fptr); return *this;} smartFILE& smartFILE::operator =(const smartFILE& sfp) { if (this != &sfp) {setme(sfp.m_fp);} return *this; } void smartFILE::assign(FILE* fptr) {setme(fptr);} void smartFILE::assign(const smartFILE& sfp) {setme(sfp.m_fp);} FILE* smartFILE::get(void) {return m_fp;} void smartFILE::close_file(void) { if (m_fp != NULL) { fclose(m_fp); m_fp = NULL; } } tempbuf::tempbuf(unsigned int n) { if (n < 10) n = 10; m_buffer = new (std::nothrow) char[n]; if (m_buffer != NULL) { *m_buffer = 0; } m_size = n; } tempbuf::~tempbuf() { if (m_buffer != NULL) { delete[] m_buffer; } } char* tempbuf::operator() () {return m_buffer;} char* tempbuf::get(void) {return m_buffer;} char tempbuf::operator[] (unsigned int i) { char chr; if (i < m_size) chr = *(m_buffer + i); else chr = 0; return chr; } unsigned int tempbuf::size(void) const {return m_size;} bool tempbuf::isempty(void) const {return (*m_buffer == 0);} void tempbuf::clear(void) {*m_buffer = 0;} char* tempbuf::reinit(unsigned int n) { if (n < 10) n = 10; delete[] m_buffer; m_buffer = new char[n]; *m_buffer = 0; m_size = n; return m_buffer; } const char* tempbuf::constchar(void) {return static_cast(m_buffer);} idxcounter::idxcounter():m_ctr(0) {} idxcounter::~idxcounter(){} idxcounter::idxcounter(const idxcounter& idxc) { m_ctr = idxc.m_ctr; } idxcounter& idxcounter::operator =(long unsigned int idx) {m_ctr = idx; return *this;} idxcounter& idxcounter::operator =(const idxcounter& idxc) { if (this != &idxc) { m_ctr = idxc.m_ctr; } return *this; } void idxcounter::setCounterVal(long unsigned int i) {m_ctr = i;} void idxcounter::reset(void) {m_ctr = 0;} idxcounter& idxcounter::operator ++() {++m_ctr;sprintf(m_buf, "%lu", m_ctr); return *this;} idxcounter& idxcounter::operator --() {--m_ctr;sprintf(m_buf, "%lu", m_ctr); return *this;} long unsigned int idxcounter::getInt(void) const {return m_ctr;} const char* idxcounter::getStr(void) const {return m_buf;} int idxcounter::getStrSize(void) const {return strlen(m_buf);} codequery-0.18.1/querylib/small_lib.h000066400000000000000000000070461300045745200175530ustar00rootroot00000000000000 // Small library of useful classes and functions // // This license applies only to this file: // // Copyright (c) 2011 ruben2020 https://github.com/ruben2020/ // // Permission is hereby granted, free of charge, to any person obtaining a copy // of this software and associated documentation files (the "Software"), to // deal in the Software without restriction, including without limitation the // rights to use, copy, modify, merge, publish, distribute, sublicense, and/or // sell copies of the Software, and to permit persons to whom the Software is // furnished to do so, subject to the following conditions: // // The above copyright notice and this permission notice shall be included in // all copies or substantial portions of the Software. // // THE SOTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING // FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS // IN THE SOFTWARE. // #ifndef SMALL_LIB_H_CQ #define SMALL_LIB_H_CQ #include #include #include #include #ifdef _WIN32 #define DIRSEP '\\' #else #define DIRSEP '/' #endif // Get number of elements of a fixed-sized array #define DIM(x) (sizeof( x ) / sizeof( x [0] ) ) typedef std::string tStr; typedef std::vector tVecStr; bool check_fileExists(const char *fn); bool isAbsolutePath(tStr fp); bool strrevcmp(tStr str, tStr cmpstr); char* get_last_part(char* str, int c); std::vector splitstr(const char* inpstr, const char delim); int replacechar(std::string::iterator i1, std::string::iterator i2, const char o, const char r); const char* chomp(char* str); std::string add_escape_char(std::string ori, char chr2escp, char escpchr); std::string add_escape_char(const char* oristr, char chr2escp, char escpchr); const char* extract_filename(const char* filepath); class smartFILE { private: FILE* m_fp; inline void setme(FILE *fptr); public: smartFILE(); smartFILE(FILE *fptr); smartFILE(const smartFILE& sfp); ~smartFILE(); // the reason why this class was written FILE* operator() (); bool operator ==(FILE* fptr) const; bool operator !=(FILE* fptr) const; bool operator ==(const smartFILE& sfp) const; bool operator !=(const smartFILE& sfp) const; smartFILE& operator =(FILE *fptr); smartFILE& operator =(const smartFILE& sfp); void assign(FILE* fptr); void assign(const smartFILE& sfp); FILE* get(void); void close_file(void); }; //class smartFILE class tempbuf { private: char* m_buffer; unsigned int m_size; public: tempbuf(unsigned int n); ~tempbuf(); // the reason why this class was written char* operator() (); char* get(void); char operator[] (unsigned int i); unsigned int size(void) const; bool isempty(void) const; void clear(void); char* reinit(unsigned int n); const char* constchar(void); }; //class tempbuf class idxcounter { private: long unsigned int m_ctr; char m_buf[20]; public: idxcounter(); ~idxcounter(); idxcounter(const idxcounter& idxc); idxcounter& operator =(long unsigned int idx); idxcounter& operator =(const idxcounter& idxc); void setCounterVal(long unsigned int i); void reset(void); idxcounter& operator ++(); idxcounter& operator --(); long unsigned int getInt(void) const; const char* getStr(void) const; int getStrSize(void) const; }; //class idxcounter #endif //SMALL_LIB_H_CQ codequery-0.18.1/querylib/sqlquery.cpp000066400000000000000000000664401300045745200200400ustar00rootroot00000000000000 // Library to query CodeQuery database files // // This library is MIT-licensed, so that it may be used to create plugins // for editors, IDEs and other software without license restrictions // // This license applies only to this file: // // Copyright (c) 2011 ruben2020 https://github.com/ruben2020/ // // Permission is hereby granted, free of charge, to any person obtaining a copy // of this software and associated documentation files (the "Software"), to // deal in the Software without restriction, including without limitation the // rights to use, copy, modify, merge, publish, distribute, sublicense, and/or // sell copies of the Software, and to permit persons to whom the Software is // furnished to do so, subject to the following conditions: // // The above copyright notice and this permission notice shall be included in // all copies or substantial portions of the Software. // // THE SOTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING // FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS // IN THE SOFTWARE. // #include #include //#include #include #include #include "small_lib.h" #include "sqlquery.h" #define SQL_SYM "SELECT symtbl.symName,symtbl.symType,filestbl.filePath,linestbl.linenum,linestbl.linetext,linestbl.fileID FROM symtbl INNER JOIN linestbl ON symtbl.lineID=linestbl.lineID AND symtbl.symID IN (SELECT symID FROM symtbl WHERE symName LIKE ? ESCAPE \";\") INNER JOIN filestbl ON (linestbl.fileID=filestbl.fileID AND filestbl.filePath LIKE ? ESCAPE \";\");" #define SQL_FUNC_MACRO "SELECT symtbl.symName,symtbl.symType,filestbl.filePath,linestbl.linenum,linestbl.linetext,linestbl.fileID FROM symtbl INNER JOIN linestbl ON symtbl.lineID=linestbl.lineID AND symtbl.symID IN (SELECT symID FROM symtbl WHERE symName LIKE ? ESCAPE \";\") AND (symtbl.symType=\"$\" OR symtbl.symType=\"#\") INNER JOIN filestbl ON (linestbl.fileID=filestbl.fileID AND filestbl.filePath LIKE ? ESCAPE \";\");" #define SQL_CLASS_STRUCT "SELECT symtbl.symName,symtbl.symType,filestbl.filePath,linestbl.linenum,linestbl.linetext,linestbl.fileID FROM symtbl INNER JOIN linestbl ON symtbl.lineID=linestbl.lineID AND symtbl.symID IN (SELECT symID FROM symtbl WHERE symName LIKE ? ESCAPE \";\") AND (symtbl.symType=\"c\" OR symtbl.symType=\"s\") INNER JOIN filestbl ON (linestbl.fileID=filestbl.fileID AND filestbl.filePath LIKE ? ESCAPE \";\");" #define SQL_CALLINGFUNC "SELECT symtbl.symName,symtbl.symType,filestbl.filePath,linestbl.linenum,linestbl.linetext,linestbl.fileID FROM symtbl INNER JOIN linestbl ON symtbl.lineID=linestbl.lineID AND symtbl.symID IN (SELECT callerID FROM calltbl WHERE calledID IN (SELECT symID FROM symtbl WHERE symName LIKE ? ESCAPE \";\")) INNER JOIN filestbl ON (linestbl.fileID=filestbl.fileID AND filestbl.filePath LIKE ? ESCAPE \";\");" #define SQL_CALLEDFUNC "SELECT symtbl.symName,symtbl.symType,filestbl.filePath,linestbl.linenum,linestbl.linetext,linestbl.fileID FROM symtbl INNER JOIN linestbl ON symtbl.lineID=linestbl.lineID AND symtbl.symID IN (SELECT calledID FROM calltbl WHERE callerID IN (SELECT symID FROM symtbl WHERE symName LIKE ? ESCAPE \";\")) INNER JOIN filestbl ON (linestbl.fileID=filestbl.fileID AND filestbl.filePath LIKE ? ESCAPE \";\");" #define SQL_CALLS_OF_FUNC "SELECT symtbl.symName,symtbl.symType,filestbl.filePath,linestbl.linenum,linestbl.linetext,linestbl.fileID FROM symtbl INNER JOIN linestbl ON symtbl.lineID=linestbl.lineID AND symtbl.symID IN (SELECT symID FROM symtbl WHERE symName LIKE ? ESCAPE \";\") AND (symtbl.symType=\"`\") INNER JOIN filestbl ON (linestbl.fileID=filestbl.fileID AND filestbl.filePath LIKE ? ESCAPE \";\");" #define SQL_MEMBERS "SELECT symtbl.symName,symtbl.symType,filestbl.filePath,linestbl.linenum,linestbl.linetext,linestbl.fileID FROM symtbl INNER JOIN linestbl ON symtbl.lineID=linestbl.lineID AND symtbl.symID IN (SELECT memberID FROM membertbl WHERE groupID IN (SELECT symID FROM symtbl WHERE symName LIKE ? ESCAPE \";\")) INNER JOIN filestbl ON (linestbl.fileID=filestbl.fileID AND filestbl.filePath LIKE ? ESCAPE \";\");" #define SQL_OWNERCLASS "SELECT symtbl.symName,symtbl.symType,filestbl.filePath,linestbl.linenum,linestbl.linetext,linestbl.fileID FROM symtbl INNER JOIN linestbl ON symtbl.lineID=linestbl.lineID AND symtbl.symID IN (SELECT groupID FROM membertbl WHERE memberID IN (SELECT symID FROM symtbl WHERE symName LIKE ? ESCAPE \";\")) INNER JOIN filestbl ON (linestbl.fileID=filestbl.fileID AND filestbl.filePath LIKE ? ESCAPE \";\");" #define SQL_PARENTCLASS "SELECT symtbl.symName,symtbl.symType,filestbl.filePath,linestbl.linenum,linestbl.linetext,linestbl.fileID FROM symtbl INNER JOIN linestbl ON symtbl.lineID=linestbl.lineID AND symtbl.symID IN (SELECT parentID FROM inherittbl WHERE childID IN (SELECT symID FROM symtbl WHERE symName LIKE ? ESCAPE \";\")) INNER JOIN filestbl ON (linestbl.fileID=filestbl.fileID AND filestbl.filePath LIKE ? ESCAPE \";\");" #define SQL_CHILDCLASS "SELECT symtbl.symName,symtbl.symType,filestbl.filePath,linestbl.linenum,linestbl.linetext,linestbl.fileID FROM symtbl INNER JOIN linestbl ON symtbl.lineID=linestbl.lineID AND symtbl.symID IN (SELECT childID FROM inherittbl WHERE parentID IN (SELECT symID FROM symtbl WHERE symName LIKE ? ESCAPE \";\")) INNER JOIN filestbl ON (linestbl.fileID=filestbl.fileID AND filestbl.filePath LIKE ? ESCAPE \";\");" #define SQL_INCLUDE "SELECT filestbl.filePath,linestbl.linenum,linestbl.linetext,linestbl.fileID FROM symtbl INNER JOIN linestbl ON symtbl.lineID=linestbl.lineID AND symtbl.symID IN (SELECT symID FROM symtbl WHERE symName LIKE ? ESCAPE \";\" AND symType=\"~\") INNER JOIN filestbl ON linestbl.fileID=filestbl.fileID;" #define SQL_FILEPATH "SELECT DISTINCT filePath FROM filestbl WHERE filePath LIKE ? ESCAPE \";\";" #define SQL_AUTOCOMPLETE "SELECT DISTINCT symName FROM symtbl WHERE symName LIKE ? ORDER BY symName LIMIT 20;" #define SQL_FUNCSINFILE "SELECT symtbl.symName,symtbl.symType,filestbl.filePath,linestbl.linenum,linestbl.linetext,linestbl.fileID FROM symtbl INNER JOIN linestbl ON symtbl.lineID=linestbl.lineID AND symtbl.symID IN (SELECT symID FROM symtbl WHERE (symtbl.symType=\"$\" OR symtbl.symType=\"#\")) INNER JOIN filestbl ON (linestbl.fileID=filestbl.fileID AND filestbl.filePath LIKE ? ESCAPE \";\");" #define SQL_FUNCSINONEFILE "SELECT symtbl.symName,filestbl.filePath,linestbl.linenum FROM symtbl INNER JOIN linestbl ON symtbl.lineID=linestbl.lineID AND symtbl.symID IN (SELECT symID FROM symtbl WHERE (symtbl.symType=\"$\")) INNER JOIN filestbl ON (linestbl.fileID=filestbl.fileID AND filestbl.filePath LIKE ? ESCAPE \";\");" #define SQL_FUNCSINONEFILE2 "SELECT symtbl.symName,filestbl.filePath,linestbl.linenum FROM symtbl INNER JOIN linestbl ON symtbl.lineID=linestbl.lineID AND symtbl.symID IN (SELECT symID FROM symtbl WHERE (symtbl.symType=\"$\")) INNER JOIN filestbl ON (linestbl.fileID=filestbl.fileID AND linestbl.fileID=?);" #define SQL_EM_SYM "SELECT symtbl.symName,symtbl.symType,filestbl.filePath,linestbl.linenum,linestbl.linetext,linestbl.fileID FROM symtbl INNER JOIN linestbl ON symtbl.lineID=linestbl.lineID AND symtbl.symID IN (SELECT symID FROM symtbl WHERE symName=?) INNER JOIN filestbl ON (linestbl.fileID=filestbl.fileID AND filestbl.filePath LIKE ? ESCAPE \";\");" #define SQL_EM_FUNC_MACRO "SELECT symtbl.symName,symtbl.symType,filestbl.filePath,linestbl.linenum,linestbl.linetext,linestbl.fileID FROM symtbl INNER JOIN linestbl ON symtbl.lineID=linestbl.lineID AND symtbl.symID IN (SELECT symID FROM symtbl WHERE symName=?) AND (symtbl.symType=\"$\" OR symtbl.symType=\"#\") INNER JOIN filestbl ON (linestbl.fileID=filestbl.fileID AND filestbl.filePath LIKE ? ESCAPE \";\");" #define SQL_EM_CLASS_STRUCT "SELECT symtbl.symName,symtbl.symType,filestbl.filePath,linestbl.linenum,linestbl.linetext,linestbl.fileID FROM symtbl INNER JOIN linestbl ON symtbl.lineID=linestbl.lineID AND symtbl.symID IN (SELECT symID FROM symtbl WHERE symName=?) AND (symtbl.symType=\"c\" OR symtbl.symType=\"s\") INNER JOIN filestbl ON (linestbl.fileID=filestbl.fileID AND filestbl.filePath LIKE ? ESCAPE \";\");" #define SQL_EM_CALLINGFUNC "SELECT symtbl.symName,symtbl.symType,filestbl.filePath,linestbl.linenum,linestbl.linetext,linestbl.fileID FROM symtbl INNER JOIN linestbl ON symtbl.lineID=linestbl.lineID AND symtbl.symID IN (SELECT callerID FROM calltbl WHERE calledID IN (SELECT symID FROM symtbl WHERE symName=?)) INNER JOIN filestbl ON (linestbl.fileID=filestbl.fileID AND filestbl.filePath LIKE ? ESCAPE \";\");" #define SQL_EM_CALLEDFUNC "SELECT symtbl.symName,symtbl.symType,filestbl.filePath,linestbl.linenum,linestbl.linetext,linestbl.fileID FROM symtbl INNER JOIN linestbl ON symtbl.lineID=linestbl.lineID AND symtbl.symID IN (SELECT calledID FROM calltbl WHERE callerID IN (SELECT symID FROM symtbl WHERE symName=?)) INNER JOIN filestbl ON (linestbl.fileID=filestbl.fileID AND filestbl.filePath LIKE ? ESCAPE \";\");" #define SQL_EM_CALLS_OF_FUNC "SELECT symtbl.symName,symtbl.symType,filestbl.filePath,linestbl.linenum,linestbl.linetext,linestbl.fileID FROM symtbl INNER JOIN linestbl ON symtbl.lineID=linestbl.lineID AND symtbl.symID IN (SELECT symID FROM symtbl WHERE symName=?) AND (symtbl.symType=\"`\") INNER JOIN filestbl ON (linestbl.fileID=filestbl.fileID AND filestbl.filePath LIKE ? ESCAPE \";\");" #define SQL_EM_MEMBERS "SELECT symtbl.symName,symtbl.symType,filestbl.filePath,linestbl.linenum,linestbl.linetext,linestbl.fileID FROM symtbl INNER JOIN linestbl ON symtbl.lineID=linestbl.lineID AND symtbl.symID IN (SELECT memberID FROM membertbl WHERE groupID IN (SELECT symID FROM symtbl WHERE symName=?)) INNER JOIN filestbl ON (linestbl.fileID=filestbl.fileID AND filestbl.filePath LIKE ? ESCAPE \";\");" #define SQL_EM_OWNERCLASS "SELECT symtbl.symName,symtbl.symType,filestbl.filePath,linestbl.linenum,linestbl.linetext,linestbl.fileID FROM symtbl INNER JOIN linestbl ON symtbl.lineID=linestbl.lineID AND symtbl.symID IN (SELECT groupID FROM membertbl WHERE memberID IN (SELECT symID FROM symtbl WHERE symName=?)) INNER JOIN filestbl ON (linestbl.fileID=filestbl.fileID AND filestbl.filePath LIKE ? ESCAPE \";\");" #define SQL_EM_PARENTCLASS "SELECT symtbl.symName,symtbl.symType,filestbl.filePath,linestbl.linenum,linestbl.linetext,linestbl.fileID FROM symtbl INNER JOIN linestbl ON symtbl.lineID=linestbl.lineID AND symtbl.symID IN (SELECT parentID FROM inherittbl WHERE childID IN (SELECT symID FROM symtbl WHERE symName=?)) INNER JOIN filestbl ON (linestbl.fileID=filestbl.fileID AND filestbl.filePath LIKE ? ESCAPE \";\");" #define SQL_EM_CHILDCLASS "SELECT symtbl.symName,symtbl.symType,filestbl.filePath,linestbl.linenum,linestbl.linetext,linestbl.fileID FROM symtbl INNER JOIN linestbl ON symtbl.lineID=linestbl.lineID AND symtbl.symID IN (SELECT childID FROM inherittbl WHERE parentID IN (SELECT symID FROM symtbl WHERE symName=?)) INNER JOIN filestbl ON (linestbl.fileID=filestbl.fileID AND filestbl.filePath LIKE ? ESCAPE \";\");" #define SQL_EM_INCLUDE "SELECT filestbl.filePath,linestbl.linenum,linestbl.linetext,linestbl.fileID FROM symtbl INNER JOIN linestbl ON symtbl.lineID=linestbl.lineID AND symtbl.symID IN (SELECT symID FROM symtbl WHERE symName=? AND symType=\"~\") INNER JOIN filestbl ON linestbl.fileID=filestbl.fileID;" #define SQL_EM_FILEPATH "SELECT DISTINCT filePath FROM filestbl WHERE filePath=?;" #define SQL_DECLARATION "SELECT symtbl.symName,symtbl.symType,filestbl.filePath,linestbl.linenum,linestbl.linetext,linestbl.fileID FROM symtbl INNER JOIN linestbl ON symtbl.symID IN (SELECT symID FROM symtbl WHERE symName=?) AND (symtbl.symType=\"$\" OR symtbl.symType=\"#\" OR symtbl.symType=\"c\" OR symtbl.symType=\"s\") AND symtbl.lineID=linestbl.lineID INNER JOIN filestbl ON (linestbl.fileID=filestbl.fileID) LIMIT 1;" struct nameasc { bool operator()( const sqlqueryresult& lx, const sqlqueryresult& rx ) const { return lx.symname2.compare(rx.symname2) < 0; } }; struct numasc { bool operator()( const sqlqueryresult& lx, const sqlqueryresult& rx ) const { return lx.intLinenum < rx.intLinenum; } }; tempstmt::tempstmt() :m_stmt(NULL) { } tempstmt::~tempstmt() { finalize(); } void tempstmt::finalize(void) { sqlite3_finalize(m_stmt); m_stmt = NULL; qry.clear(); } sqlite3_stmt* tempstmt::get(void) { return m_stmt; } sqlqueryresultlist::sqlqueryresultlist() :result_type(sqlresultERROR) ,sqlerrmsg("empty") { } sqlqueryresultlist::sqlqueryresultlist(const sqlqueryresultlist& copy) { result_type = copy.result_type; sqlerrmsg = copy.sqlerrmsg; resultlist = copy.resultlist; } sqlqueryresultlist& sqlqueryresultlist::operator= (const sqlqueryresultlist& copy) { if (© != this) { result_type = copy.result_type; sqlerrmsg = copy.sqlerrmsg; resultlist.clear(); resultlist = copy.resultlist; } return *this; } void sqlqueryresultlist::sort_by_name(void) { std::sort(resultlist.begin(), resultlist.end(), nameasc()); } void sqlqueryresultlist::sort_by_linenum(void) { std::sort(resultlist.begin(), resultlist.end(), numasc()); } sqlquery::sqlquery() :m_db(NULL) { } sqlquery::~sqlquery() { close_dbfile(); } sqlquery::en_filereadstatus sqlquery::open_dbfile(tStr dbfn) { if (dbfn.empty()) return sqlfileOPENERROR; smartFILE fp; // Does the file exist? if (check_fileExists(dbfn.c_str()) == false) {return sqlfileOPENERROR;} // Try to open the file for reading fp = fopen(dbfn.c_str(), "r"); if (fp == NULL) {return sqlfileOPENERROR;} fp.close_file(); int rc = sqlite3_open_v2(dbfn.c_str(), &m_db, SQLITE_OPEN_READONLY, NULL); if ((rc != SQLITE_OK)||(m_db == NULL)) { close_dbfile(); return sqlfileOPENERROR; } tempstmt stmt; sqlite3_exec(m_db, /*"PRAGMA synchronous = OFF;" "PRAGMA journal_mode = OFF;" "PRAGMA locking_mode = EXCLUSIVE;" "PRAGMA automatic_index = FALSE;"*/ "PRAGMA cache_size = 20000;", NULL, 0, NULL); tStr majorver = read_configtbl("DB_MAJOR_VER", stmt.get()); tStr minorver = read_configtbl("DB_MINOR_VER", stmt.get()); if ((majorver.empty())||(minorver.empty())) {return sqlfileNOTCORRECTDB;} if (majorver.compare(tStr("0")) != 0) return sqlfileINCORRECTVER; if (minorver.compare(tStr("1")) != 0) return sqlfileINCORRECTVER; m_basepath = read_configtbl("DB_BASE_PATH", stmt.get()); if (m_basepath.empty()) {return sqlfileNOTCORRECTDB;} rc = sqlite3_prepare_v2(m_db, SQL_AUTOCOMPLETE, strlen(SQL_AUTOCOMPLETE), &(m_autocompstmt.m_stmt), NULL); rc = sqlite3_prepare_v2(m_db, SQL_FUNCSINONEFILE, strlen(SQL_FUNCSINONEFILE), &(m_funclistfilenamestmt.m_stmt), NULL); rc = sqlite3_prepare_v2(m_db, SQL_FUNCSINONEFILE2, strlen(SQL_FUNCSINONEFILE2), &(m_funclistfileidstmt.m_stmt), NULL); rc = sqlite3_prepare_v2(m_db, SQL_DECLARATION, strlen(SQL_DECLARATION), &(m_declarationstmt.m_stmt), NULL); if (rc != SQLITE_OK) {return sqlfileNOTCORRECTDB;} return sqlfileOK; } void sqlquery::close_dbfile(void) { m_declarationstmt.finalize(); m_autocompstmt.finalize(); m_funclistfilenamestmt.finalize(); m_funclistfileidstmt.finalize(); m_searchstmt.finalize(); sqlite3_close(m_db); m_db = NULL; m_basepath.clear(); } tStr sqlquery::read_configtbl(const char *key, sqlite3_stmt *stmt) { tStr result = ""; if ((key == NULL)||(strlen(key) == 0)||(m_db == NULL)) return result; int rc; if (stmt == NULL) { rc = sqlite3_prepare_v2(m_db, "SELECT configVal FROM configtbl WHERE configKey=?;", strlen("SELECT configVal FROM configtbl WHERE configKey=?;"), &stmt, NULL); if (rc != SQLITE_OK) {return result;} } else sqlite3_reset(stmt); rc = sqlite3_bind_text(stmt, 1, key, strlen(key), SQLITE_STATIC); if (rc != SQLITE_OK) {return result;} rc = sqlite3_step(stmt); if (rc != SQLITE_ROW) {return result;} result = (const char*) sqlite3_column_text(stmt, 0); return result; } sqlqueryresultlist sqlquery::search_funclist_filename(const char* searchstr) { //printf("search_funclist_filename %s\n", searchstr); sqlqueryresultlist result; result.result_type = sqlqueryresultlist::sqlresultERROR; tStr srchterm("%"); srchterm.append(searchstr); if ((searchstr == NULL)||(strlen(searchstr) < 1)||(m_db == NULL)) return result; sqlite3_reset(m_funclistfilenamestmt.get()); int rc = sqlite3_bind_text(m_funclistfilenamestmt.get(), 1, srchterm.c_str(), srchterm.size(), SQLITE_STATIC); if (rc != SQLITE_OK) {printf("Err: %s\n", sqlite3_errmsg(m_db)); return result;} result = search_func_in_one_file(m_funclistfilenamestmt.get()); return result; } sqlqueryresultlist sqlquery::search_funclist_fileid(int& fileid) { //printf("search_funclist_fileid %d\n", fileid); sqlqueryresultlist result; result.result_type = sqlqueryresultlist::sqlresultERROR; if ((fileid < 0)||(m_db == NULL)) return result; sqlite3_reset(m_funclistfileidstmt.get()); int rc = sqlite3_bind_int(m_funclistfileidstmt.get(), 1, fileid); if (rc != SQLITE_OK) {printf("Err: %s\n", sqlite3_errmsg(m_db)); return result;} result = search_func_in_one_file(m_funclistfileidstmt.get()); return result; } tVecStr sqlquery::search_autocomplete(const char* searchstr) { tVecStr result; //int ctr = 0; if ((searchstr == NULL)||(strlen(searchstr) < 1)||(m_db == NULL)) return result; tStr srchterm = process_searchterm_autocomplete(searchstr); sqlite3_reset(m_autocompstmt.get()); int rc = sqlite3_bind_text(m_autocompstmt.get(), 1, srchterm.c_str(), srchterm.size(), SQLITE_STATIC); if (rc != SQLITE_OK) {printf("Err: %s\n", sqlite3_errmsg(m_db)); return result;} do { rc = sqlite3_step(m_autocompstmt.get()); if (rc == SQLITE_ROW) { result.push_back(tStr((const char*) sqlite3_column_text(m_autocompstmt.get(), 0))); //if (ctr++ > 300) rc = SQLITE_DONE; } } while (rc == SQLITE_ROW); if (rc != SQLITE_DONE) { printf("Err: %s\n", sqlite3_errmsg(m_db)); } return result; } sqlqueryresultlist sqlquery::search( tStr searchstr, sqlquery::en_queryType querytype, bool exactmatch, tStr filterstr) { sqlqueryresultlist result; int rc; bool twoTerms = true; result.result_type = sqlqueryresultlist::sqlresultERROR; if ((m_db == NULL)||(searchstr.empty())||(m_basepath.empty())) return result; tStr sqlqry, srchterm, filterterm; sqlqueryresultlist::en_resultType resultType = sqlqueryresultlist::sqlresultFULL; if (exactmatch && (querytype == sqlresultFUNCSINFILE)) {searchstr.insert(0, "%");} srchterm = process_searchterm(searchstr.c_str(), exactmatch); if (filterstr.empty()) {filterterm = "%";} else {filterterm = process_searchterm(filterstr.c_str(), false);} switch (querytype) { case sqlquerySYMBOL: sqlqry = exactmatch ? SQL_EM_SYM : SQL_SYM; break; case sqlresultFUNC_MACRO: sqlqry = exactmatch ? SQL_EM_FUNC_MACRO : SQL_FUNC_MACRO; break; case sqlresultCLASS_STRUCT: sqlqry = exactmatch ? SQL_EM_CLASS_STRUCT : SQL_CLASS_STRUCT; break; case sqlresultINCLUDE: sqlqry = exactmatch ? SQL_EM_INCLUDE : SQL_INCLUDE; resultType = sqlqueryresultlist::sqlresultFILE_LINE; twoTerms = false; break; case sqlresultFILEPATH: sqlqry = exactmatch ? SQL_EM_FILEPATH : SQL_FILEPATH; resultType = sqlqueryresultlist::sqlresultFILE_ONLY; twoTerms = false; break; case sqlresultCALLINGFUNC: sqlqry = exactmatch ? SQL_EM_CALLINGFUNC : SQL_CALLINGFUNC; break; case sqlresultCALLEDFUNC: sqlqry = exactmatch ? SQL_EM_CALLEDFUNC : SQL_CALLEDFUNC; break; case sqlresultCALLSOFFUNC: sqlqry = exactmatch ? SQL_EM_CALLS_OF_FUNC : SQL_CALLS_OF_FUNC; break; case sqlresultMEMBERS: sqlqry = exactmatch ? SQL_EM_MEMBERS : SQL_MEMBERS; break; case sqlresultOWNERCLASS: sqlqry = exactmatch ? SQL_EM_OWNERCLASS : SQL_OWNERCLASS; break; case sqlresultPARENTCLASS: sqlqry = exactmatch ? SQL_EM_PARENTCLASS : SQL_PARENTCLASS; break; case sqlresultCHILDCLASS: sqlqry = exactmatch ? SQL_EM_CHILDCLASS : SQL_CHILDCLASS; break; case sqlresultFUNCSINFILE: sqlqry = SQL_FUNCSINFILE; twoTerms = false; break; case sqlresultAUTOCOMPLETE: resultType = sqlqueryresultlist::sqlresultSYM_ONLY; twoTerms = false; break; default: result.sqlerrmsg = "Unknown search type"; return result; } if (m_searchstmt.qry.compare(sqlqry) != 0) { sqlite3_finalize(m_searchstmt.get()); rc = sqlite3_prepare_v2(m_db, sqlqry.c_str(), sqlqry.size(), &(m_searchstmt.m_stmt), NULL); m_searchstmt.qry = (rc == SQLITE_OK) ? sqlqry : ""; } else { rc = sqlite3_reset(m_searchstmt.get()); } if (rc != SQLITE_OK) {result.sqlerrmsg = sqlite3_errmsg(m_db); return result;} rc = sqlite3_bind_text(m_searchstmt.get(), 1, srchterm.c_str(), srchterm.size(), SQLITE_TRANSIENT); if (rc != SQLITE_OK) {result.sqlerrmsg = sqlite3_errmsg(m_db); return result;} if (twoTerms) { rc = sqlite3_bind_text(m_searchstmt.get(), 2, filterterm.c_str(), filterterm.size(), SQLITE_TRANSIENT); if (rc != SQLITE_OK) {result.sqlerrmsg = sqlite3_errmsg(m_db); return result;} } if (resultType == sqlqueryresultlist::sqlresultFULL) result = search_full(m_searchstmt.get()); else if (resultType == sqlqueryresultlist::sqlresultFILE_LINE) result = search_file_line(m_searchstmt.get()); else if (resultType == sqlqueryresultlist::sqlresultFILE_ONLY) result = search_file_only(m_searchstmt.get()); return result; } tStr sqlquery::process_searchterm(const char* searchterm, const bool& exactmatch) { tStr srchterm, srchterm2; if (!exactmatch) { srchterm2 = add_escape_char(searchterm, '%', ';').c_str(); srchterm2 = add_escape_char( srchterm2.c_str(), '_', ';').c_str(); srchterm = "%"; srchterm += srchterm2; srchterm += "%"; replacechar( srchterm.begin(), srchterm.end(), '*', '%'); replacechar( srchterm.begin(), srchterm.end(), '?', '_'); } else srchterm = searchterm; return srchterm; } tStr sqlquery::process_searchterm_autocomplete(const char* searchterm) { tStr srchterm(searchterm); srchterm += "%"; replacechar( srchterm.begin(), srchterm.end(), '*', '%'); replacechar( srchterm.begin(), srchterm.end(), '?', '_'); return srchterm; } sqlqueryresultlist sqlquery::search_declaration(const char* searchstr) { int rc; sqlqueryresultlist result; tStr fp; sqlite3_stmt* stmt = m_declarationstmt.get(); if ((searchstr == NULL)||(strlen(searchstr) < 1)||(m_db == NULL)) return result; result.result_type = sqlqueryresultlist::sqlresultERROR; sqlqueryresult item; sqlite3_reset(stmt); rc = sqlite3_bind_text(stmt, 1, searchstr, strlen(searchstr), SQLITE_STATIC); if (rc != SQLITE_OK) {printf("Err: %s\n", sqlite3_errmsg(m_db)); return result;} do { rc = sqlite3_step(stmt); if (rc == SQLITE_ROW) { item.symname = (const char*) sqlite3_column_text(stmt, 0); item.symtype = (const char*) sqlite3_column_text(stmt, 1); fp = (const char*) sqlite3_column_text(stmt, 2); item.linenum = (const char*) sqlite3_column_text(stmt, 3); item.linetext = (const char*) sqlite3_column_text(stmt, 4); item.filename = extract_filename(fp.c_str()); if (isAbsolutePath(fp) == false) { item.filepath = m_basepath; item.filepath += DIRSEP; item.filepath += fp; } else item.filepath = fp; result.resultlist.push_back(item); } } while (rc == SQLITE_ROW); if (rc != SQLITE_DONE) { result.result_type = sqlqueryresultlist::sqlresultERROR; result.sqlerrmsg = sqlite3_errmsg(m_db); } else { result.result_type = sqlqueryresultlist::sqlresultFULL; } return result; } sqlqueryresultlist sqlquery::search_full(sqlite3_stmt* stmt) { int rc; sqlqueryresultlist result; tStr fp; result.result_type = sqlqueryresultlist::sqlresultERROR; sqlqueryresult item; do { rc = sqlite3_step(stmt); if (rc == SQLITE_ROW) { item.symname = (const char*) sqlite3_column_text(stmt, 0); item.symtype = (const char*) sqlite3_column_text(stmt, 1); fp = (const char*) sqlite3_column_text(stmt, 2); item.linenum = (const char*) sqlite3_column_text(stmt, 3); item.linetext = (const char*) sqlite3_column_text(stmt, 4); item.fileid = sqlite3_column_int (stmt, 5); item.filename = extract_filename(fp.c_str()); if (isAbsolutePath(fp) == false) { item.filepath = m_basepath; item.filepath += DIRSEP; item.filepath += fp; } else item.filepath = fp; result.resultlist.push_back(item); } } while (rc == SQLITE_ROW); if (rc != SQLITE_DONE) { result.result_type = sqlqueryresultlist::sqlresultERROR; result.sqlerrmsg = sqlite3_errmsg(m_db); } else { result.result_type = sqlqueryresultlist::sqlresultFULL; } return result; } sqlqueryresultlist sqlquery::search_func_in_one_file(sqlite3_stmt* stmt) { int rc; sqlqueryresultlist result; tStr fp; result.result_type = sqlqueryresultlist::sqlresultERROR; sqlqueryresult item; do { rc = sqlite3_step(stmt); if (rc == SQLITE_ROW) { item.symname = (const char*) sqlite3_column_text(stmt, 0); fp = (const char*) sqlite3_column_text(stmt, 1); item.linenum = (const char*) sqlite3_column_text(stmt, 2); item.filename = extract_filename(fp.c_str()); item.intLinenum = atoi(item.linenum.c_str()); item.symname2 = item.symname; std::transform(item.symname2.begin(), item.symname2.end(), item.symname2.begin(), ::tolower); if (isAbsolutePath(fp) == false) { item.filepath = m_basepath; item.filepath += DIRSEP; item.filepath += fp; } else item.filepath = fp; result.resultlist.push_back(item); } } while (rc == SQLITE_ROW); if (rc != SQLITE_DONE) { result.result_type = sqlqueryresultlist::sqlresultERROR; result.sqlerrmsg = sqlite3_errmsg(m_db); } else { result.result_type = sqlqueryresultlist::sqlresultFUNC_IN_ONE_FILE; } return result; } sqlqueryresultlist sqlquery::search_file_line(sqlite3_stmt* stmt) { int rc; sqlqueryresultlist result; tStr fp; result.result_type = sqlqueryresultlist::sqlresultERROR; sqlqueryresult item; do { rc = sqlite3_step(stmt); if (rc == SQLITE_ROW) { fp = (const char*) sqlite3_column_text(stmt, 0); item.linenum = (const char*) sqlite3_column_text(stmt, 1); item.linetext = (const char*) sqlite3_column_text(stmt, 2); item.fileid = sqlite3_column_int (stmt, 3); item.filename = extract_filename(fp.c_str()); if (isAbsolutePath(fp) == false) { item.filepath = m_basepath; item.filepath += DIRSEP; item.filepath += fp; } else item.filepath = fp; result.resultlist.push_back(item); } } while (rc == SQLITE_ROW); if (rc != SQLITE_DONE) { result.result_type = sqlqueryresultlist::sqlresultERROR; result.sqlerrmsg = sqlite3_errmsg(m_db); } else { result.result_type = sqlqueryresultlist::sqlresultFILE_LINE; } return result; } sqlqueryresultlist sqlquery::search_file_only(sqlite3_stmt* stmt) { int rc; sqlqueryresultlist result; tStr fp; result.result_type = sqlqueryresultlist::sqlresultERROR; sqlqueryresult item; do { rc = sqlite3_step(stmt); if (rc == SQLITE_ROW) { fp = (const char*) sqlite3_column_text(stmt, 0); item.linenum = "1"; item.filename = extract_filename(fp.c_str()); if (isAbsolutePath(fp) == false) { item.filepath = m_basepath; item.filepath += DIRSEP; item.filepath += fp; } else item.filepath = fp; result.resultlist.push_back(item); } } while (rc == SQLITE_ROW); if (rc != SQLITE_DONE) { result.result_type = sqlqueryresultlist::sqlresultERROR; result.sqlerrmsg = sqlite3_errmsg(m_db); } else { result.result_type = sqlqueryresultlist::sqlresultFILE_ONLY; } return result; } codequery-0.18.1/querylib/sqlquery.h000066400000000000000000000077501300045745200175040ustar00rootroot00000000000000 // Library to query CodeQuery database files // // This library is MIT-licensed, so that it may be used to create plugins // for editors, IDEs and other software without license restrictions // // This license applies only to this file: // // Copyright (c) 2011 ruben2020 https://github.com/ruben2020/ // // Permission is hereby granted, free of charge, to any person obtaining a copy // of this software and associated documentation files (the "Software"), to // deal in the Software without restriction, including without limitation the // rights to use, copy, modify, merge, publish, distribute, sublicense, and/or // sell copies of the Software, and to permit persons to whom the Software is // furnished to do so, subject to the following conditions: // // The above copyright notice and this permission notice shall be included in // all copies or substantial portions of the Software. // // THE SOTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING // FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS // IN THE SOFTWARE. // #ifndef SQLQUERY_H_CQ #define SQLQUERY_H_CQ #include "small_lib.h" // forward declaration struct sqlite3; struct sqlite3_stmt; class tempstmt { public: sqlite3_stmt *m_stmt; tStr qry; tempstmt(); ~tempstmt(); void finalize(void); sqlite3_stmt* get(void); }; class sqlqueryresult { public: tStr symname; tStr symname2; tStr symtype; tStr linenum; unsigned int intLinenum; tStr filename; tStr filepath; int fileid; tStr linetext; sqlqueryresult() : linenum((const char*)"1"), fileid(-99){} }; class sqlqueryresultlist { public: enum en_resultType { sqlresultFULL = 0, sqlresultFILE_LINE, sqlresultFILE_ONLY, sqlresultSYM_ONLY, sqlresultFUNC_IN_ONE_FILE, sqlresultERROR }; en_resultType result_type; std::vector resultlist; sqlqueryresultlist(); sqlqueryresultlist(const sqlqueryresultlist& copy); sqlqueryresultlist& operator= (const sqlqueryresultlist& copy); void sort_by_name(void); void sort_by_linenum(void); tStr sqlerrmsg; }; class sqlquery { public: enum en_queryType { sqlquerySYMBOL = 0, sqlresultFUNC_MACRO, sqlresultCLASS_STRUCT, sqlresultINCLUDE, sqlresultFILEPATH, sqlresultCALLINGFUNC, sqlresultCALLEDFUNC, sqlresultCALLSOFFUNC, sqlresultMEMBERS, sqlresultOWNERCLASS, sqlresultCHILDCLASS, sqlresultPARENTCLASS, sqlresultFUNCSINFILE, sqlresultGREP, sqlresultAUTOCOMPLETE, sqlresultDEFAULT = 100 }; enum en_filereadstatus { sqlfileOK = 0, sqlfileOPENERROR, sqlfileNOTCORRECTDB, sqlfileINCORRECTVER, sqlfileUNKNOWNERROR }; sqlquery(); ~sqlquery(); bool isDBOpen(void) {return (m_db != NULL);} en_filereadstatus open_dbfile(tStr dbfn); void close_dbfile(void); sqlqueryresultlist search(tStr searchstr, en_queryType querytype = sqlquerySYMBOL, bool exactmatch=false, tStr filterstr = ""); sqlqueryresultlist search_funclist_filename(const char* searchstr); sqlqueryresultlist search_funclist_fileid(int& fileid); tVecStr search_autocomplete(const char* searchstr); sqlqueryresultlist search_declaration(const char* searchstr); private: sqlite3 *m_db; tStr m_basepath; tempstmt m_declarationstmt; tempstmt m_autocompstmt; tempstmt m_funclistfilenamestmt; tempstmt m_funclistfileidstmt; tempstmt m_searchstmt; sqlqueryresultlist search_full(sqlite3_stmt* stmt); sqlqueryresultlist search_file_line(sqlite3_stmt* stmt); sqlqueryresultlist search_file_only(sqlite3_stmt* stmt); sqlqueryresultlist search_func_in_one_file(sqlite3_stmt* stmt); tStr read_configtbl(const char *key, sqlite3_stmt *stmt); tStr process_searchterm(const char* searchterm, const bool& exactmatch); tStr process_searchterm_autocomplete(const char* searchstr); }; #endif codequery-0.18.1/release.json000066400000000000000000000006021300045745200161120ustar00rootroot00000000000000{ "version": "0.18.0", "state": "stable", "scope": "minor feature", "changes": "Migrated from GPLv3 to GPLv2 because some companies ban GPLv3 software, List of functions in the file viewer area is a major new feature, Now the selection of one or two levels has been added for function call graphs", "download": "https://sourceforge.net/projects/codequery/files/" } codequery-0.18.1/showgraph/000077500000000000000000000000001300045745200156035ustar00rootroot00000000000000codequery-0.18.1/showgraph/CMakeLists.txt000066400000000000000000000064161300045745200203520ustar00rootroot00000000000000cmake_minimum_required(VERSION 2.8.12) project(ShowGraph) #ADD_DEFINITIONS( -Wall ) # with SET() command you can change variables or define new ones # here we define SHOWGRAPH_SRCS variable that contains a list of all .cpp files # note that we don't need \ at the end of line SET( SHOWGRAPH_SRCS ./showgraph.cpp ./Utils/mem_mgr.cpp ./Utils/mem_utest.cpp ./Utils/conf.cpp ./Utils/list_utest.cpp ./Utils/utils_utest.cpp ./Utils/utils.cpp ./Utils/conf_utest.cpp ./Utils/mem_pool.cpp ./Layout/node_group.cpp ./Layout/aux_graph.cpp ./Layout/layout.cpp ./Graph/graph.cpp ./Graph/node.cpp ./Graph/edge.cpp ./GraphView/edge_item.cpp ./GraphView/style_edit.cpp ./GraphView/graph_view.cpp ./GraphView/visible_edge.cpp ./GraphView/node_item.cpp ./GraphView/edge_helper.cpp ./GraphView/navigation.cpp ) # another list, this time it includes all header files that should be treated with moc SET( SHOWGRAPH_MOC_HDRS ./Layout/aux_graph.h ./GraphView/graph_view.h ./GraphView/style_edit.h ) INCLUDE_DIRECTORIES( "${CMAKE_CURRENT_BINARY_DIR}" ) INCLUDE_DIRECTORIES( "." ) INCLUDE_DIRECTORIES( "./Graph" ) INCLUDE_DIRECTORIES( "./GraphView" ) INCLUDE_DIRECTORIES( "./Layout" ) INCLUDE_DIRECTORIES( "./Utils" ) if (BUILD_QT5) # this command finds Qt4 libraries and sets all required variables # note that it's Qt4, not QT4 or qt4 FIND_PACKAGE( Qt5Widgets 5.2.1 REQUIRED ) FIND_PACKAGE( Qt5Concurrent REQUIRED ) FIND_PACKAGE( Qt5Xml REQUIRED ) add_definitions( -DUSE_QT5 ) set_target_properties(Qt5::Core PROPERTIES MAP_IMPORTED_CONFIG_COVERAGE "RELEASE") SET(CMAKE_AUTOMOC ON) SET(CMAKE_INCLUDE_CURRENT_DIR ON) # this command will generate rules that will run rcc on all files from CODEQUERY_RCS # in result CODEQUERY_RC_SRCS variable will contain paths to files produced by rcc # QT4_ADD_RESOURCES( CODEQUERY_RC_SRCS ${CODEQUERY_RCS} ) # we need this to be able to include headers produced by uic in our code # (CMAKE_BINARY_DIR holds a path to the build directory, while INCLUDE_DIRECTORIES() works just like INCLUDEPATH from qmake) INCLUDE_DIRECTORIES( "${Qt5Widgets_INCLUDE_DIRS}" ) INCLUDE_DIRECTORIES( "${Qt5Xml_INCLUDE_DIRS}" ) add_library( cqshowgraph-qt5 STATIC ${SHOWGRAPH_SRCS} ${SHOWGRAPH_MOC_SRCS} ) target_link_libraries( cqshowgraph-qt5 Qt5::Widgets Qt5::Concurrent Qt5::Xml ) else (BUILD_QT5) # by default only QtCore and QtGui modules are enabled # other modules must be enabled like this: SET( QT_USE_QTXML TRUE ) #SET( QT_USE_QTSQL TRUE ) # this command finds Qt4 libraries and sets all required variables # note that it's Qt4, not QT4 or qt4 FIND_PACKAGE( Qt4 REQUIRED ) # add some useful macros and variables # (QT_USE_FILE is a variable defined by FIND_PACKAGE( Qt4 ) that contains a path to CMake script) INCLUDE( "${QT_USE_FILE}" ) # this command will generate rules that will run rcc on all files from CODEQUERY_RCS # in result CODEQUERY_RC_SRCS variable will contain paths to files produced by rcc # QT4_ADD_RESOURCES( CODEQUERY_RC_SRCS ${CODEQUERY_RCS} ) # and finally this will run moc: QT4_WRAP_CPP( SHOWGRAPH_MOC_SRCS ${SHOWGRAPH_MOC_HDRS} ) add_library( cqshowgraph STATIC ${SHOWGRAPH_SRCS} ${SHOWGRAPH_MOC_SRCS} ) target_link_libraries( cqshowgraph ${QT_LIBRARIES} ) endif (BUILD_QT5) codequery-0.18.1/showgraph/Graph/000077500000000000000000000000001300045745200166445ustar00rootroot00000000000000codequery-0.18.1/showgraph/Graph/README.txt000066400000000000000000000027151300045745200203470ustar00rootroot00000000000000Copyright (c) 2014, Boris Shurygin All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. codequery-0.18.1/showgraph/Graph/agraph.h000066400000000000000000000151431300045745200202630ustar00rootroot00000000000000/** * @file: agraph.h * Abstract Graph for testing of graph's properties and usage model. * * @defgroup AGr Test Graph * * @ingroup GraphBase * AGraph, ANode and AEdge classes present mimnimal code * that you need to write to employ Graph Library functionality. * AGraph classes differ from base in only one member of ( int) type */ /* * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #ifndef AGRAPH_H #define AGRAPH_H /* Predeclarations */ class ANode; class AEdge; class AGraph; /** * Abstract node * * @ingroup AGr */ class ANode: public Node { int dummy; /** We can't create nodes separately, do it through newNode method of graph */ ANode( AGraph *graph_p, int _id); friend class AGraph; public: /** Get next graph's node */ inline ANode* nextNode() { return static_cast< ANode*>( Node::nextNode()); } /** Get prev graph's node */ inline ANode* prevNode() { return static_cast< ANode*>( Node::prevNode()); } /** Edge connection reimplementation */ inline void AddEdgeInDir( AEdge *edge, GraphDir dir); /** Add predecessor */ inline void AddPred( AEdge *edge); /** Add successor */ inline void AddSucc( AEdge *edge); /** Get first edge in given direction */ inline AEdge* firstEdgeInDir( GraphDir dir); /** Get first successor */ inline AEdge* firstSucc(); /** Get first predecessor */ inline AEdge* firstPred(); }; /** * Abstract edge * * @ingroup AGr */ class AEdge: public Edge { int dummy; /** Constructors are made private, only nodes and graph can create edges */ AEdge( AGraph *graph_p, int _id, ANode *_pred, ANode* _succ); friend class AGraph; friend class ANode; public: /** Get node in given direction */ inline ANode *node( GraphDir dir) const { return static_cast< ANode *>( Edge::node( dir)); } /** Get predecessor */ inline ANode *pred() const { return node( GRAPH_DIR_UP); } /** Get successor */ inline ANode *succ() const { return node( GRAPH_DIR_DOWN); } /** insert node on this edge */ virtual ANode *insertNode() { return static_cast< ANode *>( Edge::insertNode()); } /** Next edge in graph's list */ inline AEdge* nextEdge() { return static_cast< AEdge *>( Edge::nextEdge()); } /** Next edge in give direction */ inline AEdge* nextEdgeInDir( GraphDir dir) { return static_cast< AEdge *>( Edge::nextEdgeInDir( dir)); } /** Next successor */ inline AEdge* nextSucc() { return nextEdgeInDir( GRAPH_DIR_DOWN); } /** Next predecessor */ inline AEdge* nextPred() { return nextEdgeInDir( GRAPH_DIR_UP); } }; /** * Testing-purpose graph * * @ingroup AGr */ class AGraph: public Graph { int dummy; //Dummy class member /** Node creation overload */ Node * createNode( int _id); /** Edge creation overload */ Edge * createEdge( int _id, Node *_pred, Node* _succ); public: /** New graphical node */ ANode* newNode() { return static_cast< ANode*>( Graph::newNode()); } /** New graphical edge */ AEdge* newEdge( ANode* pred, ANode* succ) { return static_cast< AEdge *>( Graph::newEdge( pred, succ)); } /** Get graph's first edge */ inline AEdge* firstEdge() { return static_cast< AEdge *>( Graph::firstEdge()); } /** Get graph's first node */ inline ANode* firstNode() { return static_cast< ANode *>( Graph::firstNode()); } /** Pools' creation routine */ void createPools() { node_pool = new FixedPool< ANode>(); edge_pool = new FixedPool< AEdge>(); } /** Constructor */ AGraph( bool create_pools): Graph( false) { if ( create_pools) createPools(); } }; /** Node constructor */ inline ANode::ANode( AGraph *graph_p, int _id): Node( graph_p, _id) { } /** Edge constructor */ inline AEdge::AEdge( AGraph *graph_p, int _id, ANode *_pred, ANode* _succ): Edge( graph_p, _id, _pred, _succ) { } /** Node creation overload */ inline Node * AGraph::createNode( int _id) { return new ( nodePool()) ANode( this, _id); } /** Edge creation overload */ inline Edge * AGraph::createEdge( int _id, Node *_pred, Node* _succ) { return new ( edgePool()) AEdge( this, _id, static_cast( _pred), static_cast< ANode *>(_succ)); } /** Get first edge in given direction */ inline AEdge* ANode::firstEdgeInDir( GraphDir dir) { return static_cast< AEdge*>( Node::firstEdgeInDir( dir)); } /** Get first successor */ inline AEdge* ANode::firstSucc() { return firstEdgeInDir( GRAPH_DIR_DOWN); } /** Get first predecessor */ inline AEdge* ANode::firstPred() { return firstEdgeInDir( GRAPH_DIR_UP); } /** Edge connection reimplementation */ inline void ANode::AddEdgeInDir( AEdge *edge, GraphDir dir) { Node::AddEdgeInDir( edge, dir); } /** Add predecessor */ inline void ANode::AddPred( AEdge *edge) { AddEdgeInDir( edge, GRAPH_DIR_UP); } /** Add successor */ inline void ANode::AddSucc( AEdge *edge) { AddEdgeInDir( edge, GRAPH_DIR_DOWN); } #endif codequery-0.18.1/showgraph/Graph/edge.cpp000066400000000000000000000054621300045745200202630ustar00rootroot00000000000000/** * @file: edge.cpp * Edge class implementation */ /* * Graph library, internal representation of graphs in ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #include "graph_iface.h" /** * Edge destructor. * delete edge from graph's list of edges */ Edge::~Edge() { //out("Deleted edge"); element.parentNode().removeChild( element); graph_p->detachEdge( this); detachFromNode( GRAPH_DIR_UP); detachFromNode( GRAPH_DIR_DOWN); } /** * Print edge in DOT format to stdout */ void Edge::debugPrint() { /** * Check that edge is printable * TODO: Implements graph states and in 'in process' state print node as '?' * Examples of such prints: 4->? ?->3 ?->? */ assert( isNotNullP( pred())); assert( isNotNullP( succ())); out("%llu->%llu;", pred()->id(), succ()->id()); } /** * Update DOM tree element */ void Edge::updateElement() { element.setAttribute( "source", pred()->id()); element.setAttribute( "target", succ()->id()); } /** * read properties from DOM tree element */ void Edge::readFromElement( QDomElement e) { element = e; } /** Node checking routine */ bool Edge::checkNodes( Node* _pred, Node* _succ) { return isNotNullP( _pred) && isNotNullP( _succ) && areEqP( this->graph(), _pred->graph()) && areEqP( _pred->graph(), _succ->graph()); } codequery-0.18.1/showgraph/Graph/edge.h000066400000000000000000000150031300045745200177200ustar00rootroot00000000000000/** * @file: edge.h * Edge class definition */ /* * Graph library, internal representation of graphs in ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #ifndef EDGE_H #define EDGE_H /** * Edge lists identificators * @ingroup GraphBase */ enum EdgeListType { EDGE_LIST_PREDS, EDGE_LIST_SUCCS, EDGE_LIST_GRAPH, EDGE_LISTS_NUM }; /** * @class Edge * @brief Representation of graph edge * @ingroup GraphBase * * @par * Edge class implements basic concept of graph edge. Every edge has two adjacent nodes. * Use pred() and succ() routines to get them. Edge is a member of 3 lists: edge list in graph, * pred list in succ node and succ list in pred node. To traverse these lists use nextEdge(), * nextPred() and nextSucc() routines. Also for debug purposes all edges in a graph * have unique id, which can be usefull for printing to console or setting breakpoint conditions. * * @par * An edge can be @ref Marked "marked" and @ref Numbered "numbered". @ref Mark "Markers" and * @ref Nums "numerations" are managed by @ref Graph "graph". Note that @ref Node "nodes" can be marked with the * same marker or numbered in the same numeration. * Also for debug purposes all nodes in a graph * have unique id, which can be usefull for printing to console or setting breakpoint conditions. * * @par * Edges reside in memory pool that is controlled by Graph. Operator new can't be called * directly. Edges can be only created by calling Graph::newEdge(). * * @par * Every edge have associated QDomElement for XML export support. The updateElement() routine should be called before * export to get element in sync with edge's properties. * * @sa Graph * @sa Node * @sa Mark * @sa Nums */ class Edge: public MListIface< Edge, // List item MListItem< EDGE_LISTS_NUM>, // base class: pure multi-list item EDGE_LISTS_NUM >, // Lists number public Marked, public Numbered, public PoolObj { public: /** Get edge's unique ID */ inline GraphUid id() const; /** Get edge's graph */ inline Graph * graph() const; /** * Destructor. * Delete edge from list in graph. * Deletion from node lists MUST be performed manually. */ virtual ~Edge(); /** * Connect edge to a node in specified direction. * Note that node treats this edge in opposite direction. I.e. an edge that has node in * GRAPH_DIR_UP is treated as edge in GRAPH_DIR_DOWN directions inside that node */ inline void setNode( Node *n, GraphDir dir); /** Connect edge with given node as a predecessor */ inline void setPred( Node *n); /** Connect edge with given node as a successor */ inline void setSucc( Node *n); /** Get node in specified direction */ inline Node *node( GraphDir dir) const; inline Node *pred() const;/**< Get predecessor node of edge */ inline Node *succ() const;/**< Get successor node of edge */ /** Return next edge of the graph */ inline Edge* nextEdge(); /** Return next edge of the same node in given direction */ inline Edge* nextEdgeInDir( GraphDir dir); inline Edge* nextSucc();/**< Next successor */ inline Edge* nextPred();/**< Next predecessor */ /** Print edge in dot fomat to stdout */ virtual void debugPrint(); /** Return corresponding document element */ inline QDomElement elem() const; /** Set document element */ inline void setElement( QDomElement elem); /** Update DOM element */ virtual void updateElement(); /** Read properties from XML */ virtual void readFromElement( QDomElement elem); /** * Insert a node on this edge * * Creates a node on edge and a new edge from new node to former successor of original edge. * Original edge goes to new node. * Return new node. */ virtual Node *insertNode(); private: /** Representation in document */ QDomElement element; /** Graph part */ GraphUid uid; //Unique ID Graph * graph_p; //Graph /** Nodes */ Node *nodes[ GRAPH_DIRS_NUM]; //Adjacent nodes /** Node checking routine */ bool checkNodes( Node* _pred, Node* _succ); protected: /** Graph should have access to Edge's members */ friend class Graph; /** Node should have access to Edge's members */ friend class Node; /** Constructors are made private, only nodes and graph can create edges */ Edge( Graph *_graph_p, GraphUid _id, Node *_pred, Node* _succ): uid(_id), graph_p(_graph_p) { GRAPH_ASSERTD( checkNodes( _pred, _succ), "Predecessor and sucessor used in edge construction belong to different graphs"); setPred( _pred); setSucc( _succ); } /** * Detach edge from a node. * Made private as it is low-level routine needed for implementation of edge-node relationship */ inline void detachFromNode( GraphDir dir); /** * Remove myself from graph's list of edges */ inline void detachFromGraph() { detach( EDGE_LIST_GRAPH); } }; #endif codequery-0.18.1/showgraph/Graph/edge_inline.h000066400000000000000000000112221300045745200212550ustar00rootroot00000000000000/** * @file: edge.h * Implementation of Edge class inline routines */ /* * Graph library, internal representation of graphs in ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #ifndef EDGE_INLINE_H #define EDGE_INLINE_H /** * Low level correction of node's edge list in corresponding direction */ inline void Edge::detachFromNode( GraphDir dir) { if ( isNotNullP( node( dir))) { Node *n = node( dir); n->deleteEdgeInDir( RevDir( dir), (Edge* )this); detach( RevDir( dir)); nodes[ dir] = 0; } } /** * Connect edge to a node in specified direction. * Note that node treats this edge in opposite direction. I.e. an edge that has node in * GRAPH_DIR_UP is treated as edge in GRAPH_DIR_DOWN directions inside that node */ inline void Edge::setNode( Node *n, GraphDir dir) { assert( isNotNullP( n)); nodes[ dir] = n; if ( n != NULL) { n->AddEdgeInDir( (Edge *)this, ((dir == GRAPH_DIR_UP)? GRAPH_DIR_DOWN : GRAPH_DIR_UP)); } } /** * Return corresponding document element */ inline QDomElement Edge::elem() const { return element; } /** * Set document element */ inline void Edge::setElement( QDomElement elem) { element = elem; } /** * Get edge's unique ID */ inline GraphUid Edge::id() const { return uid; } /** * Get edge's corresponding graph */ inline Graph * Edge::graph() const { return graph_p; } /** * Connect edge with given node as a predecessor */ inline void Edge::setPred( Node *n) { setNode( n, GRAPH_DIR_UP); } /** * Connect edge with given node as a successor */ inline void Edge::setSucc( Node *n) { setNode( n, GRAPH_DIR_DOWN); } /** * Get node in specified direction */ inline Node *Edge::node( GraphDir dir) const { return nodes[ dir]; } /** * Get predecessor of edge */ inline Node *Edge::pred() const { return node( GRAPH_DIR_UP); } /** * Get successor of edge */ inline Node *Edge::succ() const { return node( GRAPH_DIR_DOWN); } /** * Return next edge of the graph */ inline Edge* Edge::nextEdge() { return next( EDGE_LIST_GRAPH); } /** * Return next edge of the same node in given direction */ inline Edge* Edge::nextEdgeInDir( GraphDir dir) { GRAPH_ASSERTD( dir < GRAPH_DIRS_NUM, "Wrong direction parameter"); GRAPH_ASSERTD( (int) GRAPH_DIR_DOWN == (int) EDGE_LIST_SUCCS, "Enums of direction and edge lists are not having right values"); GRAPH_ASSERTD( (int) GRAPH_DIR_UP == (int) EDGE_LIST_PREDS, "Enums of direction and edge lists are not having right values"); return next( dir); } /** * Next successor */ inline Edge* Edge::nextSucc() { return nextEdgeInDir( GRAPH_DIR_DOWN); } /** * Next predecessor */ inline Edge* Edge::nextPred() { return nextEdgeInDir( GRAPH_DIR_UP); } /** * Insert a node on this edge * * Creates a node on edge and a new edge from new node to former successor of original edge. * Original edge goes to new node. * Return new node. */ inline Node * Edge::insertNode() { Node *tmp_succ = succ(); Node *new_node = graph()->newNode(); detachFromNode( GRAPH_DIR_DOWN); setSucc( new_node); graph()->newEdge( new_node, tmp_succ); return new_node; } #endifcodequery-0.18.1/showgraph/Graph/graph.cpp000066400000000000000000000141731300045745200204570ustar00rootroot00000000000000/** * @file: graph.cpp * Graph class implementation */ /* * Graph library, internal representation of graphs in ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #include "graph_iface.h" /** * Constructor. */ Graph::Graph( bool create_pools): node_next_id( 0), edge_next_id( 0), node_num( 0), edge_num( 0), first_node( NULL), first_edge( NULL), node_pool( NULL), edge_pool( NULL) { QDomElement root = createElement("graph"); appendChild( root); if ( create_pools) createPools(); } /** * Destructor - removes all nodes */ Graph::~Graph() { for ( Node *node = firstNode(); isNotNullP( node); ) { Node* next = node->nextNode(); deleteNode( node); node = next; } destroyPools(); } /** Pools' creation routine */ void Graph::createPools() { node_pool = new FixedPool< Node>(); edge_pool = new FixedPool< Edge>(); } /** Pools' destruction routine */ void Graph::destroyPools() { delete node_pool; delete edge_pool; } /** * Build graph from XML description */ void Graph::readFromXML( QString filename) { QFile file( filename); if ( !file.open( QIODevice::ReadOnly)) return; if ( !setContent( &file)) { GRAPH_ASSERTD( 0, "Not a good-formated xml file"); file.close(); return; } file.close(); /** * Read nodes and create them */ QDomElement docElem = documentElement(); QDomNode n = docElem.firstChild(); QHash< GraphUid, Node *> n_hash; while ( !n.isNull()) { QDomElement e = n.toElement(); // try to convert the DOM tree node to an element. if ( !e.isNull() && e.tagName() == QString( "node")) { Node *node = newNode( e); node->readFromElement( e); n_hash[ e.attribute( "id").toLongLong()] = node; } n = n.nextSibling(); } n = docElem.firstChild(); while ( !n.isNull()) { QDomElement e = n.toElement(); // try to convert the DOM tree node to an element. if ( !e.isNull() && e.tagName() == QString( "edge")) { GraphUid pred_id = e.attribute( "source").toLongLong(); GraphUid succ_id = e.attribute( "target").toLongLong(); Node *pred = n_hash[ pred_id]; Node *succ = n_hash[ succ_id]; Edge *edge = newEdge( pred, succ, e); edge->readFromElement( e); } n = n.nextSibling(); } } /** Node/Edge creation routines can be overloaded by derived class */ Node * Graph::createNode( int _id) { return new ( node_pool) Node ( this, _id); } Edge * Graph::createEdge( int _id, Node *_pred, Node* _succ) { return new ( edge_pool) Edge( this, _id, _pred, _succ); } /** * Print graph to stdout in DOT format. * Note: Iterates through nodes and edges separately instead * of iterating through nodes and at iterating through edges of each node */ void Graph::debugPrint() { Node *n; Edge *e; out( "digraph{"); /** Print nodes */ for ( n = firstNode(); isNotNullP( n); n = n->nextNode()) { n->debugPrint(); } /** Print edges */ for ( e = firstEdge(); isNotNullP( e); e = e->nextEdge()) { e->debugPrint(); } out( "}"); } /** * Implementation for numerations cleanup */ void Graph::clearNumerationsInObjects() { Node *n; Edge *e; /** Clean markers in nodes */ for ( n = firstNode(); isNotNullP( n); n = n->nextNode()) { clearUnusedNumerations( n); } /** Clean markers in edges */ for ( e = firstEdge(); isNotNullP( e); e = e->nextEdge()) { clearUnusedNumerations( e); } } /** * Implementation for markers cleanup */ void Graph::clearMarkersInObjects() { Node *n; Edge *e; /** Clean markers in nodes */ for ( n = firstNode(); isNotNullP( n); n = n->nextNode()) { clearUnusedMarkers( static_cast(n)); } /** Clean markers in edges */ for ( e = firstEdge(); isNotNullP( e); e = e->nextEdge()) { clearUnusedMarkers( static_cast(n)); } } /** * Implementation of XML writing */ void Graph::writeToXML( QString filename) { QFile file( filename); if (!file.open(QFile::WriteOnly | QFile::Text)) { assert( 0); return; } /** Update element for each node */ for ( Node *n = firstNode(); isNotNullP( n); n = n->nextNode()) { n->updateElement(); } /** Update element for each edge */ for ( Edge *e = firstEdge(); isNotNullP( e); e = e->nextEdge()) { e->updateElement(); } QTextStream out( &file); save(out, IndentSize); }codequery-0.18.1/showgraph/Graph/graph.h000066400000000000000000000174431300045745200201270ustar00rootroot00000000000000/** * @file: graph.h * Graph class definition/implementation. */ /* * Graph library, internal representation of graphs in ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #ifndef GRAPH_H #define GRAPH_H /** * @class Graph * @brief Basic representation of graph * @ingroup GraphBase * * @par * The Graph class represents graph as a whole. As one can expect graph has @ref Node "nodes" * and @ref Edge edges which impement the directed graph data structure. For traversing nodes * and edges they are linked in two lists. One can traverse these lists using firstNode() and firstEdge() * routines with calling Node::nextNode() Edge::nextEdge() in a loop. * Example: * @code //Traversing nodes for ( Node *n = firstNode(); isNotNullP( n); n = n->nextNode()) { ... } //Traversing edges for ( Node *e = firstEdge(); isNotNullP( e); e = e->nextEdge()) { ... } @endcode * The same result can be achieved using macros * @code // Graph *g; Node *n; Edge *e; // Traversing nodes foreachNode( n, g) { ... } // Traversing edges foreachEdge( e, g) { ... } @endcode * * @par * The graph is also owner of memory allocated for its nodes and edges. This is * implemented via @ref FixedPool "memory pools" with records of fixed size. Nodes and * Edges should be created through newNode() and newEdge() routines. They can be deleted by * deleteNode() and deleteEdge() routines. Do not use operators new/delete for graph's * nodes and edges. * * @par * Graph is also manager of @ref Mark "markers" and @ref Nums "numerations" for nodes and edges. * New @ref Marker "marker" can be obtained by newMarker() routine. New @ref Numeration "numeration" is * created by newNum(). * Example: * @code //Graph *graph; Node *n; Marker m = graph.newMarker(); Numeration num = graph.newNum(); GraphNum i = 0; //unsigned int 32 //Mark nodes without predecessors foreachNode( n, g) { if ( isNullP( n->firstPred())) { n->mark( m); n->setNumber( num, i++); } } ... //Checking markers and numbers foreachNode( n, g) { if ( n->isMarked( m) && n->number( num) > 10) { ... } } graph->freeMarker( m); graph->freeNum( num); @endcode * * @par Deriving classes from Graph * To make a graph-like data structure one can use Graph as a base class. Most likely * it will be also necessary to implement two more classes to make a useful implementation. * These two class should be derived from Node and Edge to represent information * associated with nodes and edges. You can see an example of such inheritance in AGraph, * ANode and AEdge classes. * * @sa Node * @sa Edge * @sa Mark * @sa Nums * @sa AGraph */ class Graph: public MarkerManager, public NumManager, public QDomDocument { public: /** * Constructor. * Derived classes may be call constructor with 'false' vaule of * the parameter to prevent pools creation for base-level nodes and edges. * In this case pool should be created by derived class itself. */ Graph( bool create_pools); /** Destructor */ virtual ~Graph(); /** Create new node in graph */ inline Node * newNode(); /** Create new node in graph and fills it with info in element */ inline Node * newNode( QDomElement e); /** * Create edge between two nodes. * We do not support creation of edge with undefined endpoints */ inline Edge * newEdge( Node * pred, Node * succ); /** * Create edge between two nodes from an XML description * We do not support creation of edge with undefined endpoints */ inline Edge * newEdge( Node * pred, Node * succ, QDomElement e); /** * Delete node. Substitution for node's operator delete, which shouldn't * be called directly since Node is a pool-residing object */ inline void deleteNode( void *n); /** * Delete node. Substitution for edges's operator delete, which shouldn't * be called directly since Edge is a pool-residing object */ inline void deleteEdge( void *e); /** Remove node from node list of graph */ inline void detachNode( Node* node); /** Remove edge from edge list of graph */ inline void detachEdge( Edge * edge); /** Return number of nodes in graph */ inline GraphNum nodeCount() const; /** Return number of edges in graph */ inline GraphNum edgeCount() const; /** Get first edge */ inline Edge* firstEdge(); /** Get first node */ inline Node* firstNode(); /** Print graph to stdout in DOT format */ virtual void debugPrint(); /** * Save graph as an XML file */ virtual void writeToXML( QString filename); /** * Build graph from XML description */ virtual void readFromXML( QString filename); protected: /** Node creation routine is to be overloaded by derived class */ virtual Node * createNode( int _id); /** Edge creation routine is to be overloaded by derived class */ virtual Edge * createEdge( int _id, Node *_pred, Node* _succ); /** Pools' creation routine */ virtual void createPools(); /** Pools' destruction routine */ virtual void destroyPools(); /** Get pool of nodes */ inline Pool *nodePool() const; /** Get pool of edges */ inline Pool *edgePool() const; /** Memory pool for nodes */ Pool *node_pool; /** Memory pool for edges */ Pool *edge_pool; private: /** * Implementation of node creation */ inline Node * newNodeImpl( GraphUid id); /** * Implementation of edge creation */ inline Edge * newEdgeImpl( Node * pred, Node * succ); /** Clear unused markers from marked objects */ void clearMarkersInObjects(); /** Clear unused numerations from numbered objects */ void clearNumerationsInObjects(); /** First node */ Node* first_node; /** Number of nodes */ GraphNum node_num; /** * Id of next node. Incremented each time you create a node, * needed for nodes to have unique id. In DEBUG mode node id is not reused. */ GraphUid node_next_id; /* List of edges and its iterator */ Edge* first_edge; GraphNum edge_num; /** Id of next edge. Incremented each time you create an edge, * needed for edges to have unique id. In DEBUG mode edge id is not reused. */ GraphUid edge_next_id; }; #endif codequery-0.18.1/showgraph/Graph/graph_iface.h000066400000000000000000000111361300045745200212470ustar00rootroot00000000000000/** * @file: graph_iface.h * Interface of Graph library * * @defgroup GraphBase Graph * @ingroup Core * * @brief Representation of graphs * * Graph representation is implemented through 3 tightly connected classes Graph, Node and Edge. */ /* * Graph library, internal representation of graphs in ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #ifndef GRAPH_IFACE_H #define GRAPH_IFACE_H #include "predecls.h" #include "edge.h" #include "node.h" #include "graph.h" #include "agraph.h" /* Edges traversal implementation */ #define ITERATE_NODE_EDGES(node, edge, dir) for ( edge = node->first##dir();\ isNotNullP( edge);\ edge = edge->next##dir()) /* Succs traverse implementation */ #define ITERATE_NODE_SUCCS(edge, node) for ( edge = node->firstSucc();\ isNotNullP( edge);\ edge = edge->nextSucc()) /* Preds traverse implementation */ #define ITERATE_NODE_PREDS(edge, node) for ( edge = node->firstPred();\ isNotNullP( edge);\ edge = edge->nextPred()) /** * Convenience macro for traversing edges in given direction * @ingroup GraphBase * @param node A node that we use to get first edge * @param edge An object of Edge type or subclass of Edge which is the loop variable * @param dir 'Succ' or 'Pred' */ #ifndef ForEdges # define ForEdges(node, edge, dir) ITERATE_NODE_EDGES(node, edge, dir) #endif /** * Convenience macro for traversing successors of node * @ingroup GraphBase * @param edge An object of Edge type or subclass of Edge which is the loop variable * @param node A node that we use to get first edge */ #ifndef foreachSucc # define foreachSucc(edge, node) ITERATE_NODE_SUCCS(edge, node) #endif /** * Convenience macro for traversing predecessors of node * @ingroup GraphBase * @param edge An object of Edge type or subclass of Edge which is the loop variable * @param node A node that we use to get first edge */ #ifndef foreachPred # define foreachPred(edge, node) ITERATE_NODE_PREDS(edge, node) #endif /* Graph's edges traverse implementation */ #define ITERATE_GRAPH_EDGES(edge, graph) for ( edge = graph->firstEdge();\ isNotNullP( edge);\ edge = edge->nextEdge()) /* Graph's nodes traverse implementation */ #define ITERATE_GRAPH_NODES(node, graph) for ( node = graph->firstNode();\ isNotNullP( node);\ node = node->nextNode()) /** * Convenience macro for traversing edges in graph * @ingroup GraphBase * @param edge An object of Edge type or subclass of Edge which is the loop variable * @param graph Graph of interest */ #ifndef foreachEdge # define foreachEdge(edge, graph) ITERATE_GRAPH_EDGES(edge, graph) #endif /** * Convenience macro for traversing nodes in graph * @ingroup GraphBase * @param node An object of Node type or subclass of Node which is the loop variable * @param graph Graph of interest */ #ifndef foreachNode # define foreachNode(node, graph) ITERATE_GRAPH_NODES(node, graph) #endif /* Implementation of inline functinality */ #include "edge_inline.h" #include "node_inline.h" #include "graph_inline.h" #endifcodequery-0.18.1/showgraph/Graph/graph_inline.h000066400000000000000000000122331300045745200214550ustar00rootroot00000000000000/** * @file: graph_inline.h * Implementation of Graph's inline routines */ /* * Graph library, internal representation of graphs in ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #pragma once #ifndef GRAPH_INLINE_H #define GRAPH_INLINE_H /** Delete node from memory pool */ inline void Graph::deleteNode( void *n) { node_pool->destroy( n); } /** Delete edge from memory pool */ inline void Graph::deleteEdge( void *e) { edge_pool->destroy( e); } /** * Remove node from node list of graph */ inline void Graph::detachNode( Node* node) { assert( isNotNullP( node)); assert( node->graph() == this); if( first_node == node) { first_node = node->nextNode(); } node->detachFromGraph(); node_num--; } /** * Remove edge from edge list of graph */ inline void Graph::detachEdge( Edge * edge) { assert( isNotNullP( edge)); assert( edge->graph() == this); if( first_edge == edge) { first_edge = edge->nextEdge(); } edge->detachFromGraph(); edge_num--; } /** * Return node quantity */ inline GraphNum Graph::nodeCount() const { return node_num; } /** * Return edge quantity */ inline GraphNum Graph::edgeCount() const { return edge_num; } /** * Get first edge */ inline Edge* Graph::firstEdge() { return first_edge; } /** * Get first node */ inline Node* Graph::firstNode() { return first_node; } /** Get pool of nodes */ inline Pool *Graph::nodePool() const { return node_pool; } /** Get pool of edges */ inline Pool *Graph::edgePool() const { return edge_pool; } /** * Creation node in graph implementation */ inline Node * Graph::newNodeImpl( GraphUid id) { /** * Check that we have available node id */ assert( edge_next_id < GRAPH_MAX_NODE_NUM); /** Create node */ Node *node_p = this->createNode( id); /** Add node to graph's list of nodes */ node_p->attach( first_node); first_node = node_p; node_num++; /** Make sure that next automatically assigned id will be greater than given id */ if ( node_next_id <= id) node_next_id = id + 1; return node_p; } /** * Creation node in graph */ inline Node * Graph::newNode() { Node * node_p = newNodeImpl( node_next_id); node_p->setElement( createElement( "node")); documentElement().appendChild( node_p->elem()); return node_p; } /** * Creation node in graph */ inline Node * Graph::newNode( QDomElement e) { assert( !e.isNull()); assert( e.tagName() == QString( "node")); assert( e.hasAttribute( "id")); Node *node_p = newNodeImpl( node_next_id); node_p->setElement( e); return node_p; } /** * Create edge between two nodes. * We do not support creation of edge with undefined endpoints */ inline Edge * Graph::newEdgeImpl( Node * pred, Node * succ) { /** * Check that we have available edge id */ assert( edge_next_id < GRAPH_MAX_NODE_NUM); Edge *edge_p = this->createEdge( edge_next_id++, pred, succ); edge_p->attach( EDGE_LIST_GRAPH, first_edge); first_edge = edge_p; edge_num++; return edge_p; } /** * Create edge between two nodes. * We do not support creation of edge with undefined endpoints */ inline Edge * Graph::newEdge( Node * pred, Node * succ) { Edge *edge_p = newEdgeImpl( pred, succ); edge_p->setElement( createElement( "edge")); documentElement().appendChild( edge_p->elem()); return edge_p; } /** * Create edge between two nodes. * We do not support creation of edge with undefined endpoints */ inline Edge * Graph::newEdge( Node * pred, Node * succ, QDomElement e) { Edge *edge_p = newEdgeImpl( pred, succ); edge_p->setElement( e); return edge_p; } #endif /** GRAPH_INLINE_H */codequery-0.18.1/showgraph/Graph/marker.h000066400000000000000000000245701300045745200203060ustar00rootroot00000000000000/** * @file: marker.h * Interface and implementation of marker functionality. * * @defgroup Mark Markers * * @ingroup GraphBase * * Markers are used to mark objects. An object can be marked with several markers. * For each marker we can test if an object is marked with it. * To use this functinality you have to subclass Marked class to obtain marked * object and subclass MarkerManager class to create and free markers. * * When implementing an algorithm with markers you first create it by MarkerManager::newMarker(), * pass it around in your algorithm marking objects with Marked::mark() and testing them with * Marked::isMarked(). After your done free marker with MarkerManager::freeMarker(). * Example: **@code //Derive your class from Marked class Obj: public Marked { pubic: void someAction(); ... } //Derive class that controls Obj's instances from MarkerManager class ObjManager: public MarkerManager { // QList from Qt's containers QList objs; //Required reimplementation void clearMarkersInObjects() { // Qt's macros for accessing each object in a container foreach ( Obj *obj, objs) { clearUnusedMarkers( obj); } } public: Obj *newObj(){...} QList getObjects(){...}; } //Usage void func() { ObjManager man; Marker m = man.newNum(); // Acquire marker for ( unsigned int i = 0; i < 100; i++) { Obj* obj = man.newObj(); obj->mark( m); // Mark object } foreach ( Obj *obj, man.getObjects()) { if ( obj->isMarked( m)) // Check if object is marked obj->someAction(); } man.freeMarker( m); // Free marker } @endcode * @sa Nums */ /* * Graph library, internal representation of graphs in ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ /** * Marker index type * @ingroup Mark */ typedef unsigned short int MarkerIndex; /** * Marker value type * @ingroup Mark */ typedef unsigned int MarkerValue; /** * Possible marker errors * * @ingroup Mark */ typedef enum MarkerErrorType_e { /** Some error occured */ M_ERROR_GENERIC, /** We've ran out of indexes. Someone forgot to free markers? */ M_ERROR_OUT_OF_INDEXES, /** We're out of values. Seems to be interanl error of marker class.*/ M_ERROR_OUT_OF_VALUES, /** Number of error types */ M_ERROR_NUM } MarkerErrorType; /* Marker-related constants */ /** * How many markers are allowed simultaneously * @ingroup Mark */ const short int MAX_GRAPH_MARKERS = 10; /** * Clean value of markers * @ingroup Mark */ const MarkerValue GRAPH_MARKER_CLEAN = 0; /** * First value of markers * @ingroup Mark */ const MarkerValue GRAPH_MARKER_FIRST = 1; /** * Last value of markers * @ingroup Mark */ const MarkerValue GRAPH_MARKER_LAST = ( MarkerValue)( (int)-1); /** * Marker description * * @ingroup Mark */ class Marker { public: /** Default contructor */ inline Marker(); private: /** Markers index */ MarkerIndex index; /** Value */ MarkerValue value; /** Two classes have acces to marker internals. All others do not. */ friend class Marked; friend class MarkerManager; }; /** * Default constructor */ inline Marker::Marker(): index( MAX_GRAPH_MARKERS), value( GRAPH_MARKER_CLEAN) { } /** * Represents a marked object * * @ingroup Mark */ class Marked { public: /** Default constructor */ inline Marked(); /** Mark node with marker. Return false if node is already marked. True otherwise. */ inline bool mark( Marker marker); /** Return true if node is marked with this marker */ inline bool isMarked( Marker marker); /** Return true if node has been marked with this marker and unmarks it */ inline bool unmark( Marker marker); /** Clears value for given index */ inline void clear( MarkerIndex i); private: /** Markers */ MarkerValue markers[ MAX_GRAPH_MARKERS]; }; /** * Default constructor */ inline Marked::Marked() { MarkerIndex i; /** Initialize markers */ for ( i = 0; i < MAX_GRAPH_MARKERS; i++) { markers [ i] = GRAPH_MARKER_CLEAN; } } /** * mark node with marker. Return false if node is already marked. True otherwise. */ inline bool Marked::mark( Marker marker) { if ( markers[ marker.index] == marker.value) { return false; } markers[ marker.index] = marker.value; return true; } /** * Return true if node is marked with this marker */ inline bool Marked::isMarked( Marker marker) { if ( markers[ marker.index] == marker.value) { return true; } return false; } /** * Return true if node has been marked with this marker and unmarks it */ inline bool Marked::unmark( Marker marker) { if ( markers[ marker.index] == marker.value) { markers[ marker.index] = GRAPH_MARKER_CLEAN; return true; } return false; } /** * Clears value for given index */ inline void Marked::clear( MarkerIndex i) { markers[ i] = GRAPH_MARKER_CLEAN; } /** * Class that creates/frees markers * * @ingroup Mark */ class MarkerManager { public: /** Default Constructor */ MarkerManager(); /** * Acquire new marker. Markers MUST be freed after use, * otherwise you run to markers number limit. */ Marker newMarker(); /** Free marker */ void freeMarker( Marker m); protected: /** * Clears unused markers in given object */ void clearUnusedMarkers( Marked *m_obj); private: /** Find free index */ inline MarkerIndex findFreeIndex(); /** Increment marker value */ inline MarkerValue nextValue(); /** Clear markers in marked objects, MUST BE implemented in inhereted class */ virtual void clearMarkersInObjects() = 0; /** Check if this value is busy */ inline bool isValueBusy( MarkerValue val); /** Return next free value */ inline MarkerValue findNextFreeValue(); /** Marker values for each index */ MarkerValue markers[ MAX_GRAPH_MARKERS]; /** Usage flags for each index */ bool is_used[ MAX_GRAPH_MARKERS]; /** Last free value */ MarkerValue last; }; /** * Find free index */ inline MarkerIndex MarkerManager::findFreeIndex() { MarkerIndex i = 0; /** Search for free marker index */ for ( i = 0; i < MAX_GRAPH_MARKERS; i++) { if ( !is_used [ i]) { return i; } } throw M_ERROR_OUT_OF_INDEXES; return i; } /** * Increment marker value */ inline MarkerValue MarkerManager::nextValue() { if ( last == GRAPH_MARKER_LAST) { last = GRAPH_MARKER_FIRST; } else { last++; } return last; } /** * Check if this value is busy */ inline bool MarkerManager::isValueBusy( MarkerValue val) { /** Check all markers */ for ( MarkerIndex i = 0; i < MAX_GRAPH_MARKERS; i++) { if ( is_used [ i] && markers[ i] == val) return true; } return false; } /** * Return next free value */ inline MarkerValue MarkerManager::findNextFreeValue() { MarkerIndex i = 0; bool reached_limit = false; MarkerValue res = last; while( isValueBusy( res)) { /** * If we reached checked GRAPH_MARKER_LAST twice, * then we are in infinite loop and for some reason we don't free our markers */ if ( res == GRAPH_MARKER_LAST) { assert< MarkerErrorType> ( !reached_limit, M_ERROR_OUT_OF_VALUES); clearMarkersInObjects(); reached_limit = true; } res = nextValue(); } return res; } /** * Clears unused markers in given object */ inline void MarkerManager::clearUnusedMarkers( Marked *m_obj) { for ( MarkerIndex i = 0; i < MAX_GRAPH_MARKERS; i++) { if ( !is_used [ i]) m_obj->clear( i); } } /** * Default Constructor */ inline MarkerManager::MarkerManager() { MarkerIndex i; /** Initialize markers */ for ( i = 0; i < MAX_GRAPH_MARKERS; i++) { markers [ i] = GRAPH_MARKER_CLEAN; is_used [ i] = false; } last = GRAPH_MARKER_FIRST; } /** * Acquire new marker. Markers MUST be freed after use, * otherwise you run to markers number limit. */ inline Marker MarkerManager::newMarker() { try { Marker new_marker; new_marker.index = findFreeIndex(); is_used[ new_marker.index] = true; new_marker.value = findNextFreeValue(); markers[ new_marker.index] = new_marker.value; return new_marker; } catch ( MarkerErrorType type) { /** Handle errors */ switch ( type) { case M_ERROR_GENERIC: default: assert(0); } assert(0); } return newMarker(); } /** * Free marker */ inline void MarkerManager::freeMarker( Marker m) { is_used[ m.index] = false; } codequery-0.18.1/showgraph/Graph/node.cpp000066400000000000000000000050141300045745200202750ustar00rootroot00000000000000/** * @file: node.cpp * Node class implementation */ /* * Graph library, internal representation of graphs in ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ /** * Destructor. Corrects list of nodes in corresponding graph and deletes adjacent edges */ #include "graph_iface.h" Node::~Node() { Edge *edge; //out("Deleted Node"); /** delete incidient edges */ for ( edge = firstSucc(); isNotNullP( edge);) { Edge* next = edge->nextSucc(); //edge->detachFromNode( GRAPH_DIR_DOWN);// Edge is detached from succ node graph()->deleteEdge( edge); edge = next; } for ( edge = firstPred(); isNotNullP( edge);) { Edge* next = edge->nextPred(); //edge->detachFromNode( GRAPH_DIR_UP);// Edge is detached from pred node graph()->deleteEdge( edge); edge = next; } element.parentNode().removeChild( element); /** delete myself from graph */ graph_p->detachNode( this); } /** * Print node in Dot format to stdout */ void Node::debugPrint() { out("%llu;", id()); } codequery-0.18.1/showgraph/Graph/node.h000066400000000000000000000154441300045745200177520ustar00rootroot00000000000000/** * @file: node.h * Node class definition */ /* * Graph library, internal representation of graphs in ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #pragma once #ifndef NODE_H #define NODE_H #include "node_iter.h" /** * @class Node * @brief Representation of graph node. * * @ingroup GraphBase * * @par * A graph node has two lists of edges which represent predecessors and successors. * Node's predecessors and successors can be traversed by using three interfaces: * -# Get first edge in direction of interest via firstSucc(),firstPred() and then * use Edge's interface Edge::nextSucc(), Edge::nextPred() * -# Use iterators Node::Succ and Node::Pred wich are used for successor and predecessor traversal of edges. * Routines succsBegin(), succsEnd(), predsBegin() and predsEnd() are used for creating iterators. * -# EdgeIter can be used for iterating trough all node's adjacent edges without respect to * their direction. * * @code // Traversing edges simple for ( Edge* e = firstPred(); isNotNullP( e); e = e->nextPred()) { ... } //Same using macro foreachPred Edge* e; foreachPred( e, node) { ... } //Traversal via iterators for ( Node::Succ s = node->succsBegin(), s_end = node->succsEnd(); s != s_end; s++ ) { ... } @endcode * @par * A node can be @ref Marked "marked" and @ref Numbered "numbered". @ref Mark "Markers" and * @ref Nums "numerations" are managed by @ref Graph "graph". Note that @ref Edge "edges" can be marked with the * same marker or numbered in the same numeration. * * @par * All nodes in graph are linked in a list. Previous and next nodes can be obtained * through prevNode and nextNode routines. Also for debug purposes all nodes in a graph * have unique id, which can be usefull for printing to console or setting breakpoint conditions. * * @par * A node resides in memory pool that is controlled by Graph. Operator new can't be called * directly. Nodes can be only created by newNode method of Graph class. * * @par * Nodes have associated QDomElement for XML export support. The updateElement() routine should be called before * export to get element in sync with node's properties. * * @sa Graph * @sa Edge * @sa Mark * @sa Nums */ class Node: public Marked, public Numbered, public PoolObj, public SListIface< Node> { public: /** * @brief Destructor. * Destructs the node. Operator delete shouldn't be called directly. * Use Graph::deleteNode for freeing memory and destruction */ virtual ~Node(); inline QDomElement elem() const; /**< Return corresponding element */ inline void setElement( QDomElement elem); /**< Set element */ inline GraphUid id() const; /**< Get node's unique ID */ inline Graph * graph() const;/**< Get node's corresponding graph */ inline Node* nextNode(); /**< Next node in graph's list */ inline Node* prevNode(); /**< Prev node in graph's list */ /** Add edge to node in specified direction */ inline void AddEdgeInDir( Edge *edge, GraphDir dir); inline void AddPred( Edge *edge); /**< Add predecessor edge */ inline void AddSucc( Edge *edge); /**< Add successor edge */ /** Get first edge in given direction */ inline Edge* firstEdgeInDir( GraphDir dir); inline Edge* firstSucc(); /**< Get first successor edge */ inline Edge* firstPred(); /**< Get first predecessor edge */ /** Deletion of edge in specified direction */ void deleteEdgeInDir( GraphDir dir, Edge* edge); inline void deletePred( Edge* edge); /**< Delete predecessor edge */ inline void deleteSucc( Edge* edge); /**< Delete successor edge */ virtual void debugPrint(); /**< Print node in DOT format to stdout */ virtual void updateElement(); /**< Update DOM element */ virtual void readFromElement( QDomElement elem); /**< Read properties from XML */ /* Iterator types */ typedef EdgeIterIface< SuccIterImpl> Succ; /**< Iterator for successors */ typedef EdgeIterIface< PredIterImpl> Pred; /**< Iterator for predecessors */ typedef EdgeIterIface< UnDirIterImpl> EdgeIter; /**< Undirected iterator for edges */ inline Succ succsBegin(); /**< Create iterator for first succ */ inline Succ succsEnd(); /**< Create iterator pointing to succ end */ inline Pred predsBegin(); /**< Create iterator for first succ */ inline Pred predsEnd(); /**< Create iterator pointing to succ end */ inline EdgeIter edgesBegin(); /**< Create iterator for first succ */ inline EdgeIter edgesEnd(); /**< Create iterator pointing to succ end */ protected: /** We can't create nodes separately, do it through newNode method of graph */ inline Node( Graph *_graph_p, GraphUid _id); private: /** Graph class controls nodes */ friend class Graph; /** Detach this node from graph's node list */ inline void detachFromGraph(); /** Representation in document */ QDomElement element; /* Connection with inclusive graph */ GraphUid uid; /**< Unique id */ Graph * graph_p;/**< Pointer to graph */ /** First edges in graph's directions */ Edge *first_edge[ GRAPH_DIRS_NUM]; }; #endif /* NODE_H */ codequery-0.18.1/showgraph/Graph/node_inline.h000066400000000000000000000212271300045745200213040ustar00rootroot00000000000000/** * @file: node_inline.h * Implementation of Node and related classes' inline routines */ /* * Graph library, internal representation of graphs in ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #pragma once #ifndef NODE_INLINE_H #define NODE_INLINE_H /** We can't create nodes separately, do it through newNode method of graph */ inline Node::Node( Graph *_graph_p, GraphUid _id):uid(_id), graph_p( _graph_p), element() { first_edge[ GRAPH_DIR_UP] = NULL; first_edge[ GRAPH_DIR_DOWN] = NULL; } /** * Detach myself from graph's node list */ inline void Node::detachFromGraph() { detach(); } /** Return corresponding element */ inline QDomElement Node::elem() const { return element; } /** * Set element */ inline void Node::setElement( QDomElement elem) { element = elem; } /** * Get node's unique ID */ inline GraphUid Node::id() const { return uid; } /** * Get node's corresponding graph */ inline Graph * Node::graph() const { return graph_p; } /** * Next node in graph's list */ inline Node* Node::nextNode() { return next(); } /** * Prev node in graph's list */ inline Node* Node::prevNode() { return prev(); } /** * Add predecessor edge */ inline void Node::AddPred( Edge *edge) { AddEdgeInDir( edge, GRAPH_DIR_UP); } /** * Add successor edge */ inline void Node::AddSucc( Edge *edge) { AddEdgeInDir( edge, GRAPH_DIR_DOWN); } /** * First edge in given direction */ inline Edge* Node::firstEdgeInDir( GraphDir dir) { return first_edge[ dir]; } /** * First successor edge */ inline Edge* Node::firstSucc() { return firstEdgeInDir( GRAPH_DIR_DOWN); } /** * First predecessor edge */ inline Edge* Node::firstPred() { return firstEdgeInDir( GRAPH_DIR_UP); } /** * delete predecessor edge */ inline void Node::deletePred( Edge* edge) { deleteEdgeInDir( GRAPH_DIR_UP, edge); } /** * delete successor edge */ inline void Node::deleteSucc( Edge* edge) { deleteEdgeInDir( GRAPH_DIR_DOWN, edge); } /** * Create iterator for first succ */ inline Node::Succ Node::succsBegin() { return Succ( this); } /** * Create iterator pointing to succ end */ inline Node::Succ Node::succsEnd() { return Succ(); } /** * Create iterator for first succ */ inline Node::Pred Node::predsBegin() { return Pred( this); } /** * Create iterator pointing to succ end */ inline Node::Pred Node::predsEnd() { return Pred(); } /** * Create iterator for first succ */ inline Node::EdgeIter Node::edgesBegin() { return EdgeIter( this); } /** * Create iterator pointing to succ end */ inline Node::EdgeIter Node::edgesEnd() { return EdgeIter(); } /** * Add an edge to this node in specified direction */ inline void Node::AddEdgeInDir( Edge *edge, GraphDir dir) { assert( isNotNullP( edge)); GRAPH_ASSERTD( (int) GRAPH_DIR_DOWN == (int) EDGE_LIST_SUCCS, "Enums of direction and edge lists are not having right values"); GRAPH_ASSERTD( (int) GRAPH_DIR_UP == (int) EDGE_LIST_PREDS, "Enums of direction and edge lists are not having right values"); edge->attach( dir, first_edge[ dir]); first_edge[ dir] = edge; } /** * delete edge pointed by iterator in specidied direction */ inline void Node::deleteEdgeInDir( GraphDir dir, Edge* edge) { assert( isNotNullP( edge)); if( first_edge[ dir] == edge) { first_edge[ dir] = edge->nextEdgeInDir( dir); } } /** * Update DOM tree element */ inline void Node::updateElement() { element.setAttribute( "id", id()); } /** * read properties from DOM tree element */ inline void Node::readFromElement( QDomElement e) { element = e; } /** Default Constructor: creates 'end' iterator */ template < class EdgeIterImpl> inline EdgeIterIface< EdgeIterImpl>::EdgeIterIface() { } /** Constructor from node: iterator points on first edge, i.e. 'begin' iterator */ template < class EdgeIterImpl> inline EdgeIterIface< EdgeIterImpl>::EdgeIterIface( Node *n): impl( n) { } /** Copy constructor */ template < class EdgeIterImpl> inline EdgeIterIface< EdgeIterImpl>::EdgeIterIface( const EdgeIterIface& proto) { impl = proto.impl; } /** Destructor */ template < class EdgeIterImpl> inline EdgeIterIface< EdgeIterImpl>::~EdgeIterIface() { } /** Postincrement operator */ template < class EdgeIterImpl> inline EdgeIterIface< EdgeIterImpl> EdgeIterIface< EdgeIterImpl>::operator++( int) { EdgeIterIface tmp = *this; ++*this; return tmp; } /** Dereferenece operator*/ template < class EdgeIterImpl> inline Edge * EdgeIterIface< EdgeIterImpl>::operator*() { return impl.edge(); } /** Comparison operator */ template < class EdgeIterImpl> inline bool EdgeIterIface< EdgeIterImpl>::operator==(const EdgeIterIface< EdgeIterImpl>& o) const { return impl == o.impl; } /** Not equals operator */ template < class EdgeIterImpl> inline bool EdgeIterIface< EdgeIterImpl>::operator!=(const EdgeIterIface< EdgeIterImpl>& o) const { return !(*this == o); } /** Get Edge */ template < class EdgeIterImpl> inline Edge * EdgeIterIface< EdgeIterImpl>::edge() const { return impl.edge(); } /** Get Edge */ template < class EdgeIterImpl> inline Node * EdgeIterIface< EdgeIterImpl>::node() const { return impl.node(); } /** Preincrement operator */ template < class EdgeIterImpl> inline EdgeIterIface< EdgeIterImpl> & EdgeIterIface< EdgeIterImpl>::operator++() { GRAPH_ASSERTD( isNotNullP( impl.edge()), "Edge iterator is at end ( NULL in edge pointer)"); impl.nextEdge(); return *this; } /** Next pred */ inline void PredIterImpl::nextEdge() { GRAPH_ASSERTD( isNotNullP( edge_p), "Edge iterator is at end ( NULL in edge_p pointer)"); edge_p = edge_p->nextPred(); } /** Next succ */ inline void SuccIterImpl::nextEdge() { GRAPH_ASSERTD( isNotNullP( edge_p), "Edge iterator is at end ( NULL in edge_p pointer)"); edge_p = edge_p->nextSucc(); } /** Preincrement operator */ inline void UnDirIterImpl::nextEdge() { GRAPH_ASSERTD( isNotNullP( edge_p), "Edge iterator is at end ( NULL in edge_p pointer)"); if ( is_pred && isNullP( edge_p->nextPred())) { is_pred = false; edge_p = edge_p->succ()->firstSucc(); } else { if ( is_pred) { edge_p = edge_p->nextPred(); } else { edge_p = edge_p->nextSucc(); } } } /** Get node on the end of edge */ inline Node * SuccIterImpl::node() const { return edge()->succ(); } /** Get node on the end of edge */ inline Node * PredIterImpl::node() const { return edge()->pred(); } /** Get node in UnDir traversal of node's edges */ inline Node * UnDirIterImpl::node() const { if ( is_pred) { return edge()->pred(); } else { return edge()->succ(); } } /** Constructor gets first succ */ inline SuccIterImpl::SuccIterImpl( Node *n) { edge_p = n->firstSucc(); } /** Constructor gets first pred */ inline PredIterImpl::PredIterImpl( Node *n) { edge_p = n->firstPred(); } /** Constructor gets first edge for undirected edges iteration */ inline UnDirIterImpl::UnDirIterImpl( Node *n) { edge_p = n->firstPred(); is_pred = true; if ( isNullP( edge_p)) { is_pred = false; edge_p = n->firstSucc(); } } #endif /* NODE_INLINE_H */codequery-0.18.1/showgraph/Graph/node_iter.h000066400000000000000000000112651300045745200207720ustar00rootroot00000000000000/** * @file: node_iter.h * Declaration of iterators for node's adjacent edges traversal and related classes */ /* * Graph library, internal representation of graphs in ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #pragma once #ifndef NODE_ITER_H #define NODE_ITER_H /** Baseclass for implementing iterator template parameters */ class IterImplBase { public: /** Get edge */ inline Edge* edge() const { return edge_p;} /** Set edge */ inline void setEdge( Edge *e){ edge_p = e;} /** Default constructor */ inline IterImplBase(): edge_p( NULL) {} protected: Edge *edge_p; }; /** Parameter for iterator template specialization (pred traversal) */ class PredIterImpl: public IterImplBase { public: inline void nextEdge(); /**< Move on to the next pred */ inline Node *node() const; /**< Get node */ inline PredIterImpl(){}; /**< Default constructor */ inline PredIterImpl( Node *n);/**< Configures iterator with node's first pred */ inline bool operator==(const PredIterImpl& o) const /**< Comparison operator */ { return edge_p == o.edge_p; } }; /** Parameter for iterator template specialization (succ traversal) */ class SuccIterImpl: public IterImplBase { public: inline void nextEdge(); /**< Move on to the next succ */ inline Node *node() const; /**< Get node */ inline SuccIterImpl(){}; /**< Default constructor */ inline SuccIterImpl( Node *n);/**< Configures iterator with node's first succ */ inline bool operator==(const SuccIterImpl& o) const /**< Comparison operator */ { return edge_p == o.edge_p; } }; /** Parameter for iterator template specialization (undirected traversal) */ class UnDirIterImpl: public IterImplBase { public: inline void nextEdge(); /**< Move on to the next edge */ inline Node *node() const; /**< Get node */ inline UnDirIterImpl():is_pred( false){}; /**< Default consturctor */ inline UnDirIterImpl( Node *n);/**< Configures iterator with node's first edge */ inline bool operator==(const UnDirIterImpl& o) const /**< Comparison operator */ { return edge_p == o.edge_p && is_pred == o.is_pred; } private: bool is_pred; }; /** * Convinience template for iterating through node's adjacent edges */ template < class EdgeIterImpl> class EdgeIterIface { public: /** Default constructor */ inline EdgeIterIface(); /** Copy constructor */ inline EdgeIterIface( const EdgeIterIface& proto); /** Destructor */ inline ~EdgeIterIface(); /** Preincrement operator */ inline EdgeIterIface & operator++(); /** Postincrement operator */ inline EdgeIterIface operator++( int); /** Dereferenece operator*/ inline Edge * operator*(); /** Comparison operator */ inline bool operator==(const EdgeIterIface& o) const; /** Not equals operator */ inline bool operator!=(const EdgeIterIface& o) const; /** Get Edge */ inline Edge *edge() const; /** Get node on the end of edge */ inline Node *node() const; private: /** Constructor from node */ inline EdgeIterIface( Node *e); friend class Node; /** Parameter-dependent implementation */ EdgeIterImpl impl; }; #endifcodequery-0.18.1/showgraph/Graph/num.h000066400000000000000000000327211300045745200176210ustar00rootroot00000000000000/** * @file: num.h * Interface and implementation of numeration functionality. * * @defgroup Nums Numeration of objects * * @ingroup GraphBase * Numerations can be used to assign numbers to objects. * * @par * In application to graphs a numeration is a mapping of graph's nodes and/or edges to * numbers. A node or an edge can be assigned a number in several different numerations. So * when we number them we say what numeration we are dealing with. Numeration class describes * one particular numeration. It is used as a parameter for functions like Numbered::number() * or Numbered::setNumber() * * @par * Usage model is following. To make an object numerable you derive it from Numbered class. * Then if you have some class representing a container for this objects you derive it from * the NumManager class. When you want to numerate objects derived from Numbered you ask * NumManager-derived object for a new numeration using NumManager::newNum(). Then use * Numbered::setNumber() and Numbered::number() to number objects and retrieve object number. * When you done with using numbers free the numeration by calling NumManager::freeNum(). *@code //Derive your class from Numbered class Obj: public Numbered { pubic: void someAction(); ... } //Derive class that controls Obj's instances from NumManager class ObjManager: public NumManager { // QList from Qt's containers QList objs; //Required reimplementation void clearNumerationsInObjects() { // Qt's macros for accessing each object in a container foreach ( Obj *obj, objs) { clearUnusedNumerations( obj); } } public: Obj *newObj(){...} QList getObjects(){...}; } //Usage void func() { ObjManager man; Numeration num = man.newNum(); // Acquire numeration for ( unsigned int i = 0; i < 100; i++) { Obj* obj = man.newObj(); obj->setNumber( num, i % 2); // Assign number to object } foreach ( Obj *obj, man.getObjects()) { if ( obj->number( num)) // Get object's number obj->someAction(); } man.freeNum( num); // Free numeration } @endcode * You can have not more than MAX_NUMERATIONS at one time so if you forget to * free a numeration you'll run into exception telling you that there are no free numeration * indices left. * * @sa Mark */ /* * Graph library, internal representation of graphs in ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ /** * Numeration index type * @ingroup Nums */ typedef unsigned short int NumIndex; /** * Numeration value type * @ingroup Nums */ typedef unsigned int NumValue; /** * Possible num errors * * @ingroup Nums */ enum NumErrorType { /** Some error occured */ NUM_ERROR_GENERIC, /** We've ran out of indexes. Someone forgot to free nums? */ NUM_ERROR_OUT_OF_INDEXES, /** We're out of values. Seems to be interanl error of num class.*/ NUM_ERROR_OUT_OF_VALUES, /** Number is too big */ NUM_ERROR_NUMBER_OUT_OF_RANGE, /** Number of error types */ NUM_ERROR_NUM }; /* Num-related constants */ /** * Number of numerations allowed simultaneously * @ingroup Nums */ const short int MAX_NUMERATIONS = 10; /** * Clean value * @ingroup Nums */ const NumValue NUM_VAL_CLEAN = 0; /** * First value * @ingroup Nums */ const NumValue NUM_VAL_FIRST = 1; /** * Last value * @ingroup Nums */ const NumValue NUM_VAL_LAST = ( NumValue)( (int)-1); /** * * Value that means object is unnumbered * @ingroup Nums */ const GraphNum NUMBER_NO_NUM = ( GraphNum) -1; /** * Maximal number of object * @ingroup Nums */ const GraphNum NUMBER_MAX = (( GraphNum) -1) - 1; /** * @class Numeration * @ingroup Nums * @brief Numeration description. * * @par * In application to graphs a numeration is a mapping of graph's nodes and/or edges to * numbers. A node or an edge can be assigned a number in several different numerations. So * when we number them we say what numeration we are dealing with. Numeration class describes * one particular numeration. It is used as a parameter for functions like Numbered::number() * or Numbered::setNumber(). * * @par Some Implemetation Details * Numeration is created by NumManager class which ensures that numeration's index is used * for this particular numeration only and gives it new value. Value field is used for * comparison in routines like Numbered::isNumbered(). Value in numeration is compared to value * stored in @ref Numbered "numbered" object in array position pointed by numeration's index. * * @sa Nums */ class Numeration { public: /** Default constructor */ inline Numeration(); private: /** Nums index */ NumIndex index; /** Value */ NumValue value; /* Two classes have acces to num internals. All others do not. */ friend class Numbered; friend class NumManager; }; /** Default constructor */ inline Numeration::Numeration(): index( MAX_NUMERATIONS), value( NUM_VAL_CLEAN) { } /** * @class Numbered * @brief Represents an object that can be involved in several numerations * * @ingroup Nums * * To assign numbers to objects you often have to incorporate it into object's implementation or * make some sort of mapping of objects to numbers. The Numbered class can store several numbers * simultaneously so it can be member of several numerations at the same time. Being a part of * numeration an object can be: numbered or unnumbered. Object becomes numbered when a number is * given to it. Until then object is unnumbered. It is also possible to wipe the number from object * by calling unNumber(). Most routines have the @ref Numeration "numeration" parameter. It * describes numeration of interest and is obtained from a @ref NumManager "numeration manager". */ class Numbered { public: /** Constructor */ Numbered(); /** Assign a number to object. Return false if object is already numbered. True otherwise. */ inline bool setNumber( Numeration num, GraphNum new_number); /** Return number in given numeration or NO_NUM if it was not numbered yet */ inline GraphNum number( Numeration num); /** Return true if node is numbered in this numeration */ inline bool isNumbered( Numeration num); /** Return true if node has been numbered in this numeration and unmarks it */ inline bool unNumber( Numeration num); /** Clears value for given index */ inline void clear( NumIndex i); private: /** Numeration descriptions */ NumValue nums[ MAX_NUMERATIONS]; /** Number in each numeration */ GraphNum numbers[ MAX_NUMERATIONS]; }; /** Constructor */ inline Numbered::Numbered() { NumIndex i; /** Initialize nums */ for ( i = 0; i < MAX_NUMERATIONS; i++) { nums [ i] = NUM_VAL_CLEAN; } } /** * Assign a number to object. Return false if object is already numbered. True otherwise. */ inline bool Numbered::setNumber( Numeration num, GraphNum new_number) { if ( new_number >= NUMBER_MAX) throw NUM_ERROR_NUMBER_OUT_OF_RANGE; nums[ num.index] = num.value; numbers[ num.index] = new_number; if ( nums[ num.index] == num.value) { return false; } return true; } /** * Return number in given numeration or NO_NUM if it was not numbered yet */ inline GraphNum Numbered::number( Numeration num) { if ( nums[ num.index] == num.value) { return numbers[ num.index]; } return NUMBER_NO_NUM; } /** * Return true if node is numbered in this numeration */ inline bool Numbered::isNumbered( Numeration num) { if ( nums[ num.index] == num.value) { return true; } return false; } /** * Return true if node has been numbered in this numeration and unmarks it */ inline bool Numbered::unNumber( Numeration num) { if ( nums[ num.index] == num.value) { nums[ num.index] = NUM_VAL_CLEAN; return true; } return false; } /** * Clears value for given index */ inline void Numbered::clear( NumIndex i) { nums[ i] = NUM_VAL_CLEAN; } /** * @brief Class that creates/frees numerations * @ingroup Nums * * @par * @ref NumManager "Numeration manager" creates and frees numerations. You can have up to MAX_NUMERATIONS numerations * at a time. A derived class should reimplement clearNumerationsInObjects() routine which calls clearUnusedNumerations * for every Numbered-derived object. */ class NumManager { public: /** Default Constructor */ NumManager(); /** * @brief Create new numeration * * Create new numeration. Numerations MUST be freed after use, * otherwise you run to numerations number limit. */ Numeration newNum(); /** Free num */ void freeNum( Numeration n); protected: /** Clears unused markers in given object */ inline void clearUnusedNumerations( Numbered *n_obj); private: /** Marker values for each numeration */ NumValue nums[ MAX_NUMERATIONS]; /** Usage flags for each numeration index */ bool is_used[ MAX_NUMERATIONS]; /** Last used value */ NumValue last; /** Find free index */ inline NumIndex findFreeIndex(); /** Increment num value */ inline NumValue nextValue(); /** Check if this value is busy */ inline bool isValueBusy( NumValue val); /** * @brief Wipe values and indices that are not in use from numbered objects * * Clear info in objects. MUST BE implemented in inhereted class. * Implementation should call clearUnusedNumerations() for every object that can be numbered */ virtual void clearNumerationsInObjects() = 0; /** Return next free value */ inline NumValue findNextFreeValue(); }; /** Implementatinal routines */ /** * Find free index */ inline NumIndex NumManager::findFreeIndex() { NumIndex i = 0; /** Search for free num index */ for ( i = 0; i < MAX_NUMERATIONS; i++) { if ( !is_used [ i]) { return i; } } throw NUM_ERROR_OUT_OF_INDEXES; return i; } /** * Increment num value */ inline NumValue NumManager::nextValue() { if ( last == NUM_VAL_LAST) { last = NUM_VAL_FIRST; } else { last++; } return last; } /** * Check if this value is busy */ inline bool NumManager::isValueBusy( NumValue val) { /** Check all nums */ for ( NumIndex i = 0; i < MAX_NUMERATIONS; i++) { if ( is_used [ i] && nums[ i] == val) return true; } return false; } /** * Return next free value */ inline NumValue NumManager::findNextFreeValue() { NumIndex i = 0; bool reached_limit = false; NumValue res = last; while( isValueBusy( res)) { /** * If we reached checked NUM_VAL_LAST twice, * then we are in infinite loop because for * some reason we don't free our numerations */ if ( res == NUM_VAL_LAST) { assert< NumErrorType> ( !reached_limit, NUM_ERROR_OUT_OF_VALUES); clearNumerationsInObjects(); reached_limit = true; } res = nextValue(); } return res; } /** * Clears unused markers in given object */ inline void NumManager::clearUnusedNumerations( Numbered *n_obj) { for ( NumIndex i = 0; i < MAX_NUMERATIONS; i++) { if ( !is_used [ i]) n_obj->clear( i); } } /** * Default Constructor */ inline NumManager::NumManager() { NumIndex i; /** Initialize nums */ for ( i = 0; i < MAX_NUMERATIONS; i++) { nums [ i] = NUM_VAL_CLEAN; is_used [ i] = false; } last = NUM_VAL_FIRST; } /** * Create new numeration */ inline Numeration NumManager::newNum() { Numeration new_num; new_num.index = findFreeIndex(); is_used[ new_num.index] = true; new_num.value = findNextFreeValue(); nums[ new_num.index] = new_num.value; return new_num; } /** * Free num */ inline void NumManager::freeNum( Numeration n) { is_used[ n.index] = false; }codequery-0.18.1/showgraph/Graph/predecls.h000066400000000000000000000064761300045745200206330ustar00rootroot00000000000000/** * @file: predecls.h * Predeclarations for interface of Graph library */ /* * Graph library, internal representation of graphs in ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #ifndef GRAPH_PREDECLS_H #define GRAPH_PREDECLS_H #include #include #include #include #include #include #include using namespace std; #include "../Utils/utils_iface.h" /* namespaces import */ using namespace Utils; using namespace Mem; /** * Debug assert for graph library * @ingroup GraphBase */ #if !defined(GRAPH_ASSERTD) # define GRAPH_ASSERTD(cond, what) ASSERT_XD(cond, "Graph", what) #endif /** * Directions type in graph * @ingroup GraphBase */ enum GraphDir { /** Upward direction */ GRAPH_DIR_UP = 0, /** Downward direction */ GRAPH_DIR_DOWN = 1, /** Number of directions in graph */ GRAPH_DIRS_NUM = 2 }; /** * Return direction that is reverse to given one * @ingroup GraphBase */ inline GraphDir RevDir( GraphDir dir) { GRAPH_ASSERTD( GRAPH_DIRS_NUM == 2, "Graph implementation is suited for two directions only"); #ifdef DIR_INVERTION_LONG_VERSION return ( dir == GRAPH_DIR_UP)? GRAPH_DIR_DOWN: GRAPH_DIR_UP; #else return (GraphDir)!dir; #endif } /** * Number type used for numbering nodes and edges in graph * @ingroup GraphBase */ typedef quint32 GraphNum; /** * Node/edge ID type * @ingroup GraphBase */ typedef quint64 GraphUid; /** * Maximum number of nodes * @ingroup GraphBase */ const GraphNum GRAPH_MAX_NODE_NUM = ( GraphNum)( -1); /** * Maximum number of edges * @ingroup GraphBase */ const GraphNum GRAPH_MAX_EDGE_NUM = ( GraphNum)( -1); /** * Indentation for XML writing * @ingroup GraphBase */ const int IndentSize = 4; /* Predeclarations of graph-related classes */ class Graph; class Node; class Edge; #include "marker.h" #include "num.h" #endif codequery-0.18.1/showgraph/GraphView/000077500000000000000000000000001300045745200174775ustar00rootroot00000000000000codequery-0.18.1/showgraph/GraphView/edge_helper.cpp000066400000000000000000000200541300045745200224470ustar00rootroot00000000000000/** * @file: edge_helper.cpp * Edge helper class implementation. * GUI for ShowGraph tool. */ /* * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #include "gview_impl.h" /** * EdgeHelper implementaion */ /** Constructor */ EdgeHelper::EdgeHelper(): src_item( NULL), dst_item( NULL), state( HELPER_STATE_INITIAL) { //setZValue(1); } /** Convenience routine for self edge path */ QPainterPath EdgeHelper::selfEdgePath() const { QPainterPath path( srcP); QPointF center = mapFromItem( src_item, src_item->boundingRect().center()); QRectF r = src_item->borderRect(); path.cubicTo( center + QPointF( 3 * r.width()/8, r.height()/2 + SE_VERT_MARGIN), btmRight, cp1); path.cubicTo( cp1 + QPointF( 0, -r.height()/2-SE_VERT_MARGIN), topLeft, dstP); return path; } void EdgeHelper::adjust() { if ( isNullP( src_item) || state == HELPER_STATE_INITIAL) return; prepareGeometryChange(); bool is_self = ( src_item == dst_item); if ( is_self) { QPointF center = mapFromItem( src_item, src_item->borderRect().center()); QRectF r = src_item->borderRect(); srcP = center + QPointF( 3 * r.width()/8, r.height() /2); dstP = center + QPointF( 3 * r.width()/8, -r.height() /2); topLeft = center + QPointF( 3 * r.width()/8, -r.height()/2 - SE_VERT_MARGIN); cp1 = center + QPointF( (r.width() / 2) + SE_HOR_MARGIN, 0); btmRight = cp1 + QPointF( 0, r.height()/2 + SE_VERT_MARGIN); prepareGeometryChange(); return; } srcP = mapFromItem( src_item, src_item->boundingRect().center()); if ( isNotNullP( dst_item)) dstP = mapFromItem( dst_item, dst_item->boundingRect().center()); topLeft = srcP; btmRight = dstP; QPointF srcCP = srcP; QPointF dstCP = dstP; /** Find line start */ { QLineF line( srcP, dstP); QPolygonF endPolygon = mapFromItem( src_item, src_item->shape().toFillPolygon()); QPointF p1 = endPolygon.first(); QPointF p2; QPointF intersectPoint; QLineF polyLine; for (int i = 1; i < endPolygon.count(); ++i) { p2 = endPolygon.at(i); polyLine = QLineF(p1, p2); QLineF::IntersectType intersectType = polyLine.intersect( line, &srcP); if (intersectType == QLineF::BoundedIntersection) break; p1 = p2; } } /** Find line end */ if ( isNotNullP( dst_item)) { QLineF line2( srcP, dstP); QPolygonF endPolygon = mapFromItem( dst_item, dst_item->shape().toFillPolygon()); QPointF p1 = endPolygon.first();; QPointF p2; QLineF polyLine; for ( int i = 1; i < endPolygon.count(); ++i) { p2 = endPolygon.at(i); polyLine = QLineF(p1, p2); QLineF::IntersectType intersectType = polyLine.intersect( line2, &dstP); if ( intersectType == QLineF::BoundedIntersection) break; p1 = p2; } } topLeft.setX( min< qreal>( srcP.x(), dstP.x())); topLeft.setY( min< qreal>( srcP.y(), dstP.y())); btmRight.setX( max< qreal>( srcP.x(), dstP.x())); btmRight.setY( max< qreal>( srcP.y(), dstP.y())); prepareGeometryChange(); } QRectF EdgeHelper::boundingRect() const { qreal penWidth = 1; qreal extra = arrowSize; return QRectF( topLeft, QSizeF( btmRight.x() - topLeft.x(), btmRight.y() - topLeft.y())) .normalized() .adjusted(-extra, -extra, extra, extra); } QPainterPath EdgeHelper::shape() const { QPainterPath path( srcP); QPainterPathStroker stroker; if ( isNullP( src_item) || srcP == dstP || state == HELPER_STATE_INITIAL) return path; if ( areEqP( src_item, dst_item)) { path = selfEdgePath(); } else { path.lineTo( dstP); } stroker.setWidth( 2); return stroker.createStroke( path); } void EdgeHelper::paint( QPainter *painter, const QStyleOptionGraphicsItem *option, QWidget *widget) { if ( isNullP( src_item) || state == HELPER_STATE_INITIAL) return; if ( option->levelOfDetail < 0.1) return; /** Do not draw edges when adjacent nodes intersect */ if ( isNotNullP( dst_item) && areNotEqP( src_item, dst_item)) { QPolygonF pred_rect = mapFromItem( src_item, src_item->boundingRect()); QPolygonF succ_rect = mapFromItem( dst_item, dst_item->boundingRect()); if ( !succ_rect.intersected( pred_rect).isEmpty()) return; } static const qreal spline_detail_level = 0.4; static const qreal draw_arrow_detail_level = 0.3; QPointF curr_point; QLineF line( srcP, dstP); QPainterPath path( srcP); path.lineTo( dstP); if ( areEqP( src_item, dst_item)) { path = selfEdgePath(); } if ( srcP == dstP) return; //Set opacity painter->setOpacity( 0.3); QPen pen( option->palette.foreground().color(), 1, Qt::SolidLine, Qt::RoundCap, Qt::RoundJoin); // Draw the line itself painter->setPen( pen); painter->setBrush( option->palette.foreground().color()); // Draw the arrows if there's enough room and level of detail is appropriate if ( option->levelOfDetail >= draw_arrow_detail_level) { double angle = ::acos(line.dx() / line.length()); if ( line.dy() >= 0) angle = TwoPi - angle; QPointF destArrowP1; QPointF destArrowP2; /* NOTE: Qt::black can be replaced by option->palette.foreground().color() */ if ( areEqP( src_item, dst_item)) { angle = -2* Pi/3; } destArrowP1 = dstP + QPointF( sin(angle - Pi / 3) * arrowSize, cos(angle - Pi / 3) * arrowSize); destArrowP2 = dstP + QPointF( sin(angle - Pi + Pi / 3) * arrowSize, cos(angle - Pi + Pi / 3) * arrowSize); pen.setStyle( Qt::SolidLine); painter->setPen( pen); QPainterPath arrow_path; QPainterPathStroker stroker; path = stroker.createStroke( path); stroker.setWidth( 0); arrow_path.addPolygon( QPolygonF() << dstP << destArrowP1 << destArrowP2 << dstP); path = path.united( arrow_path); // path = path.simplified(); //painter->drawPolygon(QPolygonF() << dstP << destArrowP1 << destArrowP2); } painter->drawPath( path); } codequery-0.18.1/showgraph/GraphView/edge_helper.h000066400000000000000000000101461300045745200221150ustar00rootroot00000000000000/** * @file: edge_item.h * Edge Widget class definition. */ /* * GUI for ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #ifndef EDGE_HELPER_H #define EDGE_HELPER_H #include "gview_impl.h" /** * states of edge helper */ enum EdgeHelperState { /* Initial state: mouse didn't move out of src node */ HELPER_STATE_INITIAL, /* regular state */ HELPER_STATE_REGULAR }; /** * Graphics item for visualizing an edge prototype so the user can see the future * edge during the creation process ( when he/she moves mouse holidng right button) * @ingroup GUIGraph */ class EdgeHelper: public QGraphicsItem { QPointF srcP; QPointF dstP; QPointF cp1; QPointF cp2; QPointF topLeft; QPointF btmRight; NodeItem *src_item; NodeItem *dst_item; EdgeHelperState state; public: /** Type of graphics item for edge */ enum {Type = TypeEdgeHelper}; /** Constructor */ EdgeHelper(); /** Get item type */ inline int type() const; /** Set source item */ inline void setSrc( NodeItem *item); /** Set destination item */ inline void setDst( NodeItem *item); /** Get source item */ inline NodeItem *src() const; /** Get destination item */ inline NodeItem *dst() const; /** Set destination point */ inline void setDstP( QPointF p); /** Reset state */ inline void reset(); /** promote state to regular */ inline void switchToRegular(); /** Adjust edge image */ void adjust(); /** Get bounding rectangle of edge image */ QRectF boundingRect() const; /** Get shape of the edge */ QPainterPath shape() const; /** Paint edge */ void paint(QPainter *painter, const QStyleOptionGraphicsItem *option, QWidget *widget); /** Convenience routine for self edge path */ QPainterPath selfEdgePath() const; }; /** promote state to regular */ inline void EdgeHelper::switchToRegular() { state = HELPER_STATE_REGULAR; } /** Reset state */ inline void EdgeHelper::reset() { src_item = NULL; dst_item = NULL; dstP = QPointF( 0, 0); state = HELPER_STATE_INITIAL; } /** Get item type */ inline int EdgeHelper::type() const { return Type; } /** Set source item */ inline void EdgeHelper::setSrc( NodeItem *item) { src_item = item; } /** Set destination item */ inline void EdgeHelper::setDst( NodeItem *item) { dst_item = item; } /** Get source item */ inline NodeItem * EdgeHelper::src() const { return src_item; } /** Get destination item */ inline NodeItem * EdgeHelper::dst() const { return dst_item; } /** Set destination point */ inline void EdgeHelper::setDstP( QPointF p) { dstP = p; } #endif /* EDGE_HELPER_H */ codequery-0.18.1/showgraph/GraphView/edge_item.cpp000066400000000000000000000505031300045745200221300ustar00rootroot00000000000000/** * @file: edge_item.cpp * Drawable edge implementation. * GUI for ShowGraph tool. */ /* * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #include "gview_impl.h" #include //#define SHOW_CONTROL_POINTS //#define SHOW_BACKEDGES GEdge::GEdge( GGraph *graph_p, int _id, GNode *_pred, GNode* _succ): AuxEdge( (AuxGraph *)graph_p, _id, (AuxNode *)_pred, (AuxNode *)_succ), _style( NULL) { item_p = new EdgeItem( this); graph()->view()->scene()->addItem( item_p); item_p->adjust(); graph()->invalidateRanking(); } GEdge::~GEdge() { graph()->invalidateRanking(); item()->remove(); graph()->view()->deleteLaterEdgeItem( item()); if ( isNotNullP( _style)) _style->decNumItems(); } GNode * GEdge::node( GraphDir dir) const { return static_cast< GNode *>(AuxEdge::node( dir)); } GNode * GEdge::realNode( GraphDir dir) const { return static_cast< GNode *>(AuxEdge::realNode( dir)); } GGraph * GEdge::graph() const { return static_cast< GGraph *>( AuxEdge::graph()); } /** * Update DOM tree element */ void GEdge::updateElement() { #if 0 QDomElement e = elem(); int i = 0; QDomElement new_e = graph()->createElement( "edge"); QDomNode e2 = graph()->documentElement().removeChild( e); assert( !e2.isNull()); graph()->documentElement().appendChild( new_e); setElement( new_e); e = new_e; #endif /* Base class method call to print generic edge properties */ AuxEdge::updateElement(); QDomElement e = elem(); /** Save style that describes this edge only along with edge */ if ( isNotNullP( style())) { if ( 1 == style()->numItems()) { e.removeAttribute("style"); style()->writeElement( e, false); } else { e.setAttribute("style", style()->name()); } } } /** Make all styles of edges connected with edge control or label the same */ void GEdge::adjustStyles() { GNode* succ_n = succ(); while ( succ_n->isEdgeControl() || succ_n->isEdgeLabel()) { assert( isNotNullP( succ_n->firstSucc())); succ_n->firstSucc()->setStyle( style()); succ_n = succ_n->firstSucc()->succ(); } GNode* pred_n = pred(); while ( pred_n->isEdgeControl() || pred_n->isEdgeLabel()) { assert( isNotNullP( pred_n->firstPred())); pred_n->firstPred()->setStyle( style()); pred_n = pred_n->firstPred()->pred(); } } /** * read properties from DOM tree element */ void GEdge::readFromElement( QDomElement e) { AuxEdge::readFromElement( e); // Base class method item()->adjust(); } /** * Insert node of label type */ GNode * GEdge::insertLabelNode( QPointF pos) { GNode *new_node = static_cast( insertNode()); new_node->setTypeEdgeLabel(); new_node->item()->setPlainText( "Label"); new_node->item()->setPos( pos + QPointF( new_node->item()->borderRect().width()/2, 0)); return new_node; } /** * Insert node with style propagation */ AuxNode * GEdge::insertNode() { GStyle *st = style(); GNode *new_node = static_cast( AuxEdge::insertNode()); //new_node->firstPred()->setStyle( st); new_node->firstSucc()->setStyle( st); return new_node; } /** * EdgeItem implementaion */ /** Constructor */ EdgeItem::EdgeItem( GEdge *e_p): edge_p( e_p) { curr_mode = ModeShow; QGraphicsItem::setCursor( Qt::ArrowCursor); setFlag( ItemIsSelectable); setFlag( ItemIsFocusable); //setCacheMode( DeviceCoordinateCache); setZValue(1); } QVariant EdgeItem::itemChange( GraphicsItemChange change, const QVariant &value) { if ( change == QGraphicsItem::ItemSelectedChange) { pred()->item()->update(); succ()->item()->update(); } return QGraphicsItem::itemChange( change, value); } /** Convenience routine for self edge path */ QPainterPath EdgeItem::selfEdgePath() const { assertd( edge()->isSelf()); QPainterPath path( srcP); QPointF center = mapFromItem( pred()->item(), pred()->item()->boundingRect().center()); QRectF r = pred()->item()->borderRect(); path.cubicTo( center + QPointF( 3 * r.width()/8, r.height()/2 + SE_VERT_MARGIN), btmRight, cp1); path.cubicTo( cp1 + QPointF( 0, -r.height()/2-SE_VERT_MARGIN), topLeft, dstP); return path; } void EdgeItem::adjust() { prepareGeometryChange(); if ( edge()->pred()->item()->isVisible() && edge()->succ()->item()->isVisible()) { setVisible( true); } else { setVisible( false); return; } if ( edge()->isSelf()) { QPointF center = mapFromItem( pred()->item(), pred()->item()->borderRect().center()); QRectF r = pred()->item()->borderRect(); srcP = center + QPointF( 3 * r.width()/8, r.height() /2); dstP = center + QPointF( 3 * r.width()/8, -r.height() /2); topLeft = center + QPointF( 3 * r.width()/8, -r.height()/2 - SE_VERT_MARGIN); cp1 = center + QPointF( (r.width() / 2) + SE_HOR_MARGIN, 0); btmRight = cp1 + QPointF( 0, r.height()/2 + SE_VERT_MARGIN); update(); return; } srcP = mapFromItem( pred()->item(), pred()->item()->boundingRect().center()); dstP = mapFromItem( succ()->item(), succ()->item()->boundingRect().center()); topLeft = srcP; btmRight = dstP; QPointF srcCP = srcP; QPointF dstCP = dstP; if ( pred()->isEdgeLabel()) { srcP = mapFromItem( pred()->item(), pred()->item()->borderRect().left(), pred()->item()->borderRect().center().y()); qreal w = pred()->item()->borderRect().width(); //srcP += QPointF( -w, 0); srcCP = srcP; } if ( succ()->isEdgeLabel()) { dstP = mapFromItem( succ()->item(), succ()->item()->borderRect().left(), succ()->item()->borderRect().center().y()); dstCP = dstP; } if ( pred()->isSimple()) { QLineF line( srcP, dstP); QPolygonF endPolygon = mapFromItem( pred()->item(), pred()->item()->shape().toFillPolygon()); QPointF p1 = endPolygon.first(); QPointF p2; QPointF intersectPoint; QLineF polyLine; for (int i = 1; i < endPolygon.count(); ++i) { p2 = endPolygon.at(i); polyLine = QLineF(p1, p2); QLineF::IntersectType intersectType = polyLine.intersect( line, &srcP); if (intersectType == QLineF::BoundedIntersection) break; p1 = p2; } } if ( succ()->isSimple()) { QLineF line2( srcP, dstP); QPolygonF endPolygon = mapFromItem( succ()->item(), succ()->item()->shape().toFillPolygon()); QPointF p1 = endPolygon.first();; QPointF p2; QLineF polyLine; for ( int i = 1; i < endPolygon.count(); ++i) { p2 = endPolygon.at(i); polyLine = QLineF(p1, p2); QLineF::IntersectType intersectType = polyLine.intersect( line2, &dstP); if ( intersectType == QLineF::BoundedIntersection) break; p1 = p2; } } topLeft.setX( min< qreal>( srcP.x(), dstP.x())); topLeft.setY( min< qreal>( srcP.y(), dstP.y())); btmRight.setX( max< qreal>( srcP.x(), dstP.x())); btmRight.setY( max< qreal>( srcP.y(), dstP.y())); QLineF mainLine = QLineF( srcP, dstP); if ( mainLine.length() < 1) return; qreal size = abs< qreal>(( min< qreal>( abs< qreal>( mainLine.dx()), abs< qreal>( mainLine.dy())))); //Stub if( size < 2* EdgeControlSize) { size = 2* EdgeControlSize; } if( size > 20 * EdgeControlSize) { size = 20 * EdgeControlSize; } NodeItem *next_pred = NULL; NodeItem *next_succ = NULL; if ( ( pred()->isEdgeControl() || pred()->isEdgeLabel()) && isNotNullP( pred()->firstPred())) { next_pred = pred()->firstPred()->pred()->item(); } if ( ( succ()->isEdgeControl() || succ()->isEdgeLabel()) && isNotNullP( succ()->firstSucc())) { next_succ = succ()->firstSucc()->succ()->item(); } /** Place cp1 */ if ( isNotNullP( next_pred)) { QPointF p1 = mapFromItem( next_pred, next_pred->borderRect().center()); QLineF line( p1, dstCP); QPointF cp1_offset = QPointF( (line.dx() * size)/ line.length(), (line.dy() * size)/ line.length()); cp1 = srcP + cp1_offset; } else { QPointF cp1_offset = QPointF( (mainLine.dx() * size)/ mainLine.length(), (mainLine.dy() * size)/ mainLine.length()); cp1 = srcP + cp1_offset; } topLeft.setX( min< qreal>( topLeft.x(), cp1.x())); topLeft.setY( min< qreal>( topLeft.y(), cp1.y())); btmRight.setX( max< qreal>( btmRight.x(), cp1.x())); btmRight.setY( max< qreal>( btmRight.y(), cp1.y())); /** Place cp2 */ if ( isNotNullP( next_succ)) { QPointF p2 = mapFromItem( next_succ, next_succ->borderRect().center()); QLineF line( p2, srcCP); QPointF cp2_offset = QPointF( (line.dx() * size)/ line.length(), (line.dy() * size)/ line.length()); cp2 = dstP + cp2_offset; } else { QPointF cp2_offset = QPointF( -(mainLine.dx() * size)/ mainLine.length(), -(mainLine.dy() * size)/ mainLine.length()); cp2 = dstP + cp2_offset; } topLeft.setX( min< qreal>( topLeft.x(), cp2.x())); topLeft.setY( min< qreal>( topLeft.y(), cp2.y())); btmRight.setX( max< qreal>( btmRight.x(), cp2.x())); btmRight.setY( max< qreal>( btmRight.y(), cp2.y())); update(); } QRectF EdgeItem::boundingRect() const { qreal penWidth = 1; qreal extra = arrowSize; return QRectF( topLeft, QSizeF( btmRight.x() - topLeft.x(), btmRight.y() - topLeft.y())) .normalized() .adjusted(-extra, -extra, extra, extra); } QPainterPath EdgeItem::shape() const { QPainterPath path( srcP); QPainterPathStroker stroker; if ( srcP == dstP) return path; if ( edge()->isSelf()) { path = selfEdgePath(); } else { path.cubicTo( cp1, cp2, dstP); } if ( isNotNullP( edge()->style())) { stroker.setWidth( edge()->style()->pen().width() + 1); } else { stroker.setWidth( 2); } return stroker.createStroke( path); } void EdgeItem::paint( QPainter *painter, const QStyleOptionGraphicsItem *option, QWidget *widget) { if ( option->levelOfDetail < 0.1) return; /** Do not draw edges when adjacent nodes intersect */ QPolygonF pred_rect = mapFromItem( pred()->item(), pred()->item()->boundingRect()); QPolygonF succ_rect = mapFromItem( succ()->item(), succ()->item()->boundingRect()); if ( !succ_rect.intersected( pred_rect).isEmpty()) return; static const qreal spline_detail_level = 0.4; static const qreal draw_arrow_detail_level = 0.3; QPointF curr_point; QLineF line = QLineF(); curr_point = srcP; QPointF nextToDst = srcP; qreal opacity = min( edge()->pred()->item()->opacityLevel(), edge()->succ()->item()->opacityLevel()); line.setP1( nextToDst); line.setP2( dstP); QPainterPath path( srcP); QPainterPathStroker stroker; stroker.setWidth( 0); if ( edge()->isSelf()) { path = selfEdgePath(); } else if ( option->levelOfDetail >= spline_detail_level) { path.cubicTo( cp1, cp2, dstP); } //path = stroker.createStroke(path); if ( nextToDst == dstP) return; //Set opacity if ( edge()->graph()->view()->isContext()) painter->setOpacity( opacity); QPen pen( option->palette.foreground().color(), 1, Qt::SolidLine, Qt::RoundCap, Qt::RoundJoin); if ( isNotNullP( edge()->style())) { pen = edge()->style()->pen(); } // Draw the line itself if ( option->levelOfDetail >= spline_detail_level) { if ( option->state & QStyle::State_Selected) { pen.setWidthF( pen.widthF() + 1); } } else { pen = QPen( pen.color(),1); } painter->setPen( pen); //Draw edge if ( edge()->isSelf() || option->levelOfDetail >= spline_detail_level) { painter->drawPath( path); } else { painter->drawLine( line); } // Draw the arrows if there's enough room and level of detail is appropriate if ( option->levelOfDetail >= draw_arrow_detail_level) { double angle = ::acos(line.dx() / line.length()); if ( line.dy() >= 0) angle = TwoPi - angle; QPointF destArrowP1; QPointF destArrowP2; /* NOTE: Qt::black can be replaced by option->palette.foreground().color() */ if ( isNotNullP( edge()->style())) { painter->setBrush( edge()->style()->pen().color()); } else { painter->setBrush(option->palette.foreground().color()); } if ( edge()->isSelf()) { angle = -2* Pi/3; } destArrowP1 = dstP + QPointF( sin(angle - Pi / 3) * arrowSize, cos(angle - Pi / 3) * arrowSize); destArrowP2 = dstP + QPointF( sin(angle - Pi + Pi / 3) * arrowSize, cos(angle - Pi + Pi / 3) * arrowSize); pen.setStyle( Qt::SolidLine); painter->setPen( pen); if ( succ()->isSimple()) { QPainterPath arrow_path; arrow_path.addPolygon( QPolygonF() << dstP << destArrowP1 << destArrowP2 << dstP); //path = path.united( arrow_path); painter->drawPolygon(QPolygonF() << dstP << destArrowP1 << destArrowP2); } } painter->setOpacity( 1); #ifdef SHOW_CONTROL_POINTS /** For illustrative purposes */ painter->setPen(QPen(Qt::gray, 1, Qt::DashLine, Qt::RoundCap, Qt::RoundJoin)); if ( !edge()->isSelf()) { painter->drawLine( srcP, dstP); painter->drawLine( srcP, cp1); painter->drawLine( cp2, dstP); } painter->setPen(QPen(Qt::red, 2, Qt::SolidLine, Qt::RoundCap, Qt::RoundJoin)); painter->drawPoint( srcP); painter->setPen(QPen(Qt::blue, 2, Qt::SolidLine, Qt::RoundCap, Qt::RoundJoin)); painter->drawPoint( dstP); painter->setPen(QPen(Qt::green, 2, Qt::SolidLine, Qt::RoundCap, Qt::RoundJoin)); painter->drawPoint( cp1); #endif } void EdgeItem::mousePressEvent(QGraphicsSceneMouseEvent *event) { update(); if ( event->button() & Qt::RightButton) { adjust(); } if ( event->button() == Qt::LeftButton && (flags() & ItemIsSelectable)) { bool multiSelect = ( event->modifiers() & Qt::ControlModifier) != 0; if ( !multiSelect) { if ( !isSelected()) { if (scene()) scene()->clearSelection(); setSelected(true); } } } else if ( !(flags() & ItemIsMovable)) { // event->ignore(); } } void EdgeItem::mouseReleaseEvent(QGraphicsSceneMouseEvent *ev) { update(); /** Select this edge */ edge()->graph()->emptySelection(); edge()->graph()->selectEdge( this->edge()); /** Show context menu */ if ( ev->button() & Qt::RightButton) { QMenu *menu = edge()->graph()->view()->createMenuForEdge( edge()); edge()->graph()->view()->setCurrPos( ev->pos()); menu->exec( ev->screenPos()); delete menu; } QGraphicsItem::mouseReleaseEvent( ev); } void EdgeItem::mouseDoubleClickEvent(QGraphicsSceneMouseEvent *ev) { if( edge()->graph()->view()->isEditable() && ev->button() & Qt::LeftButton) { if ( edge()->isSelf()) { GNode* new_node1 = static_cast( edge()->insertNode()); GNode* new_node2 = static_cast( edge()->insertNode()); new_node1->setTypeEdgeControl(); new_node2->setTypeEdgeControl(); new_node1->item()->setPos( ev->pos() + QPointF( 0, -10)); new_node2->item()->setPos( ev->pos() + QPointF( 0, 10)); } else { GNode* new_node = static_cast( edge()->insertNode()); new_node->setTypeEdgeControl(); new_node->item()->setPos( ev->pos()); } } } void EdgeItem::keyPressEvent(QKeyEvent *event) { int key = event->key(); GNode *n = NULL; GEdge *e = NULL; VEdge vedge( edge()); NavSector sector = edge()->graph()->nodeNavigationSector(); GNode *curr_node = edge()->graph()->nodeInFocus(); NodeNav node_nav( curr_node, sector); switch( key) { case Qt::Key_Up: if ( isNotNullP( curr_node) && ( sector == LEFT_SECTOR || sector == RIGHT_SECTOR)) { e = node_nav.edgeInDir( edge(), NAV_DIR_UP); } else { n = vedge.nodeUp(); } break; case Qt::Key_Down: if ( isNotNullP( curr_node) && ( sector == LEFT_SECTOR || sector == RIGHT_SECTOR) ) { e = node_nav.edgeInDir( edge(), NAV_DIR_DOWN); } else { n = vedge.nodeDown(); } break; case Qt::Key_Left: if ( isNotNullP( curr_node) && ( sector == TOP_SECTOR || sector == BOTTOM_SECTOR) ) { e = node_nav.edgeInDir( edge(), NAV_DIR_LEFT); } else { n = vedge.nodeLeft(); } break; case Qt::Key_Right: if ( isNotNullP( curr_node) && ( sector == TOP_SECTOR || sector == BOTTOM_SECTOR) ) { e = node_nav.edgeInDir( edge(), NAV_DIR_RIGHT); } else { n = vedge.nodeRight(); } break; default: break; } if ( isNotNullP( n)) { if ( edge()->graph()->view()->isContext()) { edge()->graph()->emptySelection(); edge()->graph()->selectNode( n); edge()->graph()->view()->findContext(); } edge()->graph()->view()->focusOnNode( n, true); scene()->clearFocus(); scene()->clearSelection(); n->item()->setFocus(); n->item()->setSelected( true); } else if ( isNotNullP( e)) { // Get focus on edge scene()->clearFocus(); scene()->clearSelection(); e->item()->setFocus(); e->item()->setSelected( true); } //QGraphicsItem::keyPressEvent( event); } codequery-0.18.1/showgraph/GraphView/edge_item.h000066400000000000000000000156061300045745200216020ustar00rootroot00000000000000/** * @file: edge_item.h * Edge Widget class definition. */ /* * GUI for ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #ifndef EDGE_W_H #define EDGE_W_H #include "gview_impl.h" /** size of edge control */ const qreal EdgeControlSize = 5; /** * Representation of drawable edge * @ingroup GUIGraph */ class GEdge: public AuxEdge { /** Pointer to corresponding graphics item */ EdgeItem *item_p; /** Graphical appearance style */ GStyle *_style; protected: /** Default constructor */ GEdge( GGraph *graph_p, int _id, GNode *_pred, GNode* _succ); friend class GGraph; friend class Node; public: /** * Return pointer to graph */ GGraph *graph() const; /** Destructor */ virtual ~GEdge(); /** * Return associated graphics item */ inline EdgeItem *item() const { return item_p; } /** * Update DOM element */ virtual void updateElement(); /** * Read properties from XML */ virtual void readFromElement( QDomElement elem); /** Overload of setNode from base class */ inline void setNode( GNode *n, GraphDir dir) { AuxEdge::setNode( ( AuxNode *)n, dir); } /** Set predecessor */ inline void setPred( GNode *n) { setNode( n, GRAPH_DIR_UP); } /** Set successor */ inline void setSucc( GNode *n) { setNode( n, GRAPH_DIR_DOWN); } /** Get node in given direction */ GNode *node( GraphDir dir) const; /** Get predecessor */ inline GNode *pred() const { return node( GRAPH_DIR_UP); } /** Get successor */ inline GNode *succ() const { return node( GRAPH_DIR_DOWN); } /** Get real node in given direction */ GNode* realNode( GraphDir) const; /** Get real predecessor */ inline GNode* realPred() const { return realNode( GRAPH_DIR_UP); } /** Get real successor */ inline GNode* realSucc() const { return realNode( GRAPH_DIR_DOWN); } /** Next edge in graph's list */ inline GEdge* nextEdge() { return static_cast< GEdge *>(AuxEdge::nextEdge()); } /** Next edge in give direction */ inline GEdge* nextEdgeInDir( GraphDir dir) { return static_cast< GEdge *>(AuxEdge::nextEdgeInDir( dir)); } /** Next successor */ inline GEdge* nextSucc() { return nextEdgeInDir( GRAPH_DIR_DOWN); } /** Next predecessor */ inline GEdge* nextPred() { return nextEdgeInDir( GRAPH_DIR_UP); } /** Insert node of label type */ GNode *insertLabelNode( QPointF pos); /** Set edge's style */ inline void setStyle( GStyle *st); /** Get edge's style */ inline GStyle * style() const { return _style; } /** Insert node */ virtual AuxNode *insertNode(); /** Make all styles the same across complex edge */ void adjustStyles(); }; /** * Graphics item for visualizing a graph edge * @ingroup GUIGraph */ class EdgeItem: public QGraphicsItem { public: /** Modes of an edge */ typedef enum EdgeMode { ModeShow, ModeEdit } EdgeMode; private: /** Graph connection */ GEdge* edge_p; QPointF srcP; QPointF cp1; QPointF cp2; QPointF dstP; QPointF topLeft; QPointF btmRight; EdgeMode curr_mode; public: /** Type of graphics item for edge */ enum {Type = TypeEdge}; /** Constructor */ EdgeItem( GEdge *e_p); /** Get item type */ int type() const { return Type; } /** Adjust edge image */ void adjust(); /** Get corresponding edge of the graph */ inline GEdge* edge() const { return edge_p; } /** Get mode */ inline EdgeMode mode() const { return curr_mode; } /** Set mode */ inline void setMode( EdgeMode m) { curr_mode = m; } /** Get bounding rectangle of edge image */ QRectF boundingRect() const; /** Get shape of the edge */ QPainterPath shape() const; /** Event handler for change */ QVariant itemChange( GraphicsItemChange change, const QVariant &value); /** Paint edge */ void paint(QPainter *painter, const QStyleOptionGraphicsItem *option, QWidget *widget); /** Event handler for mouse press */ void mousePressEvent(QGraphicsSceneMouseEvent *event); /** Event handler for mouse release */ void mouseReleaseEvent(QGraphicsSceneMouseEvent *event); /** Event handler for double click */ void mouseDoubleClickEvent(QGraphicsSceneMouseEvent *event); /** Key press event handler */ void keyPressEvent(QKeyEvent *event); /** Get predecessor in terms of graph model */ inline GNode* pred() const { return edge()->pred(); } /** Get successor in terms of graph model */ inline GNode* succ() const { return edge()->succ(); } /** Remove from scene */ inline void remove() { setVisible( false); removeFromIndex(); scene()->removeItem( this); edge_p = NULL; } /** Convenience routine for self edge path */ QPainterPath selfEdgePath() const; }; /** Set edge's style */ inline void GEdge::setStyle( GStyle *st) { if ( areNotEqP( _style, st)) { if ( isNotNullP( _style)) _style->decNumItems(); _style = st; if ( isNotNullP( _style)) _style->incNumItems(); } item()->update(); } #endifcodequery-0.18.1/showgraph/GraphView/graph_view.cpp000066400000000000000000001177521300045745200223530ustar00rootroot00000000000000/** * @file: graph_view.cpp * Graph View Widget implementation. */ /* * GUI for ShowGraph tool. * Copyright (C) 2009 Boris Shurygin */ #include "gview_impl.h" /** * Compute scale parameter from user-controlled zoom factor */ inline qreal scaleVal( qreal zoom_scale) { return qPow( qreal(2), zoom_scale / qreal(5)); } /** Destructor */ GGraph::~GGraph() { freeMarker( nodeTextIsShown); for ( GNode *node = firstNode(); isNotNullP( node); ) { GNode* next = node->nextNode(); int ir_id = node->irId(); deleteNode( node); node = next; } foreach ( GStyle *style, styles) { delete style; } } GNode* GGraph::newNode() { GNode* n = static_cast< GNode *>( AuxGraph::newNode()); return n; } GEdge* GGraph::newEdge( GNode* pred, GNode* succ) { GEdge* e = static_cast< GEdge *>( AuxGraph::newEdge( (AuxNode *)pred, (AuxNode *)succ)); return e; } GNode* GGraph::newNode( QDomElement e) { GNode* n = static_cast< GNode *>( AuxGraph::newNode( e)); return n; } GEdge* GGraph::newEdge( GNode* pred, GNode* succ, QDomElement e) { GEdge* edge_p = static_cast< GEdge *>( AuxGraph::newEdge( (AuxNode *)pred, (AuxNode *)succ, e)); return edge_p; } void GGraph::selectOneNode( GNode* n) { emptySelection(); selectNode( n); n->item()->highlight(); n->item()->update(); } /** * Change node's style */ void GGraph::setNodeStyle( GStyle *style) { if ( sel_nodes.isEmpty()) return; GNode* node = sel_nodes.first(); node->setStyle( style); node->item()->adjustAssociates(); } /** * Change edge's style */ void GGraph::setEdgeStyle( GStyle *style) { if ( sel_edges.isEmpty()) return; GEdge* edge = sel_edges.first(); edge->setStyle( style); edge->item()->adjust(); } void GGraph::showNodesText() { foreach (GNode *n, sel_nodes) { view()->showNodeText( n); } } /** * Delete scheduled nodes */ void GGraph::deleteNodes() { foreach (GNode *n, sel_nodes) { deleteNode( n); } sel_nodes.clear(); } /** * Delete scheduled edges */ void GGraph::deleteEdges() { foreach (GEdge *e, sel_edges) { deleteEdgeWithControls( e); } sel_edges.clear(); } /** * Create self edge on selected node */ void GGraph::createSelfEdge() { if ( !sel_nodes.isEmpty()) { GNode *n = sel_nodes.first(); newEdge( n, n); } } /** Create label on selected edge */ void GGraph::createEdgeLabel( QPointF pos) { if ( !sel_edges.isEmpty()) { sel_edges.first()->insertLabelNode( pos); } } void GGraph::showEdgePred() { if ( !sel_edges.isEmpty()) { if ( view()->isContext()) { selectNode( sel_edges.first()->realPred()); view()->findContext(); } else { view()->focusOnNode( sel_edges.first()->realPred(), true); } } } void GGraph::showEdgeSucc() { if ( !sel_edges.isEmpty()) { if ( view()->isContext()) { selectNode( sel_edges.first()->realSucc()); view()->findContext(); } else { view()->focusOnNode( sel_edges.first()->realSucc(), true); } } } void GGraph::clearNodesPriority() { GNode* n; foreachNode( n, this) { n->setPriority( 0); } } /** Style edit finished */ void GraphView::styleEditFinished( int result) { if ( isNotNullP( style_edit_info->node)) { GNode *node = style_edit_info->node; GStyle *old_style = style_edit_info->old_style; GStyle *new_style = style_edit_info->new_style; if ( result == QDialog::Accepted) { if ( isNotNullP( old_style)) { *(old_style) = *(new_style); node->setStyle( old_style); delete new_style; } else { QString name = QString("node %1 style").arg(node->id()); new_style->setName( name); graph()->addStyle( name, new_style); } } else { node->setStyle( old_style); delete new_style; } node->item()->adjustAssociates(); } else { } style_edit_info->dialog->disconnect(); style_edit_info->dialog->deleteLater(); delete style_edit_info; } void GGraph::showEditEdgeStyle() { if ( sel_edges.isEmpty()) return; StyleEdit dialog; GEdge* edge = sel_edges.first(); GStyle* old_style = edge->style(); GStyle* new_style; if ( isNullP( old_style)) { QColor color( view()->palette().foreground().color()); new_style = new GStyle(); new_style->setPenColor( color); new_style->setPenWidth( 1); } else { new_style = new GStyle( *edge->style()); } dialog.setWindowTitle( "Edge style editor"); dialog.setGStyle( new_style); edge->setStyle( new_style); connect( &dialog, SIGNAL( styleChanged( GStyle *)), view(), SLOT( setEdgeStyle( GStyle *))); if ( dialog.exec() == QDialog::Accepted) { if ( isNotNullP( old_style)) { *(old_style) = *(new_style); edge->setStyle( old_style); delete new_style; } else { QString name = QString("edge %1 style").arg(edge->id()); new_style->setName( name); styles[ name] = new_style; } } else { edge->setStyle( old_style); delete new_style; } edge->adjustStyles(); edge->item()->adjust(); } void GGraph::showEditNodeStyle() { if ( sel_nodes.isEmpty()) return; StyleEdit* dialog = new StyleEdit( NULL, true); GNode* node = sel_nodes.first(); GStyle* old_style = node->style(); GStyle* new_style; if ( isNullP( old_style)) { QColor color( view()->palette().foreground().color()); new_style = new GStyle(); new_style->setPenColor( color); new_style->setPenWidth( 1); } else { new_style = new GStyle( *node->style()); } view()->setStyleEditInfo( new GraphView::StyleEditInfo( node, old_style, new_style, dialog)); dialog->setWindowTitle( "Node style editor"); dialog->setGStyle( new_style); node->setStyle( new_style); connect( dialog, SIGNAL( styleChanged( GStyle *)), view(), SLOT( setNodeStyle( GStyle *))); connect( dialog, SIGNAL( finished( int)), view(), SLOT( styleEditFinished( int))); dialog->exec(); } void GGraph::showWholeGraph() { assert( !view()->isContext()); emptySelection(); GNode* n; foreachNode( n, this) { n->item()->setVisible( true); n->item()->setOpacityLevel( 1); n->setPriority( MAX_OPACITY); n->setForPlacement( true); n->setStable( false); n->item()->update(); } doLayout(); } /** Create label on selected edge */ void GGraph::findContext() { if ( sel_nodes.isEmpty()) return; QQueue< GNode *> border; Marker m = newMarker(); foreach( GNode *n, sel_nodes) { n->mark( m); n->setPriority( GVIEW_MAX_PRIORITY); //n->setStable( true); border.enqueue( n); } for ( int i = 0; i < MAX_PLACE_LEN; i++) { int added = border.count(); for ( int j = 0; j < added; j++) { GNode *n = border.dequeue(); if ( !n->isPseudo()) { selectNode( n); n->item()->highlight(); } n->item()->update(); GEdge *e; foreachPred( e, n) { GNode * pred = e->pred(); if ( pred->mark( m)) { if ( i <= MAX_VISIBLE_LEN && pred->priority() < MAX_VISIBLE_LEN - i) { pred->setPriority( MAX_VISIBLE_LEN - i); }/* else { pred->setPriority( 0); }*/ border.enqueue( pred); } } foreachSucc( e, n) { GNode * succ = e->succ(); if ( succ->mark( m)) { if ( i <= MAX_VISIBLE_LEN && succ->priority() < MAX_VISIBLE_LEN - i) { succ->setPriority( MAX_VISIBLE_LEN - i); }/* else { succ->setPriority( 0); }*/ border.enqueue( succ); } } } } if ( view()->isContext()) { GNode* n; foreachNode( n, this) { /*if ( n->item()->isVisible()) { n->setStable(); }*/ if ( n->isMarked( m)) { if ( !n->item()->isVisible()) { n->item()->setVisible( true); n->item()->setOpacityLevel( 0); } n->setForPlacement( true); } else { if ( n->priority() < GVIEW_MAX_PRIORITY) { n->setPriority( 0); n->setForPlacement( false); } n->setStable( false); } } GEdge *e; foreachEdge( e, this) { if ( e->pred()->isPseudo() && e->succ()->isPseudo()) { if ( e->realPred()->item()->isVisible() && e->realSucc()->item()->isVisible()) { int priority = min( e->realPred()->priority(), e->realSucc()->priority()); e->pred()->item()->setVisible( true); e->succ()->item()->setVisible( true); e->pred()->setForPlacement( true); e->succ()->setForPlacement( true); e->pred()->setPriority( priority); e->succ()->setPriority( priority); } } } selectOneNode( sel_nodes.first()); if ( view()->hasSmoothFocus()) { view()->focusOnNode( sel_nodes.first(), true); } doLayout(); foreachNode( n, this) { if ( n->item()->isVisible() && !n->item()->opacityLevel()) { n->item()->setPos( n->modelX(), n->modelY()); } } view()->startAnimationNodes(); } freeMarker( m); } void GGraph::deleteEdgeWithControls( GEdge *edge) { QList< GNode *> nodes; QList< GEdge *> edges; /** Check successor */ GNode * succ = edge->succ(); while ( succ->isEdgeControl() || succ->isEdgeLabel()) { assert( isNotNullP( succ->firstSucc())); nodes << succ; edges << succ->firstSucc(); succ = succ->firstSucc()->succ(); } GNode * pred = edge->pred(); while ( pred->isEdgeControl() || pred->isEdgeLabel()) { assert( isNotNullP( pred->firstPred())); nodes << pred; edges << pred->firstPred(); pred = pred->firstPred()->pred(); } deleteEdge( edge); foreach ( GEdge *e, edges) { deleteEdge( e); } foreach ( GNode *n, nodes) { deleteNode( n); } } void GGraph::UpdatePlacement() { QGraphicsScene *scene = view()->scene(); /** * Prevent BSP tree from being modified - significantly speeds up node positioning * For this purpose tree depth is set to one and indexing is turned off */ int depth = scene->bspTreeDepth(); scene->setBspTreeDepth( 1); scene->setItemIndexMethod( QGraphicsScene::NoIndex); GNode *n; for ( n = firstNode(); isNotNullP( n); n = n->nextNode()) { qreal x, y; if ( !n->isEdgeControl()) { x = n->modelX() + ( n->item()->borderRect().width() - n->item()->textRect().width()) / 2; y = n->modelY() + ( n->item()->borderRect().height() - n->item()->textRect().height()) / 2; //QString str = QString("DFS num %1").arg(n->order()); //n->item()->setPlainText(str); } else { x = n->modelX() + n->item()->borderRect().width() / 2; y = n->modelY() + n->item()->borderRect().height() / 2; } n->item()->setPos( x, y); } GEdge *e; foreachNode( n, this) { n->item()->show(); } foreachEdge( e, this) { e->item()->show(); } /** Restore indexing */ scene->setItemIndexMethod( QGraphicsScene::BspTreeIndex); scene->setBspTreeDepth( depth); } /** * Run layout procedure */ void GGraph::doLayout() { if ( view()->isContext()) { if ( rankingValid()) { arrangeHorizontally(); } else { /** Run layout algorithm */ AuxGraph::doLayout(); UpdatePlacement(); } } else { GNode *n; GEdge *e; foreachNode( n, this) { n->item()->hide(); } foreachEdge( e, this) { e->item()->hide(); } /** Run layout algorithm */ AuxGraph::doLayoutConcurrent(); //AuxGraph::doLayout(); //layoutPostProcess(); } } /** * Run layout procedure in single thread */ void GGraph::doLayoutSingle() { if ( view()->isContext()) { if ( rankingValid()) { arrangeHorizontally(); } else { /** Run layout algorithm */ AuxGraph::doLayout(); UpdatePlacement(); } } else { GNode *n; GEdge *e; foreachNode( n, this) { n->item()->hide(); } foreachEdge( e, this) { e->item()->hide(); } /** Run layout algorithm */ AuxGraph::doLayout(); layoutPostProcess(); } } void GGraph::layoutPostProcess() { UpdatePlacement(); /** Center view on root node */ GNode *root = static_cast( rootNode()); if ( isNotNullP( root)) { view_p->centerOn( root->item()); } } /** Constructor */ GraphView::GraphView(): curr_pos(), createEdge( false), graph_p( 0), zoom_scale( 0), view_history( new GraphViewHistory), timer_id( 0), node_animation_timer( 0), smooth_focus( false), editable( false), view_mode( WHOLE_GRAPH_VIEW), style_edit_info( NULL), helper( new EdgeHelper) { QGraphicsScene *scene = new QGraphicsScene( this); //scene->setItemIndexMethod( QGraphicsScene::NoIndex); //scene->setSceneRect(0, 0, 10000, 10000); setScene( scene); //setCacheMode( CacheBackground); setViewportUpdateMode( SmartViewportUpdate); setRenderHint( QPainter::Antialiasing); setTransformationAnchor( AnchorViewCenter); setResizeAnchor( AnchorViewCenter); setMinimumSize( 200, 200); setWindowTitle( tr("ShowGraph")); setDragMode( ScrollHandDrag); //setDragMode( RubberBandDrag); tmpSrc = NULL; search_node = NULL; createActions(); createMenus(); show_menus = true; setAcceptDrops( false); scene->addItem( helper); } /** Destructor */ GraphView::~GraphView() { scene()->setItemIndexMethod( QGraphicsScene::NoIndex); delete graph_p; delete view_history; delete helper; } void GraphView::startAnimationNodes() { if ( !node_animation_timer) node_animation_timer = startTimer(1000/25); } void GraphView::drawBackground(QPainter *painter, const QRectF &rect) { } void GraphView::mouseDoubleClickEvent(QMouseEvent *ev) { QGraphicsView::mouseDoubleClickEvent( ev); if( ev->button() & Qt::LeftButton) { QPoint p = ev->pos(); #ifdef USE_QT5 if ( isEditable() && !scene()->itemAt( mapToScene( ev->pos()), QTransform())) #else if ( isEditable() && !scene()->itemAt( mapToScene( ev->pos()))) #endif { GNode* node = graph()->newNode(); QString text = QString("Node %1").arg( node->id()); node->item()->setPlainText( text); node->item()->setPos( mapToScene( p)); } } else if( isEditable() && ev->button() & Qt::RightButton) { #ifdef USE_QT5 QGraphicsItem *node = scene()->itemAt( mapToScene( ev->pos()), QTransform()); #else QGraphicsItem *node = scene()->itemAt( mapToScene( ev->pos())); #endif if ( isNotNullP( node) && qgraphicsitem_cast( node)) { graph()->emptySelection(); graph()->setNodeInFocus( NULL); graph()->deleteNode( qgraphicsitem_cast( node)->node()); } } } void GraphView::mousePressEvent(QMouseEvent *ev) { if( timer_id) { killTimer( timer_id); timer_id = 0; } QGraphicsView::mousePressEvent( ev); } /** Enable/disable edition */ void GraphView::toggleEdition( bool e) { setEditable( e); } /** Insert node in center of view */ void GraphView::insertNodeOnCenter() { } /** Run layout */ void GraphView::runLayout() { graph()->doLayout(); } void GraphView::contextMenuEvent( QContextMenuEvent * e) { } void GraphView::mouseReleaseEvent( QMouseEvent *ev) { if( ev->button() & Qt::RightButton) { if ( createEdge) { #ifdef USE_QT5 QGraphicsItem* item = scene()->itemAt( mapToScene( ev->pos()), QTransform()); #else QGraphicsItem* item = scene()->itemAt( mapToScene( ev->pos())); #endif if ( isNotNullP( item) && qgraphicsitem_cast(item)) { if ( tmpSrc != qgraphicsitem_cast(item)->node()) { GNode* dst_node = qgraphicsitem_cast(item)->node(); if ( tmpSrc->isSimple() && dst_node->isSimple()) { graph()->newEdge( tmpSrc, dst_node); show_menus = false; } } } #ifdef USE_QT5 } else if ( !scene()->itemAt( mapToScene( ev->pos()), QTransform())) #else } else if ( !scene()->itemAt( mapToScene( ev->pos()))) #endif { QMenu *menu = new QMenu( tr( "&View Menu")); menu->addAction( editableSwitchAct); menu->addAction( runLayoutAct); menu->exec( mapToGlobal( ev->pos())); delete menu; } } helper->hide(); helper->reset(); QGraphicsView::mouseReleaseEvent(ev); createEdge = false; show_menus = true; tmpSrc = NULL; } void GraphView::mouseMoveEvent(QMouseEvent *ev) { if ( createEdge) { #ifdef USE_QT5 QGraphicsItem* item = scene()->itemAt( mapToScene( ev->pos()), QTransform()); #else QGraphicsItem* item = scene()->itemAt( mapToScene( ev->pos())); #endif if ( isNotNullP( item)) { NodeItem *node_item = qgraphicsitem_cast(item); if ( isNotNullP( node_item) && node_item->node()->isSimple()) { if ( areNotEqP( node_item->node(), tmpSrc)) helper->switchToRegular(); helper->setDst( node_item); } else { helper->switchToRegular(); helper->setDstP( helper->mapFromScene( mapToScene( ev->pos()))); helper->setDst( NULL); } } else { helper->switchToRegular(); helper->setDstP( helper->mapFromScene( mapToScene( ev->pos()))); helper->setDst( NULL); } helper->adjust(); } QGraphicsView::mouseMoveEvent(ev); } void GraphView::keyPressEvent(QKeyEvent *event) { QGraphicsView::keyPressEvent( event); if ( !event->isAccepted()) { if ( event->key() == Qt::Key_Plus) { zoomIn(); } else if ( event->key() == Qt::Key_Minus) { zoomOut(); } } } /** * Actions for wheel event */ void GraphView::wheelEvent(QWheelEvent *event) { zoom_scale += event->delta() / 100; updateMatrix(); } void GraphView::zoomIn() { zoom_scale++; updateMatrix(); } void GraphView::zoomOut() { zoom_scale--; updateMatrix(); } void GraphView::zoomOrig() { zoom_scale = 0; ensureVisible( 0,0,0,0); checkDelItems(); updateMatrix(); } void GraphView::updateMatrix() { qreal scale_val = scaleVal( zoom_scale); QMatrix scale; qreal prev_scale = matrix().m11(); qreal scale_ratio = scale_val / prev_scale; scale.scale( scale_val, scale_val); GNode * focus = graph()->nodeInFocus(); if ( isNotNullP( focus)) { QPointF item_center = focus->item()->mapToScene( focus->item()->boundingRect()) .boundingRect() .center(); QPointF old_center = mapToScene( viewport()->rect()) .boundingRect() .center(); QPointF item_in_view = item_center - old_center; setMatrix( scale); // scale QPointF new_center = old_center + item_in_view * ( scale_ratio - 1) / scale_ratio; centerOn( new_center); // adjust to keep focus point in place } else { setMatrix( scale); } } void GraphView::deleteItems() { int depth = scene()->bspTreeDepth(); scene()->setBspTreeDepth( 1); scene()->setItemIndexMethod( QGraphicsScene::NoIndex); foreach ( NodeItem* item, del_node_items) { del_node_items.removeAll( item); delete item; } foreach ( EdgeItem* item, del_edge_items) { del_edge_items.removeAll( item); delete item; } scene()->setItemIndexMethod( QGraphicsScene::BspTreeIndex); scene()->setBspTreeDepth( depth); } void GraphView::deleteSelected() { graph()->deleteNodes(); graph()->deleteEdges(); } void GraphView::createSESelected() { graph()->createSelfEdge(); } void GraphView::createEdgeLabel() { graph()->createEdgeLabel( curr_pos); } void GraphView::showEdgePred() { graph()->showEdgePred(); } void GraphView::showEdgeSucc() { graph()->showEdgeSucc(); } void GraphView::findContext() { graph()->findContext(); } /** Show text of the clicked node */ void GraphView::showSelectedNodesText() { graph()->showNodesText(); } /** Show style editor for node */ void GraphView::showEditNodeStyle() { graph()->showEditNodeStyle(); } /** Show style editor for edge */ void GraphView::showEditEdgeStyle() { graph()->showEditEdgeStyle(); } void GraphView::createActions() { QString system = QLatin1String("win"); #ifdef Q_OS_MAC system = QLatin1String("mac"); #endif deleteItemAct = new QAction(tr("&Delete"), this); deleteItemAct->setShortcut(tr("Ctrl+D")); connect(deleteItemAct, SIGNAL(triggered()), this, SLOT( deleteSelected())); createSelfEdgeAct = new QAction(tr("&Create self-edge"), this); connect( createSelfEdgeAct, SIGNAL(triggered()), this, SLOT( createSESelected())); createEdgeLabelAct = new QAction(tr("&Create label"), this); connect( createEdgeLabelAct, SIGNAL(triggered()), this, SLOT( createEdgeLabel())); findContextAct = new QAction(tr("&Highlight context"), this); connect( findContextAct, SIGNAL(triggered()), this, SLOT( findContext())); showTextAct = new QAction(tr("&Show text"), this); connect( showTextAct, SIGNAL(triggered()), this, SLOT( showSelectedNodesText())); showPredAct = new QAction(tr("Pred"), this); connect( showPredAct, SIGNAL(triggered()), this, SLOT( showEdgePred())); showSuccAct = new QAction(tr("Succ"), this); connect( showSuccAct, SIGNAL(triggered()), this, SLOT( showEdgeSucc())); editableSwitchAct = new QAction( QIcon( QString::fromUtf8(":/images/%1/Edit/Edit.ico").arg( system)), tr("Editable"), this); editableSwitchAct->setCheckable( true); editableSwitchAct->setChecked( false); connect( editableSwitchAct, SIGNAL( toggled( bool)), this, SLOT( toggleEdition( bool))); insertNodeAct = new QAction(tr("Insert node"), this); showEditNodeStyleAct = new QAction(tr("Change style"), this); connect( showEditNodeStyleAct, SIGNAL( triggered()), this, SLOT(showEditNodeStyle())); showEditEdgeStyleAct = new QAction(tr("Change style"), this); connect( showEditEdgeStyleAct, SIGNAL( triggered()), this, SLOT(showEditEdgeStyle())); runLayoutAct = new QAction( QIcon( QString::fromUtf8(":/images/%1/Synchronize/Synchronize.ico").arg( system)), tr("&Run Layout"), this); connect( runLayoutAct, SIGNAL(triggered()), this, SLOT( runLayout())); } void GraphView::createMenus() { nodeItemMenu = new QMenu( tr( "&Node Item")); nodeItemMenu->addAction( deleteItemAct); nodeItemMenu->addAction( createSelfEdgeAct); edgeItemMenu = new QMenu( tr( "&Edge Item")); edgeItemMenu->addAction( deleteItemAct); } QMenu* GraphView::createMenuForNode( GNode *n) { QMenu* menu = new QMenu( tr( "&Node")); menu->addAction( deleteItemAct); deleteItemAct->setEnabled( isEditable()); if ( !n->isPseudo()) { menu->addAction( findContextAct); menu->addAction( showTextAct); menu->addSeparator(); menu->addAction( createSelfEdgeAct); createSelfEdgeAct->setEnabled( isEditable()); menu->addAction( showEditNodeStyleAct); showEditNodeStyleAct->setEnabled( isEditable()); } return menu; } QMenu* GraphView::createMenuForEdge( GEdge *e) { QMenu* menu = new QMenu( tr( "&Edge")); menu->addAction( showPredAct); menu->addAction( showSuccAct); menu->addSeparator(); menu->addAction( deleteItemAct); deleteItemAct->setEnabled( isEditable()); menu->addAction( createEdgeLabelAct); createEdgeLabelAct->setEnabled( isEditable()); menu->addAction( showEditEdgeStyleAct); showEditEdgeStyleAct->setEnabled( isEditable()); return menu; } void GraphView::dragEnterEvent(QDragEnterEvent *event) { /*if ( event->mimeData()->hasUrls()) event->acceptProposedAction();*/ } void GraphView::dropEvent(QDropEvent *event) { /*const QMimeData *mimeData = event->mimeData(); if ( mimeData->hasUrls()) { QList urlList = mimeData->urls(); QString text; for ( int i = 0; i < urlList.size(); ++i) { QString url = urlList.at(i).path(); } } event->acceptProposedAction();*/ } void GraphView::dragMoveEvent( QDragMoveEvent *event) { //event->acceptProposedAction(); } void GraphView::advanceNodes() { GNode *n; bool advanced = false; foreachNode( n, graph()) { if ( n->item()->advance()) advanced = true; } if ( !advanced) { killTimer( node_animation_timer); node_animation_timer = 0; } } void GraphView::advanceView() { GNode *target = graph()->nodeInFocus(); qreal STEP_LEN = 10 / scaleVal( zoom_scale); const qreal STEP_SCALE = 0.2; if ( isNotNullP( target)) { QRectF item_rect = target->item()->mapToScene( target->item()->boundingRect()).boundingRect(); QRectF view_rect = mapToScene( viewport()->rect()) .boundingRect(); QLineF line( view_rect.center(), item_rect.center()); qreal dist = line.length(); QPointF displacement( STEP_LEN * line.dx() / dist, STEP_LEN * line.dy() / dist); if ( dist > STEP_LEN /2) centerOn( view_rect.center() + displacement); QRectF new_view_rect = mapToScene( viewport()->rect()).boundingRect(); QLineF step( new_view_rect.center(), view_rect.center()); qreal len = step.length(); if ( zoom_out_done) { if ( dist < STEP_LEN || len < STEP_LEN /2) { zoom_scale+=STEP_SCALE; updateMatrix(); if ( abs( zoom_scale - preferred_zoom) <= STEP_SCALE * 2) { zoom_scale = preferred_zoom; updateMatrix(); killTimer( timer_id); timer_id = 0; centerOn( target->item()); } } } if ( ! zoom_out_done && ( abs( line.dx()) > view_rect.width() || abs( line.dy()) > view_rect.height())) { zoom_scale-=STEP_SCALE; QMatrix scale; scale.scale( scaleVal( zoom_scale), scaleVal( zoom_scale)); setMatrix( scale); } else { zoom_out_done = true; } } } void GraphView::timerEvent( QTimerEvent *event) { if ( !event->timerId()) return; if ( event->timerId() == timer_id) { advanceView(); } if ( event->timerId() == node_animation_timer) { advanceNodes(); } } void GraphView::clearSearch() { search_node = NULL; } void GraphView::focusOnNode( GNode *n, bool gen_event) { graph()->selectOneNode( n); if ( smooth_focus) { if (!timer_id) timer_id = startTimer(1000/25); preferred_zoom = zoom_scale; zoom_out_done = false; } else { centerOn( n->item()); } if ( gen_event && !n->isNodeInFocus()) view_history->focusEvent( n); graph()->setNodeInFocus( n); } GNode * GraphView::findNextNodeWithText( QString &findStr, QTextDocument::FindFlags flags) { GNode *n; if ( isNullP( search_node)) { foreachNode( n, graph()) { if ( isNullP( n->nextNode())) break; } } else { n = search_node->prevNode(); } while ( isNotNullP( n)) { QTextDocument *doc = n->doc(); if ( isNotNullP( doc) && !doc->find( findStr, 0, flags).isNull()) { search_node = n; break; } n = n->prevNode(); } if ( isNotNullP( n)) { if ( isContext()) { graph()->emptySelection(); graph()->selectNode( n); findContext(); } focusOnNode( n, true); return n; } else { search_node = NULL; return NULL; } } GNode * GraphView::findPrevNodeWithText( QString &findStr, QTextDocument::FindFlags flags) { GNode *n; flags ^= QTextDocument::FindBackward; // Unset backward search flag for ( n = isNullP( search_node) ? graph()->firstNode() : search_node->nextNode(); isNotNullP( n); n = n->nextNode()) { QTextDocument *doc = n->doc(); if ( isNotNullP( doc) && !doc->find( findStr, 0, flags).isNull()) { search_node = n; break; } } if ( isNotNullP( n)) { if ( isContext()) { graph()->emptySelection(); graph()->selectNode( n); findContext(); } focusOnNode( n, true); return n; } else { search_node = NULL; return NULL; } } /** * Find node by its ID from dump */ GNode* GraphView::findNodeById( int id) { GNode *n; foreachNode( n, graph()) { if ( !n->isEdgeControl() && !n->isEdgeLabel() && n->irId() == id) break; } if ( isNotNullP( n)) { if ( isContext()) { graph()->emptySelection(); graph()->selectNode( n); findContext(); } focusOnNode( n, true); return n; } else { return NULL; } } /** * Find node by its label */ GNode* GraphView::findNodeByLabel( QString label) { GNode *n; foreachNode( n, graph()) { if ( !n->isEdgeControl() && !n->isEdgeLabel()) { QString node_label = n->item()->toPlainText(); if ( node_label == label) break; } } if ( isNotNullP( n)) { if ( isContext()) { graph()->emptySelection(); graph()->selectNode( n); findContext(); } focusOnNode( n, true); return n; } else { return NULL; } } /** Repeat navigation event */ void GraphView::replayNavigationEvent( NavEvent *ev) { assert( isNotNullP( ev)); if ( ev->isFocus()) { assert( isNotNullP( ev->node())); if ( isContext()) { graph()->emptySelection(); graph()->selectNode( ev->node()); findContext(); } focusOnNode( ev->node(), false); } } void GraphView::toggleSmoothFocus( bool smooth) { smooth_focus = smooth; } void GraphView::toggleViewMode( bool context) { if ( context && CONTEXT_VIEW != view_mode) { view_mode = CONTEXT_VIEW; graph()->clearNodesPriority(); } else if ( !context && WHOLE_GRAPH_VIEW != view_mode) { view_mode = WHOLE_GRAPH_VIEW; graph()->showWholeGraph(); } } /** Navigate backward */ void GraphView::navPrev() { NavEvent * ev = view_history->prev(); if ( isNotNullP( ev)) replayNavigationEvent( ev); } /** Navigate forward */ void GraphView::navNext() { NavEvent * ev = view_history->next(); if ( isNotNullP( ev)) replayNavigationEvent( ev); } /** Erase node from history */ void GraphViewHistory::eraseNode( GNode *n) { it = events.begin(); while ( it != events.end()) { NavEvent *ev = *it; if ( ev->isFocus() && areEqP( ev->node(), n)) { it = events.erase( it); } else { it++; } } } /** Get last event */ NavEvent *GraphViewHistory::last() { if ( events.count() > 0) { it = events.end(); it--; return *it; } return NULL; } /** Get prev event */ NavEvent *GraphViewHistory::prev() { if ( it != events.begin()) { it--; return *it; } return NULL; } /** Get next event */ NavEvent *GraphViewHistory::next() { if ( it != events.end()) it++; if ( it != events.end()) { return *it; } return NULL; } /** New event */ void GraphViewHistory::viewEvent( NavEventType t, GNode *n) { NavEvent *ev = new NavEvent( t, n); if ( it != events.end()) it++; if ( it != events.end()) events.erase( it, events.end()); events.push_back( ev); it = events.end(); it--; } /** * Implementation of XML writing */ void GGraph::writeToXML( QString filename) { QFile file( filename); if (!file.open(QFile::WriteOnly | QFile::Text)) { assert( 0); return; } QList< QDomElement> elements; foreach ( GStyle *style, styles) { if ( style->numItems() != 1) { QDomElement e = createElement( "style"); elements.push_back( e); style->writeElement( e); //QDomNode e2 = graph()->documentElement().removeChild( e); //assert( !e2.isNull()); QDomNode n = documentElement().insertBefore( e, documentElement().firstChild()); ASSERTD( !n.isNull()); } } /** Update element for each node */ for ( GNode *n = firstNode(); isNotNullP( n); n = n->nextNode()) { n->updateElement(); } /** Update element for each edge */ for ( GEdge *e = firstEdge(); isNotNullP( e); e = e->nextEdge()) { e->updateElement(); } QTextStream out( &file); save(out, IndentSize); foreach ( QDomElement el, elements) { QDomNode n = documentElement().removeChild( el); ASSERTD( !n.isNull()); } } /** * Build graph from XML description */ void GGraph::readFromXML( QString txt) { if ( !setContent( txt)) { throw GGraphError( "Not a good-formated xml file"); } /** * Read nodes and create them */ QDomElement docElem = documentElement(); QHash< GraphUid, GNode *> n_hash; for ( QDomNode n = docElem.firstChild(); !n.isNull(); ) { QDomElement e = n.toElement(); // try to convert the DOM tree node to an element. QString error_msg = QString("in line %1: ").arg( n.lineNumber()); //Not an element, proceed to next node if ( e.isNull()) continue; /** Parse element and its attributes */ //Node if ( e.tagName() == QString( "node")) { GNode *node = newNode( e); node->readFromElement( e); n_hash[ e.attribute( "id").toLongLong()] = node; if ( e.hasAttribute("style")) { if ( styles.find( e.attribute("style")) == styles.end()) throw GGraphError( error_msg.append("unknown style")); node->setStyle( styles[ e.attribute("style")]); } else { // Try to parse style-definining fields GStyle *style = new GStyle( e); // possible exception GGraphError if ( style->isDefault()) { delete style; } else { QString name("node %1 style"); name.arg( node->id()); style->setName( name); styles[ name] = style; node->setStyle( style); } } } if ( e.tagName() == QString( "style")) { GStyle *style = new GStyle( e); // possible exception GGraphError styles[ e.attribute( "name")] = style; n = n.nextSibling(); documentElement().removeChild( e); continue; } n = n.nextSibling(); } for ( QDomNode n = docElem.firstChild(); !n.isNull(); n = n.nextSibling()) { QDomElement e = n.toElement(); // try to convert the DOM tree node to an element. QString error_msg = QString("in line %1: ").arg( n.lineNumber()); /** Cannot convert node to element or this element is not a edge description */ if ( e.isNull() || !( e.tagName() == QString( "edge"))) continue; if ( !e.hasAttribute("source")) throw GGraphError( error_msg.append("malformed edge description: no source")); if ( !e.hasAttribute("target")) throw GGraphError( error_msg.append("malformed edge description: no target")); bool ok = false; GraphUid pred_id = e.attribute( "source").toLongLong( &ok); if ( !ok) throw GGraphError( error_msg.append("malformed edge description: wrong source id")); GraphUid succ_id = e.attribute( "target").toLongLong( &ok); if ( !ok) throw GGraphError( error_msg.append("malformed edge description: wrong target id")); if ( n_hash.find( pred_id) == n_hash.end()) throw GGraphError( error_msg .append("malformed edge description: predecessor node missing in graph")); if ( n_hash.find( succ_id) == n_hash.end()) throw GGraphError( error_msg .append("malformed edge description: successor node missing in graph")); GNode *pred = n_hash[ pred_id]; GNode *succ = n_hash[ succ_id]; GEdge *edge = newEdge( pred, succ, e); edge->readFromElement( e); if ( e.hasAttribute("style")) { if ( styles.find( e.attribute("style")) == styles.end()) throw GGraphError( error_msg.append("unknown style")); edge->setStyle( styles[ e.attribute("style")]); } else { // Try to parse style-definining fields GStyle *style = new GStyle( e); // possible exception GGraphError if ( style->isDefault()) { delete style; } else { QString name("edge %1 style"); name.arg( edge->id()); style->setName( name); styles[ name] = style; edge->setStyle( style); } } } } /** * Change node's style */ void GraphView::setNodeStyle( GStyle *style) { graph()->setNodeStyle( style); } /** * Change edge's style */ void GraphView::setEdgeStyle( GStyle *style) { graph()->setEdgeStyle( style); } codequery-0.18.1/showgraph/GraphView/graph_view.h000066400000000000000000000465171300045745200220200ustar00rootroot00000000000000/** * @file: graph_view.h * Graph View class definition. * @defgroup GUIGraph Graph Visualization System * @ingroup GUI */ /* GUI for ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ /** * @page iface Graph editor interface * Graph editor. * * Here's list of conventional editing tasks and how they are performed with Showgraph * -# Create new node - double click on free space * -# Create edge - draw edge holding down right mouse button * -# Delete node/edge - use delete option from context menu * -# Enter text in node - double click on node to enable its text editor * -# Move node - press left mouse button on it and drag * -# Create edge control point - double click on edge * -# Zoom view - press '-' and '+' or use mouse wheel * -# Invoke auto layout - select 'Run Layout' from View menu or simply press F5 */ #ifndef GRAPH_VIEW_H #define GRAPH_VIEW_H #include "gview_impl.h" /** * Navigation event types * @ingroup GUIGraph */ enum NavEventType { /** Focus on node event */ NAV_EVENT_NODE_FOCUS, /** Number of event types */ NAV_EVENT_TYPES_NUM }; /** * Navigation event * @ingroup GUIGraph */ class NavEvent { /** data associated with event */ union NavEventData { /** Node */ GNode *node; }; NavEventType type; NavEventData data; public: /** Constructor from type only */ inline NavEvent( NavEventType t): type( t) { data.node = NULL; } /** Constructor from type and node */ inline NavEvent( NavEventType t, GNode *n): type( t) { data.node = n; } /** Get associated node */ inline GNode *node() const { return data.node; } /** Set node */ inline void setNode( GNode *n) { data.node = n; } /** Check if event is a focus on node */ bool isFocus() const { return type == NAV_EVENT_NODE_FOCUS; } }; /** * History of graph view navigation * @ingroup GUIGraph */ class GraphViewHistory { QList< NavEvent *> events; // List of events QList< NavEvent *>::Iterator it; // Iterator to hold current position in list public: /** Constructor */ GraphViewHistory(): events() { it = events.end(); }; /** Destructor */ ~GraphViewHistory() { foreach ( NavEvent *ev, events) { delete ev; } } /** Get last event */ NavEvent *last(); /** Get prev event */ NavEvent *prev(); /** Get next event */ NavEvent *next(); /** New event */ void viewEvent( NavEventType t, GNode *n = NULL); /** New focus event */ inline void focusEvent( GNode *n) { assert( isNotNullP( n)); viewEvent( NAV_EVENT_NODE_FOCUS, n); } /** Erase node from history */ void eraseNode( GNode *n); }; /** * Graph for graphics. Graph model layer of GraphView. * @ingroup GUIGraph */ class GGraph: public AuxGraph { GraphView *view_p; protected: Marker nodeTextIsShown; QList< GNode* > sel_nodes; QList< GEdge* > sel_edges; QHash< QString, GStyle *> styles; NodeNav node_in_focus;// Node in focus + navigation sector /** Node creation reimplementaiton */ virtual Node * createNode( int _id) { GNode* node_p = new ( node_pool) GNode( this, _id); return node_p; } /** Edge creation reimplementation */ virtual Edge * createEdge( int _id, Node *_pred, Node* _succ) { return new ( edge_pool) GEdge( this, _id, static_cast( _pred), static_cast( _succ)); } public: /** Constructor */ inline GGraph( GraphView *v, bool create_pools): AuxGraph( false), view_p( v), node_in_focus( NULL, UNDEF_SECTOR) { nodeTextIsShown = newMarker(); /** Pools' creation routine */ if ( create_pools) { node_pool = new FixedPool< GNode>(); edge_pool = new FixedPool< GEdge>(); } } /** Destructor */ virtual ~GGraph(); /** New graphical node */ virtual GNode* newNode(); /** New graphical node */ virtual GNode* newNode( QDomElement e); /** New graphical edge */ virtual GEdge* newEdge( GNode* pred, GNode* succ); /** New graphical edge */ virtual GEdge* newEdge( GNode* pred, GNode* succ, QDomElement e); /** Reimplementation of newEdge virtual function of base class */ AuxEdge* newEdge( AuxNode * pred, AuxNode *succ) { return ( AuxEdge*)newEdge( static_cast< GNode *>( pred), static_cast< GNode *> (succ)); } /** Reimplementation of newEdge virtual function of base class */ AuxEdge* newEdge( AuxNode * pred, AuxNode *succ, QDomElement e) { return ( AuxEdge*)newEdge( static_cast< GNode *>( pred), static_cast< GNode *> (succ), e); } /** Get graph's first edge */ inline GEdge* firstEdge() { return static_cast< GEdge *>( AuxGraph::firstEdge()); } /** Get graph's first node */ inline GNode* firstNode() { return static_cast< GNode *>( AuxGraph::firstNode()); } /** * Run layout procedure */ void doLayout(); /** * Run layout procedure in single thread mode */ void doLayoutSingle(); /** * Assign placement coordinates to node items */ void UpdatePlacement(); /** * Reimplementation of layout's post processing step */ void layoutPostProcess(); /** Get corresponding graph view widget */ inline GraphView *view() const { return view_p; } void showNodesText(); /** * Add node to selection */ inline void selectNode( GNode *n) { sel_nodes << n; } /** Get node in focus */ inline GNode* nodeInFocus() const { return node_in_focus.node(); } /** Get current navigation sector */ inline NavSector nodeNavigationSector() const { return node_in_focus.sector(); } /** Set node in focus */ inline void setNodeInFocus( GNode *n, NavSector sector = UNDEF_SECTOR) { node_in_focus = NodeNav( n, sector); } void selectOneNode(GNode *n); /** * Clear list of selected nodes */ inline void emptySelection() { foreach (GNode *n, sel_nodes) { n->item()->toRegular(); n->item()->update(); } sel_nodes.clear(); sel_edges.clear(); } /** * Add node to selection */ inline void selectEdge( GEdge *e) { sel_edges << e; } /** * Delete scheduled nodes */ void deleteNodes(); /** Delete edge with all of the edge controls on it */ void deleteEdgeWithControls( GEdge *e); /** * Delete scheduled edges */ void deleteEdges(); /** * Create self edge on selected node */ void createSelfEdge(); /** * Create label on selected edge */ void createEdgeLabel( QPointF pos); /** * Create label on selected edge */ void findContext(); /** * Make all nodes of graph visible and eligible for placement */ void showWholeGraph(); /** * Zero nodes' priorities */ void clearNodesPriority(); /** * Show predecessor of selected edge */ void showEdgePred(); /** * Show successor of selected edge */ void showEdgeSucc(); /** * Save graph as an XML file */ virtual void writeToXML( QString filename); /** * Build graph from XML description */ virtual void readFromXML( QString filename); /** * Show style editor for selected nodes */ void showEditNodeStyle(); /** * Change node's style */ void setNodeStyle( GStyle *style); /** * Show style editor for selected edges */ void showEditEdgeStyle(); /** * Change edge's style */ void setEdgeStyle( GStyle *style); /** * Add a style */ void addStyle( QString &name, GStyle *style) { styles[ name] = style; } }; /** * View mode types */ enum GraphViewMode { /** Whole graph view mode */ WHOLE_GRAPH_VIEW, /** Context view mode */ CONTEXT_VIEW, /** Number of view modes for graph */ GRAPH_VIEW_MODES_NUM }; /** * Graph visualization class */ class GraphView: public QGraphicsView { Q_OBJECT; /** For MOC */ private: /** Pointer to model graph */ GGraph * graph_p; /** History of view events */ GraphViewHistory *view_history; /** View mode */ GraphViewMode view_mode; /** Item for showing future edge during the edge creation process */ EdgeHelper *helper; /** Edition enabled/disabled */ bool editable; /** Deleted items lists */ QList< NodeItem* > del_node_items; QList< EdgeItem* > del_edge_items; /** Actions */ QAction *editableSwitchAct; QAction *insertNodeAct; QAction *runLayoutAct; QAction *deleteItemAct; QAction *createSelfEdgeAct; QAction *createEdgeLabelAct; QAction *showPredAct; QAction *showSuccAct; QAction *findContextAct; QAction *showEditNodeStyleAct; QAction *showEditEdgeStyleAct; QAction *showTextAct; /** Context menus */ QMenu *nodeItemMenu; QMenu *edgeItemMenu; /** Temporary data */ int timer_id; int node_animation_timer; QPointF curr_pos; bool createEdge; bool show_menus; bool smooth_focus; bool smooth_layout_adjustment; bool zoom_out_done; GNode *tmpSrc; GNode *search_node; qreal zoom_scale; qreal preferred_zoom; protected: void createActions(); void createMenus(); signals: /** Signal that node is clicked */ void nodeClicked( GNode *n); public: /** * @brief Stores temporary info used for saving old style and node/edge being edited. * When showing style edit dialog we need to remember old state and the object * that is being edited. The StyleEditInfo structure is used for these purposes. */ struct StyleEditInfo { GEdge* edge; GNode* node; GStyle *old_style; GStyle *new_style; StyleEdit* dialog; StyleEditInfo( GEdge* e, GStyle *olds, GStyle *news, StyleEdit* d): edge( e), node(NULL), old_style(olds), new_style( news), dialog( d) {} StyleEditInfo( GNode* n, GStyle *olds, GStyle *news, StyleEdit* d): edge( NULL), node(n), old_style(olds), new_style( news), dialog( d) {} }; protected: /** Temporary info for style edition */ StyleEditInfo *style_edit_info; public slots: /** Navigate backward */ void navPrev(); /** Navigate forward */ void navNext(); /** Clear search node */ void clearSearch(); /** Delete one item */ void deleteSelected(); /** create self edge on selected node */ void createSESelected(); /** Create edge label */ void createEdgeLabel(); /** Show edge predecessor */ void showEdgePred(); /** Show edge successor */ void showEdgeSucc(); /** Find node's context */ void findContext(); /** Toggle smooth focusing mode ( moving viewport to show user how to get from one node to anoter) */ void toggleSmoothFocus( bool smooth); /** Toggle view mode */ void toggleViewMode( bool context); /** Show text of the clicked node */ void showSelectedNodesText(); /** Enable/disable edition */ void toggleEdition( bool e); /** Insert node in center of view */ void insertNodeOnCenter(); /** Show style editor for node */ void showEditNodeStyle(); /** Show style editor for edge */ void showEditEdgeStyle(); /** Run layout */ void runLayout(); /** Change node's style */ void setNodeStyle( GStyle *style); /** Change edge's style */ void setEdgeStyle( GStyle *style); /** Style edit finished */ void styleEditFinished( int result); public: QProgressDialog *dialog; /** Constants */ #ifdef _DEBUG static const int MAX_DELETED_ITEMS_COUNT = 100; #else static const int MAX_DELETED_ITEMS_COUNT = 10000; #endif /** Constructor */ GraphView(); /** Destructor */ virtual ~GraphView(); /** Get action for toggling edit mode */ inline QAction* toggleEditableAction() const { return editableSwitchAct; } /** Return true if graph enabled for edition */ inline bool isEditable() const { return editable; } /** Return true if graph enabled for edition */ inline void setEditable( bool val = true) { editable = val; } /** Return true if smooth focus is enabled */ inline bool hasSmoothFocus() const { return smooth_focus; } /** Return true if view operates in context mode */ inline bool isContext() const { return view_mode == CONTEXT_VIEW; } /** Return saved position */ inline QPointF currPos() const { return curr_pos; } /** Set current event position */ inline void setCurrPos( QPointF p) { curr_pos = p; } /** Get view history */ inline GraphViewHistory * viewHistory() const { return view_history; } /** Get current search point */ inline GNode * searchNode() const { return search_node; } /** Show text of the clicked node */ inline void showNodeText( GNode * n) { emit nodeClicked( n); } /** Set model graph */ inline void setGraph( GGraph *g) { graph_p = g; } /** Get pointer to model graph */ inline GGraph *graph() const { return graph_p; } /** Get context menu for nodes */ inline QMenu *nodeMenu() const { return nodeItemMenu; } /** Get context menu for edges */ inline QMenu *edgeMenu() const { return edgeItemMenu; } /** Create menu for particular node */ virtual QMenu* createMenuForNode( GNode *n); /** Create menu for particular edge */ virtual QMenu* createMenuForEdge( GEdge *e); void dragEnterEvent( QDragEnterEvent *event); void dropEvent( QDropEvent *event); void dragMoveEvent( QDragMoveEvent *event); /** draw background reimplementation */ void drawBackground( QPainter *painter, const QRectF &rect); /** Mouse double click event handler reimplementation */ void mouseDoubleClickEvent( QMouseEvent *event); /** Mouse press event handler reimplementation */ void mousePressEvent( QMouseEvent *event); /** Mouse move event handler reimplementation */ void mouseMoveEvent( QMouseEvent *event); /** Mouse release event handler reimplementation */ void mouseReleaseEvent( QMouseEvent *event); /** Context menu event handler */ void contextMenuEvent( QContextMenuEvent * e ); /** Keypress event handler reimplementation */ void keyPressEvent( QKeyEvent *event); /** Mouse wheel event handler reimplementation */ void wheelEvent( QWheelEvent *event); /** Zoom the view in */ void zoomIn(); /** Zoom the view out */ void zoomOut(); /** Restore original zoom */ void zoomOrig(); /** Do the transofrmation( scale) */ void updateMatrix(); /** Focus on node */ void focusOnNode( GNode *n, bool gen_event); /** Start animation for nodes */ void startAnimationNodes(); /** Advance view in animated focusing procedure */ void advanceView(); /** Advance nodes in animation sequence */ void advanceNodes(); /** Replay navigation event */ void replayNavigationEvent( NavEvent *event); /** Check if we are in the process of the edge creation */ inline bool isCreateEdge() const { return createEdge; } /** Check if we are in the process of the edge creation */ inline bool isShowContextMenus() const { return show_menus; } /** Set the state of ege creation */ inline void SetCreateEdge( bool val) { createEdge = val; } /** Save the pointer to source node for new edge */ inline void SetTmpSrc( GNode* node) { tmpSrc = node; helper->setSrc( node->item()); helper->setDst( NULL); helper->adjust(); } /** Show edge helper item */ inline void showHelper() { helper->adjust(); helper->show(); } /** Get the pointer to source node of new edge */ inline GNode* GetTmpSrc() { return tmpSrc; } /** * Schedule node item for deletion */ void deleteLaterNodeItem( NodeItem *item) { del_node_items << item; checkDelItems(); } /** * Schedule edge item for deletion */ void deleteLaterEdgeItem( EdgeItem *item) { del_edge_items << item; checkDelItems(); } /** Timer event handler */ void timerEvent(QTimerEvent *event); /** * Delete items that have been disconnected from scene */ void deleteItems(); /** * Find node by its ID from dump */ GNode* findNodeById( int id); /** * Find node by its label */ GNode* findNodeByLabel( QString label); /** * Find next node with matching text */ GNode *findNextNodeWithText( QString &findStr, QTextDocument::FindFlags flags); /** * Find prev node with matching text */ GNode *findPrevNodeWithText( QString &findStr, QTextDocument::FindFlags flags); /** * Check that we haven't exceeded the max amount of deleted items */ inline void checkDelItems() { int item_count = del_node_items.count() + del_edge_items.count(); if ( item_count >= MAX_DELETED_ITEMS_COUNT) { /** deleteItems(); !!! FIXME: MEMORY LEACKAGE( yes, not potential... known leakage) */ } } /** Set the pointer to style edition temporary info */ inline void setStyleEditInfo( StyleEditInfo* info) { style_edit_info = info; } }; #endifcodequery-0.18.1/showgraph/GraphView/gstyle.h000066400000000000000000000271101300045745200211600ustar00rootroot00000000000000/** * @file: gstyle.h * Node/Edge styles in graph */ /* * GUI for ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #ifndef GSTYLE_H #define GSTYLE_H /** Style id type */ typedef quint32 StyleId; /** * Node shape enum */ enum NodeShape { NODE_SHAPE_BOX, NODE_SHAPE_DEFAULT = NODE_SHAPE_BOX, NODE_SHAPE_ROUNDED_BOX, NODE_SHAPE_CIRCLE, NODE_SHAPE_DIAMOND, NODE_SHAPE_ELLIPSE, NODE_SHAPES_NUM }; /** * Convert node shape to string */ static QString nodeShape2Str( NodeShape shape) { ASSERTD( shape < NODE_SHAPES_NUM); switch ( shape) { case NODE_SHAPE_BOX: return QString("box"); case NODE_SHAPE_ROUNDED_BOX: return QString("rounded_box"); case NODE_SHAPE_CIRCLE: return QString("circle"); case NODE_SHAPE_DIAMOND: return QString("diamond"); case NODE_SHAPE_ELLIPSE: return QString("ellipse"); default: ASSERTD( 0); return QString(); } return QString(); } /** * Convert string to node shape */ static NodeShape str2NodeShape( const QString &str) { if ( str == "box") { return NODE_SHAPE_BOX; } else if ( str == "rounded_box") { return NODE_SHAPE_ROUNDED_BOX; } else if ( str == "circle") { return NODE_SHAPE_CIRCLE; } else if ( str =="diamond") { return NODE_SHAPE_DIAMOND; } else if ( str == "ellipse") { return NODE_SHAPE_ELLIPSE; } else { return NODE_SHAPES_NUM; } } /** * Graphic style for nodes and edges */ class GStyle { public: /** Constructor */ inline GStyle(); /** Copy constructor */ inline GStyle( const GStyle&); /** Copy constructor with name specification */ inline GStyle( QString nm, const GStyle&); /** * Construction from XML description * @param Element wih style description * @throws GGraphError */ inline GStyle( QDomElement e); /** Assignment */ inline GStyle& operator = ( const GStyle&); /** Destructor */ virtual ~GStyle(){}; /** Get name of style */ inline QString name() const; /** Get pen */ inline QPen pen() const; /** Get brush */ inline QBrush brush() const; /** Set default/changed state*/ inline void setState( bool default_state = false); /** Set name of style */ inline void setName( QString &str); /** Set pen */ inline void setPen( QPen &pn); /** Set brush */ inline void setBrush( QBrush &br); /** Set pen color */ inline void setPenColor( QColor &color); /** Set pen style */ inline void setPenStyle( Qt::PenStyle st); /** Set pen width */ inline void setPenWidth( qreal width); /** Set brush color */ inline void setBrushColor( QColor &color); /** Check if style uses default pen */ inline bool isDefault() const; /** Get node shape */ inline NodeShape shape() const; /** Set node shape */ inline void setShape( NodeShape new_shape); /** Saving to element */ inline void writeElement( QDomElement e, bool save_name = true); /** Increase items num */ inline void incNumItems(); /** Decrease items num */ inline void decNumItems(); /** Get number of affected items */ inline GraphNum numItems(); private: QString name_priv; QPen pen_priv; QBrush brush_priv; bool is_default; GraphNum num_items; NodeShape shape_priv; //StyleId id; }; /** Constructor */ inline GStyle::GStyle(): is_default( true), num_items( 0), shape_priv(NODE_SHAPE_DEFAULT) {} /** Copy constructor */ inline GStyle::GStyle( const GStyle& st) { name_priv = st.name_priv; name_priv.append("_copy"); pen_priv = st.pen_priv; brush_priv = st.brush_priv; is_default = st.is_default; shape_priv = st.shape_priv; num_items = 0; } /** Copy constructor with name specification */ inline GStyle::GStyle( QString nm, const GStyle& st) { num_items = 0; name_priv = nm; pen_priv = st.pen_priv; brush_priv = st.brush_priv; is_default = st.is_default; shape_priv = st.shape_priv; } /** Construction from XML description */ inline GStyle::GStyle( QDomElement e ): is_default( true), shape_priv(NODE_SHAPE_DEFAULT) { num_items = 0; ASSERTD( !e.isNull()); QString error_msg = QString("in line %1: ").arg( e.lineNumber()); /** A style must be named in XML */ if( e.tagName() == QString( "style") && !e.hasAttribute( "name")) { throw GGraphError( error_msg.append("style without a name")); } else { name_priv = e.attribute( "name"); } /** Parse pen color */ if ( e.hasAttribute( "pen_color")) { is_default = false; QColor color( e.attribute( "pen_color")); if ( color.isValid()) { pen_priv.setColor( color); } else { throw GGraphError( error_msg.append("invalid pen color")); } } /** Parse pen style */ if ( e.hasAttribute( "pen_style")) { is_default = false; QString stl = e.attribute( "pen_style"); if ( stl == "no_pen") { pen_priv.setStyle( Qt::NoPen); } else if ( stl == "solid") { pen_priv.setStyle( Qt::SolidLine); } else if ( stl == "dash") { pen_priv.setStyle( Qt::DashLine); } else if ( stl == "dot") { pen_priv.setStyle( Qt::DotLine); } else if ( stl == "dash_dot") { pen_priv.setStyle( Qt::DashDotLine); } else { throw GGraphError( error_msg.append("invalid pen style")); } } /** Parse pen width */ if ( e.hasAttribute( "pen_width")) { is_default = false; bool ok; qreal width = e.attribute( "pen_width").toDouble( &ok); if ( ok) { pen_priv.setWidthF( width); } else { throw GGraphError( error_msg.append("invalid pen width")); } } else { pen_priv.setWidth( 1); } /** Parse fill color */ if ( e.hasAttribute( "fill")) { is_default = false; QString fill = e.attribute( "fill"); QColor color( fill); if ( fill == "no_fill") { brush_priv.setStyle( Qt::NoBrush); } else if ( color.isValid()) { brush_priv.setStyle( Qt::SolidPattern); brush_priv.setColor( color); } else { throw GGraphError( error_msg.append("invalid fill color")); } } else { brush_priv.setStyle( Qt::NoBrush); } if ( e.hasAttribute("shape")) { NodeShape shp = str2NodeShape( e.attribute("shape")); if ( shp != NODE_SHAPES_NUM) { is_default = false; setShape( shp); } else { throw GGraphError( error_msg.append("invalid shape")); } } } /** Saving to element */ inline void GStyle::writeElement( QDomElement e, bool save_name) { if ( is_default) return; if ( save_name) e.setAttribute( "name", name_priv); /** Save pen color */ e.setAttribute( "pen_color", pen_priv.color().name()); /** Save pen style */ Qt::PenStyle pen_style = pen_priv.style(); switch ( pen_style) { case Qt::NoPen: e.setAttribute( "pen_style","no_pen"); break; case Qt::SolidLine: e.setAttribute( "pen_style","solid"); break; case Qt::DashLine: e.setAttribute( "pen_style","dash"); break; case Qt::DotLine: e.setAttribute( "pen_style","dot"); break; case Qt::DashDotLine: e.setAttribute( "pen_style","dash_dot"); break; default: ASSERTD( 0); e.setAttribute( "pen_style","solid"); break; } /** Save pen width */ e.setAttribute( "pen_width", pen_priv.widthF()); /** Save fill color */ if ( !( Qt::NoBrush == brush_priv.style())) { e.setAttribute( "fill", brush_priv.color().name()); } if ( NODE_SHAPE_DEFAULT != shape()) { e.setAttribute("shape", nodeShape2Str( shape())); } } /** Assignment */ inline GStyle& GStyle::operator = ( const GStyle& st) { name_priv = st.name_priv; name_priv.append("_copy"); pen_priv = st.pen_priv; is_default = st.is_default; brush_priv = st.brush_priv; shape_priv = st.shape_priv; num_items = 0; return *this; } /** Get name of style */ inline QString GStyle::name() const { return name_priv; } /** Get pen */ inline QPen GStyle::pen() const { return pen_priv; } /** Get brush */ inline QBrush GStyle::brush() const { return brush_priv; } /** Check if style uses default pen */ inline bool GStyle::isDefault() const { return is_default; } /** Increase items num */ inline void GStyle::incNumItems() { num_items++; } /** Decrease items num */ inline void GStyle::decNumItems() { ASSERTD( num_items > 0); num_items--; } /** Get number of affected items */ inline GraphNum GStyle::numItems() { return num_items; } /** Set name of style */ inline void GStyle::setName( QString &str) { name_priv = str; } /** Set pen */ inline void GStyle::setPen( QPen &pn) { pen_priv = pn; } /** Set brush */ inline void GStyle::setBrush( QBrush &br) { brush_priv = br; } /** Set pen color */ inline void GStyle::setPenColor( QColor &color) { pen_priv.setColor( color); } /** Set pen style */ inline void GStyle::setPenStyle( Qt::PenStyle st) { pen_priv.setStyle( st); } /** Set pen width */ inline void GStyle::setPenWidth( qreal width) { pen_priv.setWidthF( width); } /** Set brush color */ inline void GStyle::setBrushColor( QColor &color) { brush_priv.setColor( color); } /** Set default/changed state*/ inline void GStyle::setState( bool default_state) { is_default = default_state; } /** Get node shape */ inline NodeShape GStyle::shape() const { return shape_priv; } /** Set node shape */ inline void GStyle::setShape( NodeShape new_shape) { shape_priv = new_shape; } #endif /* GSTYLE_H */codequery-0.18.1/showgraph/GraphView/gview_iface.h000066400000000000000000000065151300045745200221270ustar00rootroot00000000000000/** * @file: gview_iface.h * Graph view classes interface * @defgroup GUI Graphical User Interface * @author Boris Shurygin * * Graphical part of ShowGraph is arranged around MainWindow wich has * GraphView as a center widget. */ /** * Graph view implementation. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #pragma once #ifndef GVIEW_IFACE_H #define GVIEW_IFACE_H /** * Debug assert for graph library */ #if !defined(GVIEW_ASSERTD) # define GVIEW_ASSERTD(cond, what) ASSERT_XD(cond, "GUI", what) #endif /** Predeclarations */ class GGraph; class GNode; class GEdge; class NodeItem; class EdgeItem; class GraphView; class StyleEdit; #ifdef USE_QT5 #include #else #include #endif #include #include #include #include #include #include #include "../Graph/graph_iface.h" #include "../Layout/layout_iface.h" /** * Subclasses of QGraphicsItem types */ enum { TypeNode = QGraphicsItem::UserType + 1, /** Node item */ TypeEdge = QGraphicsItem::UserType + 2, /** Edge item */ TypeEdgeControl = QGraphicsItem::UserType + 3,/** EdgeControl item */ TypeEdgeHelper = QGraphicsItem::UserType + 4 /** Edge helper item */ }; /** Max opacity level for items in graph view */ const qreal MAX_OPACITY = 6; /** * Exception type for graph errors * @ingroup GUIGraph */ class GGraphError { public: /** No message constructor */ GGraphError(){}; /** Message-based constructor*/ GGraphError( QString str): msg_priv( str){}; /** Get message */ inline QString message() { return msg_priv; } private: /** Error message */ QString msg_priv; }; #include "navigation.h" #include "visible_edge.h" #include "gstyle.h" #include "edge_item.h" #include "node_item.h" #include "edge_helper.h" #include "graph_view.h" #include "style_edit.h" #endif /* GVIEW_IFACE_H */ codequery-0.18.1/showgraph/GraphView/gview_impl.h000066400000000000000000000044751300045745200220240ustar00rootroot00000000000000/** * @file: gview_impl.h * Implementational header for QtGUI sub-project */ /* * GUI for ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #ifndef GVIEW_IMPL_H #define GVIEW_IMPL_H #include "gview_iface.h" #include /** Pi definition */ static const double Pi = 3.14159265358979323846264338327950288419717; /** 2 * Pi constant */ static double TwoPi = 2.0 * Pi; /** Arrow size constant */ const qreal arrowSize = 10; /** Self edge vertical margin*/ const qreal SE_VERT_MARGIN = 20; /** Self edge horizontal margin*/ const qreal SE_HOR_MARGIN = 20; /** Node speed */ const qreal NODE_SPEED = 4; /** Opacity step */ const qreal OPACITY_STEP = 0.1; /** Context visible border */ const int MAX_VISIBLE_LEN = 3; /** Context visible border */ const int GVIEW_MAX_PRIORITY = 6; /** Context far border */ const int MAX_PLACE_LEN = 3; #endif /* GVIEW_IMPL_H */ codequery-0.18.1/showgraph/GraphView/navigation.cpp000066400000000000000000000207651300045745200223540ustar00rootroot00000000000000/** * @file: navigation.cpp * Implemetation of navigation helper classes * @ingroup GUIGraph */ /* * GUI for ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #include "gview_impl.h" /** Constructor */ NodeNav::NodeNav( GNode *curr_node, NavSector nav_sector): node_priv( curr_node), sector_priv( nav_sector) { } /** Get edge to the bottom of current node */ GEdge * NodeNav::firstEdgeInSector() const { GEdge *res = NULL; qreal min_delta = 0; /** For each edge */ for ( Node::EdgeIter e_iter = node()->edgesBegin(), e_end = node()->edgesEnd(); e_iter != e_end; e_iter++ ) { GEdge *e = static_cast( e_iter.edge()); if ( isEdgeInSector( e)) { NodeItem *p_item = static_cast( e_iter.node())->item(); QPointF center = node()->item()->boundingRect().center(); QPointF point = node()->item()->mapFromItem( p_item, p_item->boundingRect().center()); qreal delta; if ( sector() == TOP_SECTOR || sector() == BOTTOM_SECTOR) { delta = abs( center.x() - point.x()); } else { delta = abs( center.y() - point.y()); } if ( isNullP( res) || delta < min_delta) // for selection of closest edge { res = e; min_delta = delta; } } } return res; } /** Checks if navigation direction is applicable in current sector */ bool NodeNav::isDirApplicable( NavDirection dir, NavSector s) { /* Applicable only for top and bottom sectors */ if ( s == UNDEF_SECTOR) return false; if ( s == LEFT_SECTOR || s == RIGHT_SECTOR) { return dir == NAV_DIR_UP || dir == NAV_DIR_DOWN; } else if ( s == TOP_SECTOR || s == BOTTOM_SECTOR) { return dir == NAV_DIR_LEFT || dir == NAV_DIR_RIGHT; } GVIEW_ASSERTD( 0, "Invalid sector type"); return false; } /** * Check that given point is in given direction from reference point */ bool NodeNav::isPointInDir( QPointF point, QPointF ref, NavDirection dir) { switch ( dir) { case NAV_DIR_UP: return point.y() <= ref.y(); case NAV_DIR_DOWN: return point.y() >= ref.y(); case NAV_DIR_LEFT: return point.x() <= ref.x(); case NAV_DIR_RIGHT: return point.x() >= ref.x(); default: return false; } return false; } /** * Compute coordinate difference in given direction * between given point and reference point */ qreal NodeNav::deltaInDir( QPointF point, QPointF ref, NavDirection dir) { switch ( dir) { case NAV_DIR_UP: return ref.y() - point.y(); case NAV_DIR_DOWN: return point.y() - ref.y(); case NAV_DIR_LEFT: return ref.x() - point.x(); case NAV_DIR_RIGHT: return point.x() - ref.x(); default: return 0; } return 0; } /** Get edge to the left of given edge */ GEdge * NodeNav::edgeInDir( GEdge * edge, NavDirection dir) const { /* Applicable only for top and bottom sectors */ if ( !isDirApplicable( dir, sector())) { return NULL; } GNode *n = otherEnd( edge); /* item corresponding to other (than node_priv) node */ if ( isNullP( n)) return NULL; NodeItem *item = n->item(); // in current node's coordinates QPointF edge_point = node()->item()->mapFromItem( item, item->boundingRect().center()); GEdge *res = NULL; qreal min_delta = 0; /** For each edge */ for ( Node::EdgeIter e_iter = node()->edgesBegin(), e_end = node()->edgesEnd(); e_iter != e_end; e_iter++ ) { GEdge *e = static_cast( e_iter.edge()); if ( isEdgeInSector( e) && areNotEqP( e, edge)) { NodeItem *p_item = static_cast( e_iter.node())->item(); QPointF point = node()->item()->mapFromItem( p_item, p_item->boundingRect().center()); if ( isPointInDir( point, edge_point, dir)) { qreal delta = deltaInDir( point, edge_point, dir); if ( isNullP( res) || delta < min_delta) // for selection of closest edge { res = e; min_delta = delta; } } } } return res; } /* Other edge's node */ GNode * NodeNav::otherEnd( GEdge *edge) const { if ( areEqP( node_priv, edge->pred())) { return edge->succ(); } else if ( areEqP( node_priv, edge->succ())) { return edge->pred(); } return NULL; } /** Check that given edge is in current sector */ bool NodeNav::isEdgeInSector( GEdge * edge) const { GNode *n = otherEnd( edge); /* item corresponding to other (than node_priv) node */ if ( isNullP( n) || sector() == UNDEF_SECTOR) return false; NodeItem *item = n->item(); // Both points in current node's coordinates QPointF p_center = node_priv->item()->boundingRect().center(); QPointF s_center = node_priv->item()->mapFromItem( item, item->boundingRect().center()); qreal angle = QLineF( p_center, s_center).angle(); qreal max_angle = sectorMaxAngle(); qreal min_angle = sectorMinAngle(); if ( angle > 270 && sector() == RIGHT_SECTOR) { max_angle +=360; } if ( angle < 90 && sector() == RIGHT_SECTOR) { min_angle -=360; } if ( angle <= max_angle && angle >= min_angle) return true; return false; } /** Compute max angle for sector */ qreal NodeNav::sectorMaxAngle() const { QLineF line; QRectF rect = node_priv->item()->boundingRect(); QPointF center = rect.center(); switch ( sector_priv) { case TOP_SECTOR: line = QLineF( center, rect.topLeft()); break; case BOTTOM_SECTOR: line = QLineF( center, rect.bottomRight()); break; case LEFT_SECTOR: line = QLineF( center, rect.bottomLeft()); break; case RIGHT_SECTOR: line = QLineF( center, rect.topRight()); break; case UNDEF_SECTOR: default: return 0; } return line.angle(); } /** Compute min angle for sector */ qreal NodeNav::sectorMinAngle() const { QLineF line; QRectF rect = node_priv->item()->boundingRect(); QPointF center = rect.center(); switch ( sector_priv) { case TOP_SECTOR: line = QLineF( center, rect.topRight()); break; case BOTTOM_SECTOR: line = QLineF( center, rect.bottomLeft()); break; case LEFT_SECTOR: line = QLineF( center, rect.topLeft()); break; case RIGHT_SECTOR: line = QLineF( center, rect.bottomRight()); break; case UNDEF_SECTOR: default: return 0; } return line.angle(); }codequery-0.18.1/showgraph/GraphView/navigation.h000066400000000000000000000102071300045745200220070ustar00rootroot00000000000000/** * @file: navigation.h * Interfaces for graph navigation * @ingroup GUIGraph */ /** * @page navigation Navigation Support Classes * * NodeNav * NodeNav class is used for browsing graph with keyboard. Conceptually */ /* * GUI for ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #ifndef NAVIGATION_H #define NAVIGATION_H #include "gview_impl.h" /** * Directions around node: four sectors between * diagonals of node's bounding rectangle */ enum NavSector { /** Sector on the top of the node */ TOP_SECTOR, /** Sector in the bottom of the node */ BOTTOM_SECTOR, /** Sector to the left of the node */ LEFT_SECTOR, /** Sector to the right of the node */ RIGHT_SECTOR, /** Undefined sector */ UNDEF_SECTOR }; /** * Directions around node: four sectors between * diagonals of node's bounding rectangle */ enum NavDirection { /** Upward direction of navigation */ NAV_DIR_UP, /** Downward direction of navigation */ NAV_DIR_DOWN, /** Left direction of navigation */ NAV_DIR_LEFT, /** Right direction of navigation */ NAV_DIR_RIGHT }; /** * Navigation around node: edge selection and jump to one of its endpoints * @ingroup GUIGraph */ class NodeNav { public: /** Constructor */ NodeNav( GNode *curr_node, NavSector nav_sector); /** Get edge to the left of given edge */ GEdge *firstEdgeInSector() const; /** Get edge in given direction of given edge */ GEdge *edgeInDir( GEdge * edge, NavDirection dir) const; /** Check that given edge is in current sector */ bool isEdgeInSector( GEdge * edge) const; /** Get node */ inline GNode* node() const; /** Get sector */ inline NavSector sector() const; /** Check if navigation direction is applicable in current sector */ static bool isDirApplicable( NavDirection dir, NavSector s); /** Check that given point is in given direction from reference point */ static bool isPointInDir( QPointF point, QPointF ref, NavDirection dir); /** Compute coordinate difference between points in given direction */ static qreal deltaInDir( QPointF point, QPointF ref, NavDirection dir); private: /** Compute max angle for sector */ qreal sectorMaxAngle() const; /** Compute min angle for sector */ qreal sectorMinAngle() const; /** * Get node on other end of edge * NOTE:if node_priv is not adjacent to edge then returns NULL */ GNode* otherEnd( GEdge *) const; GNode *node_priv; NavSector sector_priv; }; /** Get pred */ GNode* NodeNav::node() const { return node_priv; } /** Get succ */ NavSector NodeNav::sector() const { return sector_priv; } #endif /** NAVIGATION_H */codequery-0.18.1/showgraph/GraphView/node_item.cpp000066400000000000000000000570561300045745200221630ustar00rootroot00000000000000/** * @file: node_item.cpp * Drawable node implementation */ /* * GUI for ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #include "gview_impl.h" //#define DRAW_AXIS /** Constant for adjusting item's border rectangle */ const qreal box_adjust = 5; /** We can't create nodes separately, do it through newNode method of graph */ GNode::GNode( GGraph *graph_p, int _id): AuxNode( ( AuxGraph *)graph_p, _id), _doc( NULL), ir_id( GRAPH_MAX_NODE_NUM), text_shown( false), _style( NULL) { item_p = new NodeItem( this); graph()->view()->scene()->addItem( item_p); setIRId( id()); graph()->invalidateRanking(); if ( graph()->view()->isContext()) { item()->hide(); setForPlacement( false); setPriority( 0); } } /** Contructor of node with specified position */ GNode::GNode( GGraph *graph_p, int _id, QPointF _pos): AuxNode( ( AuxGraph *)graph_p, _id), _doc( NULL), ir_id( GRAPH_MAX_NODE_NUM), text_shown( false), _style( NULL) { item_p = new NodeItem( this); item_p->setPos( _pos); graph()->view()->scene()->addItem( item_p); setIRId( id()); graph()->invalidateRanking(); if ( graph()->view()->isContext()) { item()->hide(); setForPlacement( false); setPriority( 0); } } /** * Destructor for node - removes edge controls on incidient edges and disconnects item from scene */ GNode::~GNode() { graph()->invalidateRanking(); if ( ( isEdgeControl() || isEdgeLabel()) && isNotNullP( firstPred()) && isNotNullP( firstSucc()) && isNotNullP( firstPred()->pred()) && isNotNullP( firstSucc()->succ())) { GRAPH_ASSERTD( areEqP( firstPred()->style(), firstSucc()->style()), "Different styles on the same edge"); GEdge *e = graph()->newEdge( firstPred()->pred(), firstSucc()->succ()); e->setStyle( firstPred()->style()); } else if ( isSimple()) { QList< GNode *> nodes; GEdge* edge; Marker m = graph()->newMarker(); for ( edge = firstSucc(); isNotNullP( edge); edge = edge->nextSucc()) { edge->item()->adjust(); GNode* succ = edge->succ(); while ( succ->isEdgeControl() || succ->isEdgeLabel()) { assert( isNotNullP( succ->firstSucc())); if ( succ->mark( m)) { nodes << succ; } succ = succ->firstSucc()->succ(); } } for ( edge = firstPred(); isNotNullP( edge); edge = edge->nextPred()) { if ( edge->isSelf()) // We've already processed this one in previous loop continue; edge->item()->adjust(); GNode* pred = edge->pred(); while ( pred->isEdgeControl() || pred->isEdgeLabel()) { assert( isNotNullP( pred->firstPred())); if ( pred->mark( m)) { nodes << pred; } pred = pred->firstPred()->pred(); } } foreach ( GNode *n, nodes) { graph()->deleteNode( n); } graph()->freeMarker( m); } if ( isNodeInFocus()) graph()->setNodeInFocus( NULL); graph()->view()->viewHistory()->eraseNode( this); item()->remove(); graph()->view()->deleteLaterNodeItem( item()); delete _doc; if ( isNotNullP( _style)) _style->decNumItems(); } /** * Get the pointer to graph */ GGraph* GNode::graph() const { return static_cast< GGraph *>( AuxNode::graph()); } /** * Update DOM tree element */ void GNode::updateElement() { AuxNode::updateElement();// Base class method call QDomElement e = elem(); e.setAttribute( "x", item()->x()); e.setAttribute( "y", item()->y()); e.setAttribute( "label", item()->toPlainText()); if ( isSimple()) { // e.setAttribute( "type", "simple"); } else if ( isEdgeControl()) { e.setAttribute( "type", "edge_control"); } else if ( isEdgeLabel()) { e.setAttribute( "type", "edge_label"); } /** Save style that describes this node only along with node */ if ( isNotNullP( style())) { if ( 1 == style()->numItems()) { e.removeAttribute("style"); style()->writeElement( e, false); } else { e.setAttribute("style", style()->name()); } } } /** * read properties from DOM tree element */ void GNode::readFromElement( QDomElement e) { assert( !e.isNull()); assert( e.tagName() == QString( "node")); if ( e.hasAttribute( "x") && e.hasAttribute( "y")) { qreal x = e.attribute( "x").toDouble(); qreal y = e.attribute( "y").toDouble(); item()->setPos( x, y); } if ( e.hasAttribute( "label")) { QString str = e.attribute( "label"); item()->setPlainText( str); QRegExp rx("(\\d+)"); if ( rx.indexIn( str) != -1) { setIRId( rx.cap( 1).toInt()); } } if ( e.hasAttribute("type")) { QString type_str = e.attribute( "type"); if ( type_str == QString( "edge_control")) { setTypeEdgeControl(); } else if (type_str == QString( "edge_label")) { setTypeEdgeLabel(); } } AuxNode::readFromElement( e); // Base class method } bool GNode::isNodeInFocus() const { return areEqP( this, graph()->nodeInFocus()); } /*********************** NodeItem implementation ***************************************/ /** Initialization */ void NodeItem::SetInitFlags() { setFlag( ItemIsMovable); setFlag( ItemIsFocusable); // needed for Qt 4.6 and higher #if (QT_VERSION >= QT_VERSION_CHECK(4, 6, 0)) setFlag( ItemSendsGeometryChanges); #endif setCacheMode( DeviceCoordinateCache); setZValue(2); QGraphicsItem::setCursor( Qt::ArrowCursor); /** * Sets text to create text control. * FIXME: Should find a way to prevent this for edgeControl nodes, since text * contol is not needed for them and this procedure is quite expensive */ setPlainText( ""); } /** Path of box type that given inner rectangle */ inline QRectF boxRect( QRectF rect) { return rect.adjusted( -box_adjust, -box_adjust, box_adjust, box_adjust); } /** Bounding rect that outlines the shape of box type for given inner rectangle */ inline QPainterPath boxPath( QRectF rect) { QPainterPath path; path.addRect( rect.adjusted( -box_adjust, -box_adjust, box_adjust, box_adjust)); return path; } /** Path of rounded box type that given inner rectangle */ inline QRectF rboxRect( QRectF rect) { return rect.adjusted( -box_adjust, -box_adjust, box_adjust, box_adjust); } /** Bounding rect that outlines the shape of rounded box type for given inner rectangle */ inline QPainterPath rboxPath( QRectF rect) { QPainterPath path; path.addRoundedRect( rect.adjusted( -box_adjust, -box_adjust, box_adjust, box_adjust), 2*box_adjust, 2*box_adjust); return path; } /** Path of circle type that given inner rectangle */ inline QRectF circleRect( QRectF rect) { QRectF recta = rect.adjusted( -box_adjust, -box_adjust, box_adjust, box_adjust); qreal radius = sqrt( (recta.width() * recta.width()) + (recta.height() * recta.height())) /2; return QRectF( -radius + rect.width() /2, -radius + rect.height() /2, 2*radius, 2*radius); } /** Bounding rect that outlines the shape of circle type for given inner rectangle */ inline QPainterPath circlePath( QRectF rect) { QPainterPath path; path.addEllipse( circleRect( rect)); return path; } /** Path of diamond type that given inner rectangle */ inline QRectF diamondRect( QRectF rect) { return rect.adjusted( -rect.width() /2, -rect.height() /2, rect.width() /2, rect.height() /2); } /** Bounding rect that outlines the shape of diamond type for given inner rectangle */ inline QPainterPath diamondPath( QRectF rect) { QRectF drect = diamondRect( rect); QPainterPath path( drect.center() - QPointF(drect.width() / 2, 0)); path.lineTo( drect.center() - QPointF(0, drect.height() / 2)); path.lineTo( drect.center() + QPointF(drect.width() / 2, 0)); path.lineTo( drect.center() + QPointF(0, drect.height() / 2)); path.closeSubpath(); return path; } /** Path of ellipse type that given inner rectangle */ inline QRectF ellipseRect( QRectF rect) { return diamondRect( rect); } /** Bounding rect that outlines the shape of ellipse type for given inner rectangle */ inline QPainterPath ellipsePath( QRectF rect) { QPainterPath path; path.addEllipse( ellipseRect( rect)); return path; } void NodeItem::shapeChanged() { prepareGeometryChange(); } /** * Implementation of shape calculation */ inline QPainterPath shape2Path( NodeShape shape, QRectF rect) { ASSERTD( shape < NODE_SHAPES_NUM); switch ( shape) { case NODE_SHAPE_BOX: return boxPath( rect); case NODE_SHAPE_ROUNDED_BOX: return rboxPath( rect); case NODE_SHAPE_CIRCLE: return circlePath( rect); case NODE_SHAPE_DIAMOND: return diamondPath( rect); case NODE_SHAPE_ELLIPSE: return ellipsePath( rect); default: ASSERTD( 0); QPainterPath path; path.addRect( rect); return path; } QPainterPath path; path.addRect( rect); return path; } /** * Implementation of shape calculation */ inline QRectF shape2Rect( NodeShape shape, QRectF rect) { ASSERTD( shape < NODE_SHAPES_NUM); switch ( shape) { case NODE_SHAPE_BOX: return boxRect( rect); case NODE_SHAPE_ROUNDED_BOX: return rboxRect( rect); case NODE_SHAPE_CIRCLE: return circleRect( rect); case NODE_SHAPE_DIAMOND: return diamondRect( rect); case NODE_SHAPE_ELLIPSE: return ellipseRect( rect); default: ASSERTD( 0); return rect; } return rect; } /** * Rectangle that marks border of node */ QRectF NodeItem::borderRect() const { if ( isNullP( node_p)) return QRectF(); if ( node()->isEdgeControl()) { qreal adjust = 2; return QRectF( -EdgeControlSize - adjust, -EdgeControlSize - adjust, 2*( EdgeControlSize + adjust), 2*( EdgeControlSize + adjust)); } else if ( node()->isEdgeLabel()) { return QGraphicsTextItem::boundingRect() .adjusted( -box_adjust, -box_adjust, box_adjust, box_adjust); } else { QRectF rect = QGraphicsTextItem::boundingRect(); if ( isNotNullP( node()->style())) { return shape2Rect( node()->style()->shape(), rect); } else { return rect.adjusted( -box_adjust, -box_adjust, box_adjust, box_adjust); } } } /** * Overload of QGraphicsItem::bounding rectangle */ QRectF NodeItem::boundingRect() const { qreal adjust = 2; return borderRect().adjusted( -adjust, -adjust, adjust, adjust); } /** * Shape of NodeItem: circle for EdgeControl and rectangle for simple */ QPainterPath NodeItem::shape() const { if ( isNullP( node_p)) return QPainterPath(); if ( node()->isEdgeControl()) { QPainterPath path; path.addEllipse( -EdgeControlSize, -EdgeControlSize, 2*EdgeControlSize, 2*EdgeControlSize); return path; } else { QRectF rect = QGraphicsTextItem::boundingRect(); if ( isNotNullP( node()->style())) { return shape2Path( node()->style()->shape(), rect); } else { QPainterPath path; path.addRect( borderRect()); return path; } } } bool NodeItem::contains(const QPointF &point) const { return shape().contains(point); } /** * Painting procedure for NodeItem */ void NodeItem::paint( QPainter *painter, const QStyleOptionGraphicsItem *option, QWidget *widget) { if ( isNullP( node_p)) return; if ( node()->graph()->view()->isContext()) painter->setOpacity( opacityLevel()); if ( node()->isSimple() || node()->isEdgeLabel()) { #ifdef DRAW_AXIS QPen axis_pen( "red"); painter->setPen( axis_pen); painter->drawRect( borderRect()); painter->drawLine( QPoint( -boundingRect().width(), 0), QPoint( boundingRect().width(),0)); painter->drawLine( QPoint( 0, -boundingRect().height()), QPoint( 0, boundingRect().height())); #endif QPen pen( option->palette.foreground().color(), 1, Qt::SolidLine, Qt::RoundCap, Qt::RoundJoin); if ( option->levelOfDetail < 0.1) { painter->fillRect( borderRect(), option->palette.highlight().color()); } qreal adjust = 3; if ( isNotNullP( node()->style())) { pen = node()->style()->pen(); painter->setBrush( node()->style()->brush()); } if ( bold_border )// ( option->state & QStyle::State_Sunken)) { pen.setWidthF( pen.widthF() + 1); } if ( alternate_background) { painter->setBrush( option->palette.highlight().color()); } painter->setPen( pen); if ( node()->isSimple()) { QRectF rect = QGraphicsTextItem::boundingRect(); if ( isNotNullP( node()->style())) { painter->drawPath( shape2Path( node()->style()->shape(), rect)); } else { painter->drawRect( borderRect()); } } if ( option->levelOfDetail >= 0.2) { if ( painter->isActive()) QGraphicsTextItem::paint( painter, option, widget); } } else if ( node()->isEdgeControl()) { if ( option->levelOfDetail < 0.2) return; if ( node()->firstPred()->item()->isSelected() || node()->firstSucc()->item()->isSelected()) { if ( bold_border && ( option->state & QStyle::State_Sunken)) { painter->setBrush( option->palette.highlight().color()); painter->setPen( QPen(option->palette.foreground().color(), 0)); } else { painter->setBrush( option->palette.highlight().color()); painter->setPen( QPen(option->palette.foreground().color(), 0)); } painter->drawEllipse( -EdgeControlSize, -EdgeControlSize, 2*EdgeControlSize, 2*EdgeControlSize); } } painter->setOpacity( 1); } /** * Right button press starts edge drawing process */ void NodeItem::mousePressEvent( QGraphicsSceneMouseEvent *event) { bold_border = true; if ( event->button() & Qt::RightButton && !node()->isEdgeControl()) { if ( node()->graph()->view()->isEditable()) { node()->graph()->view()->SetCreateEdge( true); node()->graph()->view()->SetTmpSrc( node()); node()->graph()->view()->showHelper(); } } else if ( node()->isEdgeControl() || node()->isEdgeLabel()) { node()->firstPred()->item()->setSelected( true); node()->firstSucc()->item()->setSelected( true); } QGraphicsTextItem::mousePressEvent(event); update(); } /** * On mouse release we do nothing - graph will handle it for us */ void NodeItem::mouseReleaseEvent( QGraphicsSceneMouseEvent *event) { bold_border = false; bool call_baseclass = true; /** Select this node */ node()->graph()->emptySelection(); if ( !node()->isNodeInFocus()) { node()->graph()->view()->viewHistory()->focusEvent( node()); node()->graph()->setNodeInFocus( node()); } node()->graph()->selectNode( this->node()); /** Show context menu */ if ( node()->graph()->view()->isShowContextMenus() && ( event->button() & Qt::RightButton) ) { QMenu *menu = node()->graph()->view()->createMenuForNode( node()); menu->exec( event->screenPos()); call_baseclass = false; delete menu; } else if ( event->button() & Qt::LeftButton && !( node()->isEdgeControl() || node()->isEdgeLabel())) { if ( node()->graph()->view()->isContext()) { node()->graph()->view()->findContext(); //node()->graph()->view()->showNodeText( node()); } else { //node()->graph()->view()->showNodeText( node()); } } if ( call_baseclass) QGraphicsTextItem::mouseReleaseEvent( event); update(); setFlag( ItemIsMovable, true); } /** * Double click enables text edition for simple nodes */ void NodeItem::mouseDoubleClickEvent(QGraphicsSceneMouseEvent *event) { setFlag( ItemIsMovable, false); if ( node()->graph()->view()->isEditable()) { if ( event->button() & Qt::LeftButton && !node()->isEdgeControl()) { if ( textInteractionFlags() == Qt::NoTextInteraction) { setTextInteractionFlags(Qt::TextEditorInteraction); setFocus( Qt::MouseFocusReason); } //QGraphicsTextItem::mousePressEvent(event); } } else { node()->graph()->view()->showNodeText( node()); } } void NodeItem::focusOutEvent(QFocusEvent *event) { setTextInteractionFlags(Qt::NoTextInteraction); QGraphicsTextItem::focusOutEvent(event); setFlag( ItemIsFocusable, true); } /** * We should adjust edges when entering the text as the size of item changes */ void NodeItem::keyPressEvent(QKeyEvent *event) { prepareGeometryChange(); if ( textInteractionFlags() == Qt::TextEditorInteraction) { GEdge *edge = NULL; QGraphicsTextItem::keyPressEvent(event); for ( edge = node()->firstSucc(); isNotNullP( edge); edge = edge->nextSucc()) { edge->item()->adjust(); } for ( edge = node()->firstPred(); isNotNullP( edge); edge = edge->nextPred()) { edge->item()->adjust(); } } else { int key = event->key(); GEdge *edge = NULL; NavSector sector = UNDEF_SECTOR; if ( node()->isNodeInFocus()) { switch( key) { case Qt::Key_Up: sector = TOP_SECTOR; break; case Qt::Key_Down: sector = BOTTOM_SECTOR; break; case Qt::Key_Left: sector = LEFT_SECTOR; break; case Qt::Key_Right: sector = RIGHT_SECTOR; break; default: sector = UNDEF_SECTOR; break; } node()->graph()->setNodeInFocus( node(), sector); edge = NodeNav( node(), sector).firstEdgeInSector(); if ( isNotNullP( edge)) { // Get focus on edge scene()->clearFocus(); scene()->clearSelection(); edge->item()->setFocus(); edge->item()->setSelected( true); } } } update(); } /** * Perform animation step * Advance node's coordinates and opacity towards goal values of these parameters * Return true if node have advanced somehow. False if node hasn't change */ bool NodeItem::advance() { QPointF target( node()->modelX(), node()->modelY()); QLineF line( pos(), target); qreal dist = line.length(); bool changed = false; if ( !isVisible()) return false; qreal target_opacity = ((qreal)node()->priority())/ GVIEW_MAX_PRIORITY; if ( target_opacity > opacityLevel() + OPACITY_STEP) { setOpacityLevel( opacityLevel() + OPACITY_STEP); changed = true; } else if ( target_opacity < opacityLevel() - OPACITY_STEP) { setOpacityLevel( opacityLevel() - OPACITY_STEP); changed = true; } else { setOpacityLevel( target_opacity); if ( !target_opacity) { setVisible( false); changed = true; } } if ( changed) { adjustAssociates(); updateAssociates(); update(); } if ( dist > NODE_SPEED) { QPointF displacement( NODE_SPEED * line.dx() / dist, NODE_SPEED * line.dy() / dist); setPos( pos() + displacement); changed = true; } return changed; } void NodeItem::adjustAssociates() { GEdge *edge = NULL; for ( edge = node()->firstSucc(); isNotNullP( edge); edge = edge->nextSucc()) { edge->item()->adjust(); GNode* succ = edge->succ(); if ( succ->isEdgeControl() || succ->isEdgeLabel()) { assert( isNotNullP( succ->firstSucc())); succ->firstSucc()->item()->adjust(); } } for ( edge = node()->firstPred(); isNotNullP( edge); edge = edge->nextPred()) { edge->item()->adjust(); GNode* pred = edge->pred(); if ( pred->isEdgeControl() || pred->isEdgeLabel()) { assert( isNotNullP( pred->firstPred())); pred->firstPred()->item()->adjust(); } } prepareGeometryChange(); } void NodeItem::updateAssociates() { GEdge *edge = NULL; for ( edge = node()->firstSucc(); isNotNullP( edge); edge = edge->nextSucc()) { edge->item()->adjust(); GNode* succ = edge->succ(); if ( succ->isEdgeControl() || succ->isEdgeLabel()) { assert( isNotNullP( succ->firstSucc())); succ->firstSucc()->item()->update(); } } for ( edge = node()->firstPred(); isNotNullP( edge); edge = edge->nextPred()) { edge->item()->adjust(); GNode* pred = edge->pred(); if ( pred->isEdgeControl() || pred->isEdgeLabel()) { assert( isNotNullP( pred->firstPred())); pred->firstPred()->item()->update(); } } } /** * Adjust edges when node changes */ QVariant NodeItem::itemChange( GraphicsItemChange change, const QVariant &value) { GEdge *edge = NULL; if ( change != QGraphicsItem::ItemSceneChange || change != QGraphicsItem::ItemSceneHasChanged) { adjustAssociates(); } return QGraphicsTextItem::itemChange(change, value); } codequery-0.18.1/showgraph/GraphView/node_item.h000066400000000000000000000203211300045745200216110ustar00rootroot00000000000000/** * @file: node_item.h * Drawable Node class definition. */ /* * GUI for ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #ifndef NODE_W_H #define NODE_W_H /** * Subclass of QGraphicsItem for representing a node in scene * @ingroup GUIGraph */ class NodeItem: public QGraphicsTextItem { GNode *node_p; QDockWidget *text_dock; qreal opacity; bool bold_border; bool alternate_background; /** Initialization */ void SetInitFlags(); public: /** Type of graphics item that corresponds to node */ enum {Type = TypeNode}; /** Constructor */ inline NodeItem( GNode *n_p): opacity( MAX_OPACITY), bold_border( false), alternate_background( false) { node_p = n_p; SetInitFlags(); } /** Get item's opacity level */ inline qreal opacityLevel() const { return opacity; } /** Set item's opacity level */ inline void setOpacityLevel( qreal op_l) { opacity = op_l; } /** Set node to be highlighted */ inline void highlight() { bold_border = true; alternate_background = true; update(); } /** Set node to be regular */ inline void toRegular() { bold_border = false; alternate_background = false; update(); } /** Get corresponding text doc */ inline QDockWidget *textDock() const { return text_dock; } /** Set corresponding text doc */ inline void setTextDock( QDockWidget *dock) { text_dock = dock; } /** Get pointer to model node */ inline GNode *node() const { return node_p; } /** Get the node type */ inline int type() const { return Type; } /** Get text border rectangle */ inline QRectF textRect() const { return QGraphicsTextItem::boundingRect(); } /** Get the inner border rectangle */ QRectF borderRect() const; /** Get the bounding rectangle */ QRectF boundingRect() const; /** Get node shape */ QPainterPath shape() const; /** Determine that node's shape contains point */ bool contains(const QPointF &point) const; /** Paint procedure */ void paint(QPainter *painter, const QStyleOptionGraphicsItem *option, QWidget *widget); /** Reimplementation of mouse press event handler */ void mousePressEvent(QGraphicsSceneMouseEvent *event); /** Reimplementation of mouse release event handler */ void mouseReleaseEvent(QGraphicsSceneMouseEvent *event); /** Reimplementation of double click event handler */ void mouseDoubleClickEvent(QGraphicsSceneMouseEvent *event); /** Reimplementation of focus out event */ void focusOutEvent(QFocusEvent *event); /** Reimplementation of key press event */ void keyPressEvent(QKeyEvent *event); /** Adjust associated items */ void adjustAssociates(); /** Update associated items */ void updateAssociates(); /** Item change event handler */ QVariant itemChange(GraphicsItemChange change, const QVariant &value); /** * Perform animation step * Advance node's coordinates and opacity towards goal values of these parameters * Return true if node have advanced somehow. False if node hasn't change */ bool advance(); /** Remove from scene */ inline void remove() { setVisible( false); removeFromIndex(); scene()->removeItem( this); node_p = NULL; } /** Change shape */ void shapeChanged(); }; /** * Representation of model graph node * @ingroup GUIGraph */ class GNode: public AuxNode { GraphNum ir_id; bool text_shown; /** Representation of node in graph view */ NodeItem *item_p; /** Graphical appearance style */ GStyle *_style; /** Representation of node as text */ QTextDocument* _doc; protected: /** We can't create nodes separately, do it through newNode method of graph */ GNode( GGraph *graph_p, int _id); /** Contructor of node with specified position */ GNode( GGraph *graph_p, int _id, QPointF _pos); friend class GGraph; public: /** Destructor */ virtual ~GNode(); /** Tell whether the text is shown */ inline bool isTextShown() const { return text_shown; } /** Check if this node is in focus */ bool isNodeInFocus() const; /** Memorize that the text is shown */ inline void setTextShown( bool shown = true) { text_shown = shown; } /** Get node's Id as it was parsed from ir dump */ inline GraphNum irId() const { return ir_id; } /** Set node's IR ID */ inline void setIRId( GraphNum i) { ir_id = i; } /** Get the pointer to item */ inline NodeItem* item() const { return item_p; } /** Get the corresponding text */ inline QTextDocument *doc() const { return _doc; } /** Set node's text document */ inline void setDoc( QTextDocument* doc) { _doc = doc; } /** * Update DOM element */ virtual void updateElement(); /** * Read properties from XML */ virtual void readFromElement( QDomElement elem); GGraph * graph() const; /** Get next graph's node */ inline GNode* nextNode() { return static_cast< GNode*>( AuxNode::nextNode()); } /** Get prev graph's node */ inline GNode* prevNode() { return static_cast< GNode*>( AuxNode::prevNode()); } /** Edge connection reimplementation */ inline void AddEdgeInDir( GEdge *edge, GraphDir dir) { AuxNode::AddEdgeInDir( (AuxEdge *)edge, dir); } /** Add predecessor */ inline void AddPred( GEdge *edge) { AddEdgeInDir( edge, GRAPH_DIR_UP); } /** Add successor */ inline void AddSucc( GEdge *edge) { AddEdgeInDir( edge, GRAPH_DIR_DOWN); } /** Get first edge in given direction */ inline GEdge* firstEdgeInDir( GraphDir dir) { return static_cast< GEdge*>( AuxNode::firstEdgeInDir( dir)); } /** Get first successor */ inline GEdge* firstSucc() { return firstEdgeInDir( GRAPH_DIR_DOWN); } /** Get first predecessor */ inline GEdge* firstPred() { return firstEdgeInDir( GRAPH_DIR_UP); } /** Get node's width */ virtual inline double width() const { return item()->borderRect().width(); } /** Get node's nodes height */ virtual inline double height() const { return item()->boundingRect().height(); } /** Set node's style */ inline void setStyle( GStyle *st) { if ( isNotNullP( _style)) _style->decNumItems(); _style = st; if ( isNotNullP( _style)) _style->incNumItems(); item()->update(); } /** Get node's style */ inline GStyle * style() const { return _style; } }; #endifcodequery-0.18.1/showgraph/GraphView/style_edit.cpp000066400000000000000000000217451300045745200223610ustar00rootroot00000000000000/** * @file: style_edit.cpp * Widgets for style manipulation */ /* * GUI for ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #include "gview_impl.h" ColorButton::ColorButton( QWidget *parent): QAbstractButton( parent) { } void ColorButton::paintEvent( QPaintEvent *event) { QPainter painter( this); painter.setPen( palette().foreground().color()); painter.setBrush( color); painter.drawRect( rect()); } QSize ColorButton::sizeHint() const { return QSize( 20,20); } StyleEdit::StyleEdit( QWidget *parent, bool show_additional) { QColor color; if ( show_additional) { shape_combo = new QComboBox( this); shape_combo->addItem(tr("Box"), NODE_SHAPE_BOX); shape_combo->addItem(tr("Rounded box"), NODE_SHAPE_ROUNDED_BOX); shape_combo->addItem(tr("Ellipse"), NODE_SHAPE_ELLIPSE); shape_combo->addItem(tr("Circle"), NODE_SHAPE_CIRCLE); shape_combo->addItem(tr("Diamond"), NODE_SHAPE_DIAMOND); shape_label = new QLabel( "Shape:", this); shape_label->setBuddy( shape_combo); } else { shape_combo = NULL; } color = QColor(palette().foreground().color()); line_color_button = new ColorButton( this); line_color_button->setColor( color); line_color_label = new QLabel( "Line color:", this); line_color_label->setBuddy( line_color_button); line_style_combo = new QComboBox( this); #ifdef USE_QT5 line_style_combo->addItem(tr("Solid"), QPen(Qt::SolidLine)); line_style_combo->addItem(tr("Dash"), QPen(Qt::DashLine)); line_style_combo->addItem(tr("Dot"), QPen(Qt::DotLine)); line_style_combo->addItem(tr("Dash Dot"), QPen(Qt::DashDotLine)); line_style_combo->addItem(tr("Dash Dot Dot"), QPen(Qt::DashDotDotLine)); line_style_combo->addItem(tr("None"), QPen(Qt::NoPen)); #else line_style_combo->addItem(tr("Solid"), Qt::SolidLine); line_style_combo->addItem(tr("Dash"), Qt::DashLine); line_style_combo->addItem(tr("Dot"), Qt::DotLine); line_style_combo->addItem(tr("Dash Dot"), Qt::DashDotLine); line_style_combo->addItem(tr("Dash Dot Dot"), Qt::DashDotDotLine); line_style_combo->addItem(tr("None"), Qt::NoPen); #endif line_style_label = new QLabel( "Line style:", this); line_style_label->setBuddy( line_style_combo); line_width_spin = new QDoubleSpinBox( this); line_width_spin->setMaximum( 12); line_width_label = new QLabel( "Line width:", this); line_width_label->setBuddy( line_width_spin); if ( show_additional) { color = QColor(palette().base().color()); fill_check = new QCheckBox( "Fill", this); fill_color_button = new ColorButton( this); fill_color_button->setColor( color); fill_color_label = new QLabel( "Fill color:", this); fill_color_label->setBuddy( fill_color_button); } else { fill_color_button = NULL; fill_color_label = NULL; fill_check = NULL; } ok = new QPushButton( "&OK", this); cancel = new QPushButton( "&Cancel", this); QGridLayout *mainLayout = new QGridLayout; //mainLayout->setColumnStretch(1, 3); //Row 0 name if ( show_additional) { mainLayout->addWidget( shape_label, 0, 0, Qt::AlignRight); mainLayout->addWidget( shape_combo, 0, 1); } //Row 1 line color mainLayout->addWidget( line_color_label, 1, 0, Qt::AlignRight); mainLayout->addWidget( line_color_button, 1, 1); //Row 2 line style mainLayout->addWidget( line_style_label, 2, 0, Qt::AlignRight); mainLayout->addWidget( line_style_combo, 2, 1); //Row 3 line width mainLayout->addWidget( line_width_label, 3, 0, Qt::AlignRight); mainLayout->addWidget( line_width_spin, 3, 1); //Row 4 fill color if ( show_additional) { mainLayout->addWidget( fill_check, 4, 0, 1, 2); mainLayout->addWidget( fill_color_label, 5, 0, Qt::AlignRight); mainLayout->addWidget( fill_color_button, 5, 1); } // Row 5 ok & cancel mainLayout->addWidget( ok, 6, 0); mainLayout->addWidget( cancel, 6, 1); setLayout( mainLayout); if ( show_additional) { connect( shape_combo, SIGNAL( currentIndexChanged( int)), this, SLOT( changeShape()) ); connect( fill_color_button, SIGNAL( clicked()), this, SLOT( selectFillColor()) ); connect( fill_check, SIGNAL( clicked()), this, SLOT( changeFillStyle()) ); } connect( line_color_button, SIGNAL( clicked()), this, SLOT( selectLineColor()) ); connect( line_style_combo, SIGNAL( currentIndexChanged( int)), this, SLOT( changeLineStyle()) ); connect( line_width_spin, SIGNAL( valueChanged( double)), this, SLOT( changeLineWidth( double)) ); connect( ok, SIGNAL( clicked()), this, SLOT( accept())); connect( cancel, SIGNAL( clicked()), this, SLOT( reject())); setWindowTitle( "Edit style"); setWindowFlags( windowFlags() | Qt::MSWindowsFixedSizeDialogHint); } /** Change name of the current style */ void StyleEdit::changeStyleName() { } /** Invoke color selection for line */ void StyleEdit::selectLineColor() { QColor color = QColorDialog::getColor(); line_color_button->setColor( color); gstyle->setPenColor( color); gstyle->setState(); emit styleChanged( gstyle); } /** Change line style */ void StyleEdit::changeLineStyle() { gstyle->setPenStyle((Qt::PenStyle)line_style_combo->itemData( line_style_combo->currentIndex()).toInt()); gstyle->setState(); emit styleChanged( gstyle); } /** Change line style */ void StyleEdit::changeShape() { emit styleChanged( gstyle); gstyle->setShape((NodeShape)shape_combo->itemData( shape_combo->currentIndex()).toInt()); gstyle->setState(); emit styleChanged( gstyle); } /** Change line width */ void StyleEdit::changeLineWidth( double width) { gstyle->setPenWidth(line_width_spin->value()); gstyle->setState(); emit styleChanged( gstyle); } /** Set fill style */ void StyleEdit::changeFillStyle() { if ( !fill_check->isChecked()) { QBrush br = gstyle->brush(); br.setStyle( Qt::NoBrush); gstyle->setBrush( br); } else { QBrush br = gstyle->brush(); br.setStyle( Qt::SolidPattern); gstyle->setBrush( br); gstyle->setState(); } emit styleChanged( gstyle); } /** Invoke color selection for fill */ void StyleEdit::selectFillColor() { QColor color = QColorDialog::getColor(); QBrush brush( color); fill_color_button->setColor( color); gstyle->setBrush( brush); gstyle->setState(); fill_check->setChecked( true); emit styleChanged( gstyle); } /** Set style */ void StyleEdit::setGStyle( GStyle *st) { gstyle = st; QColor color( st->pen().color()); line_color_button->setColor( color); if ( isNotNullP( shape_combo)) { color = QColor( st->brush().color()); shape_combo->setCurrentIndex( shape_combo->findData( gstyle->shape())); fill_color_button->setColor( color); fill_check->setChecked( st->brush().style() != Qt::NoBrush); if ( st->brush().style() == Qt::NoBrush) { QBrush br = gstyle->brush(); color = QColor( "White"); br.setColor( color); gstyle->setBrush( br); fill_color_button->setColor( color); } } #ifdef USE_QT5 line_style_combo->setCurrentIndex( line_style_combo->findData( QPen(gstyle->pen().style()))); #else line_style_combo->setCurrentIndex( line_style_combo->findData( gstyle->pen().style())); #endif line_width_spin->setValue( gstyle->pen().widthF()); } codequery-0.18.1/showgraph/GraphView/style_edit.h000066400000000000000000000070251300045745200220210ustar00rootroot00000000000000/** * @file: style_edit.h * Interface of style-manipulation widgets */ /* * Graph library, internal representation of graphs in ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #pragma once #ifndef STYLE_EDIT_H #define STYLE_EDIT_H #include "gview_impl.h" /** * Colored button */ class ColorButton: public QAbstractButton { public: ColorButton( QWidget *parent = 0); /** Constructor */ void paintEvent( QPaintEvent *event); /** Paint event handler reimplementation */ QSize sizeHint() const; /** Size hint reimplementation */ /** Change the button's color */ void setColor( QColor &cl) { color = cl; } private: /** Color of the button */ QColor color; }; /** * Widget for creating/editing styles */ class StyleEdit: public QDialog { Q_OBJECT; public: /** Constructor */ StyleEdit( QWidget *parent = 0, bool show_additional = false); /** Set style */ void setGStyle( GStyle *); signals: /** Lets everyone know that the style has changed and affected objects should be redrwan */ void styleChanged( GStyle *style); public slots: /** Change name of the current style */ void changeStyleName(); /** Invoke color selection for line */ void selectLineColor(); /** Change line style */ void changeLineStyle(); /** Change line style */ void changeShape(); /** Change line width */ void changeLineWidth( double width); /** Invoke color selection for fill */ void selectFillColor(); /** Change fill style */ void changeFillStyle(); private: GStyle *gstyle; //QHash< QString, GStyle *> styles; QLabel *name_label; QLabel *line_color_label; QLabel *line_style_label; QLabel *line_width_label; QLabel *fill_color_label; QLabel *shape_label; QComboBox *name_combo; QCheckBox *fill_check; QComboBox *shape_combo; ColorButton *line_color_button; QComboBox *line_style_combo; QDoubleSpinBox *line_width_spin; ColorButton *fill_color_button; QPushButton *ok; QPushButton *cancel; }; #endifcodequery-0.18.1/showgraph/GraphView/visible_edge.cpp000066400000000000000000000130221300045745200226220ustar00rootroot00000000000000/** * @file: visible_edge.cpp * Implemetation of VEdge class * @ingroup GUIGraph */ /* * GUI for ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #include "gview_impl.h" /** Maximal contangent for edge to be considered 'vertical' */ const qreal MAX_COT_VERTICAL = 0.1; /** Maximal tangent for edge to be considered 'horizontal' */ const qreal MAX_TAN_HORIZONTAL = 0.1; /** Constructor from two nodes */ VEdge::VEdge( GNode *pred_node, GNode *succ_node): pred_priv( pred_node), succ_priv( succ_node) { } /** Constructor from existing graph edge */ VEdge::VEdge( GEdge *prototype) { pred_priv = prototype->realPred(); succ_priv = prototype->realSucc(); } /** Returns true if edge looks vertical in general */ bool VEdge::isVertical() const { NodeItem *p_item = pred()->item(); NodeItem *s_item = succ()->item(); // Both points in p_item's coordinates QPointF p_center = p_item->boundingRect().center(); QPointF s_center = p_item->mapFromItem( s_item, s_item->boundingRect().center()); qreal delta_x = abs( p_center.x() - s_center.x()); qreal delta_y = abs( p_center.y() - s_center.y()); if ( delta_x/delta_y > MAX_COT_VERTICAL) return false; return true; } /** Returns true if edge looks horizontal in general */ bool VEdge::isHorizontal() const { NodeItem *p_item = pred()->item(); NodeItem *s_item = succ()->item(); // Both points in p_item's coordinates QPointF p_center = p_item->boundingRect().center(); QPointF s_center = p_item->mapFromItem( s_item, s_item->boundingRect().center()); qreal delta_x = abs( p_center.x() - s_center.x()); qreal delta_y = abs( p_center.y() - s_center.y()); if ( delta_y/delta_x > MAX_TAN_HORIZONTAL) return false; return true; } /** Get end node that is in 'up' direction, returns NULL if edge is horizontal */ GNode * VEdge::nodeUp() const { NodeItem *p_item = pred()->item(); NodeItem *s_item = succ()->item(); // Both points in p_item's coordinates QPointF p_center = p_item->boundingRect().center(); QPointF s_center = p_item->mapFromItem( s_item, s_item->boundingRect().center()); if ( isHorizontal()) return NULL; // Note: y axis goes downwards if ( p_center.y() > s_center.y()) { return succ(); } else { return pred(); } } /** Get end node that is in 'down' direction, returns NULL if edge is horizontal */ GNode * VEdge::nodeDown() const { NodeItem *p_item = pred()->item(); NodeItem *s_item = succ()->item(); // Both points in p_item's coordinates QPointF p_center = p_item->boundingRect().center(); QPointF s_center = p_item->mapFromItem( s_item, s_item->boundingRect().center()); if ( isHorizontal()) return NULL; // Note: y axis goes downwards if ( p_center.y() > s_center.y()) { return pred(); } else { return succ(); } } /** Get end node that is in 'left' direction, returns NULL if edge is vertical */ GNode * VEdge::nodeLeft() const { NodeItem *p_item = pred()->item(); NodeItem *s_item = succ()->item(); // Both points in p_item's coordinates QPointF p_center = p_item->boundingRect().center(); QPointF s_center = p_item->mapFromItem( s_item, s_item->boundingRect().center()); if ( isVertical()) return NULL; // Note: x axis goes right if ( p_center.x() > s_center.x()) { return succ(); } else { return pred(); } } /** Get end node that is in 'right' direction, returns NULL if edge is vertical */ GNode * VEdge::nodeRight() const { NodeItem *p_item = pred()->item(); NodeItem *s_item = succ()->item(); // Both points in p_item's coordinates QPointF p_center = p_item->boundingRect().center(); QPointF s_center = p_item->mapFromItem( s_item, s_item->boundingRect().center()); if ( isVertical()) return NULL; // Note: x axis goes right if ( p_center.x() > s_center.x()) { return pred(); } else { return succ(); } } codequery-0.18.1/showgraph/GraphView/visible_edge.h000066400000000000000000000062401300045745200222730ustar00rootroot00000000000000/** * @file: visible_edge.h * Definition of VEdge class * @ingroup GUIGraph */ /** * @page vedge Visible Edge Class * * Visible Edge Class * VEdge stands for "visible edge". It is a class for manipulating * an edge like the user see it. The need for this stems from * the fact that edge seen by user is actually composed of * several low-level edges between pseudo nodes. */ /* * GUI for ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #ifndef VISIBLE_EDGE_H #define VISIBLE_EDGE_H #include "gview_impl.h" /** * Visible edge * @ingroup GUIGraph */ class VEdge { public: /** Constructor from two nodes */ VEdge( GNode *pred_node, GNode *succ_node); /** Constructor from existing graph edge */ VEdge( GEdge *prototype); /** Returns true if edge looks vertical in general */ bool isVertical() const; /** Returns true if edge looks horizontal in general */ bool isHorizontal() const; /** Get end node that is in 'up' direction, returns NULL if edge is horizontal */ GNode *nodeUp() const; /** Get end node that is in 'down' direction, returns NULL if edge is horizontal */ GNode *nodeDown() const; /** Get end node that is in 'left' direction, returns NULL if edge is vertical */ GNode *nodeLeft() const; /** Get end node that is in 'right' direction, returns NULL if edge is vertical */ GNode *nodeRight() const; /** Get pred */ inline GNode* pred() const; /** Get succ */ inline GNode *succ() const; private: GNode *pred_priv; GNode *succ_priv; }; /** Get pred */ GNode* VEdge::pred() const { return pred_priv; } /** Get succ */ GNode *VEdge::succ() const { return succ_priv; } #endif /** VISIBLE_EDGE_H */codequery-0.18.1/showgraph/LICENSE.txt000066400000000000000000000027141300045745200174320ustar00rootroot00000000000000Copyright (c) 2014, Boris Shurygin All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.codequery-0.18.1/showgraph/Layout/000077500000000000000000000000001300045745200170605ustar00rootroot00000000000000codequery-0.18.1/showgraph/Layout/aux_edge.h000066400000000000000000000125011300045745200210110ustar00rootroot00000000000000/** * @file: aux_edge.h * Layout Edge class * * Graph for performing layouts, consists of dummy nodes. * Layout library, 2d graph placement of graphs in ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * AuxGraph, AuxNode and AuxEdge classes represent auxiliary graph used for layout purposes */ #ifndef AUX_EDGE_H #define AUX_EDGE_H /** * Edge types * * @ingroup Layout */ enum AuxEdgeType { /** Unknown type (typically before classification) */ UNKNOWN_TYPE_EDGE = 0, /** Tree edge */ TREE_EDGE, /** Back edge */ BACK_EDGE, /** Forward edge */ FORWARD_EDGE, /** Self-edge */ SELF_EDGE, /** Number of edge types */ EDGE_TYPES_NUM }; /** * Edge of model graph used in Layout * * @ingroup Layout */ class AuxEdge: public Edge { bool priv_fixed; AuxEdgeType priv_type; protected: /** Constructors are made private, only nodes and graph can create edges */ AuxEdge( AuxGraph *graph_p, int _id, AuxNode *_pred, AuxNode* _succ); public: friend class AuxGraph; friend class AuxNode; /** Get node in given direction */ inline AuxNode *node( GraphDir dir) const { return static_cast< AuxNode *>( Edge::node( dir)); } /** Get predecessor */ inline AuxNode *pred() const { return node( GRAPH_DIR_UP); } /** Get successor */ inline AuxNode *succ() const { return node( GRAPH_DIR_DOWN); } /** insert node on this edge */ inline AuxNode *insertNode() { return static_cast< AuxNode *>( Edge::insertNode()); } /** Next edge in graph's list */ inline AuxEdge* nextEdge() { return static_cast< AuxEdge *>( Edge::nextEdge()); } /** Next edge in give direction */ inline AuxEdge* nextEdgeInDir( GraphDir dir) { return static_cast< AuxEdge *>( Edge::nextEdgeInDir( dir)); } /** Next successor */ inline AuxEdge* nextSucc() { return nextEdgeInDir( GRAPH_DIR_DOWN); } /** Next predecessor */ inline AuxEdge* nextPred() { return nextEdgeInDir( GRAPH_DIR_UP); } /** Check if an edge is fixed */ inline bool isFixed() const { return priv_fixed; } /** Set edge to be fixed */ inline void setFixed( bool fx) { priv_fixed = fx; } /** Check if edge was classified as a 'Backedge' */ inline bool isBack() const { return priv_type == BACK_EDGE; } /** Get edge type */ inline AuxEdgeType type() const { return priv_type; } /** Set edge type */ inline void setType( AuxEdgeType t = UNKNOWN_TYPE_EDGE) { if ( isSelf()) { return; } priv_type = t; } /** Set edge to be of unknown type */ inline void setUnknown() { setType( UNKNOWN_TYPE_EDGE); } /** Set edge to be a tree edge */ inline void setTree() { setType( TREE_EDGE); } /** Set edge to be a backedge */ inline void setBack() { setType( BACK_EDGE); } /** Set edge to be a forward edge */ inline void setForward() { priv_type = FORWARD_EDGE; } /** Set edge to be a self-edge */ inline void setSelf() { assertd( pred() == succ()); setType( SELF_EDGE); } /** Check if edge is a self-edge */ inline bool isSelf() const { return pred() == succ(); } /** Check whether this edge is inverted */ inline bool isInverted() const { return isBack(); } /** Return real node in given direction */ inline AuxNode* realNode( GraphDir dir) const { AuxNode* n = node( dir); assertd( isNotNullP( n)); while ( n->isPseudo()) { n = n->firstEdgeInDir( dir)->node( dir); } return n; } /** Get real predecessor */ inline AuxNode* realPred() const { return realNode( GRAPH_DIR_UP); } /** Get real successor */ inline AuxNode* realSucc() const { return realNode( GRAPH_DIR_DOWN); } }; #endif /* AUX_EDGE_H */codequery-0.18.1/showgraph/Layout/aux_graph.cpp000066400000000000000000000072251300045745200215500ustar00rootroot00000000000000/** * @file: aux_graph.cpp * Implementation of auxiliary graph * Layout library, 2d graph placement of graphs in ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #include "layout_iface.h" /** Destructor for node */ AuxNode::~AuxNode() { } /** * Default constructor */ AuxGraph::AuxGraph( bool create_pools): Graph( false), ranking_valid( false), levels(), layout_in_process( false) { ranking = newNum(); order = newNum(); watcher = new QFutureWatcher(); /** Pools' creation routine */ if ( create_pools) { node_pool = new FixedPool< AuxNode>(); edge_pool = new FixedPool< AuxEdge>(); } connect( watcher, SIGNAL(finished()), this, SLOT( layoutNextStep())); } /** * Initialize levels */ void AuxGraph::initLevels( Rank max_level) { levels.resize( max_level + 1); for ( Rank i = 0; i <= max_level; i++) { levels[ i] = new Level( i); } } /** * Delete levels */ void AuxGraph::deleteLevels() { for ( int i = 0; i < levels.size(); i++) { delete levels[ i]; } } /** * Destructor. Cleans up level info */ AuxGraph::~AuxGraph() { deleteLevels(); delete watcher; freeNum( ranking); freeNum( order); } /** * Get root node of the graph */ AuxNode* AuxGraph::rootNode() { Level* root_level = levels[ 0]; if( isNullP( root_level) || isNullP( firstNode())) { return firstNode(); } /** Use median heuristic to select root node */ qreal center = 0; foreach ( AuxNode* node, root_level->nodes()) { center = node->modelX() + node->width()/ 2; } center = center / root_level->nodes().count(); AuxNode* prev = NULL; AuxNode* node = NULL; foreach ( node, root_level->nodes()) { if ( center <= node->modelX() + node->width()/ 2) { qreal delta_curr = node->modelX() + node->width()/ 2 - center; if ( isNotNullP( prev) && ( delta_curr > center - prev->modelX() - prev->width()/ 2)) { return prev; } else { return node; } } prev = node; } return firstNode(); }codequery-0.18.1/showgraph/Layout/aux_graph.h000066400000000000000000000226071300045745200212160ustar00rootroot00000000000000/** * @file: aux_graph.h * Layout Graph class * * Graph for performing layouts, consists of dummy nodes. * Layout library, 2d graph placement of graphs in ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * AuxGraph, AuxNode and AuxEdge classes represent auxiliary graph used for layout purposes */ #ifndef AUX_GRAPH_H #define AUX_GRAPH_H #include "layout_iface.h" /** Get first edge in given direction */ inline AuxEdge* AuxNode::firstEdgeInDir( GraphDir dir) { return static_cast< AuxEdge*>( Node::firstEdgeInDir( dir)); } /** Get first successor */ inline AuxEdge* AuxNode::firstSucc() { return firstEdgeInDir( GRAPH_DIR_DOWN); } /** Get first predecessor */ inline AuxEdge* AuxNode::firstPred() { return firstEdgeInDir( GRAPH_DIR_UP); } /** Edge connection reimplementation */ inline void AuxNode::AddEdgeInDir( AuxEdge *edge, GraphDir dir) { Node::AddEdgeInDir( edge, dir); } /** Add predecessor */ inline void AuxNode::AddPred( AuxEdge *edge) { AddEdgeInDir( edge, GRAPH_DIR_UP); } /** Add successor */ inline void AuxNode::AddSucc( AuxEdge *edge) { AddEdgeInDir( edge, GRAPH_DIR_DOWN); } /** * Graph with nodes of two types: simple nodes and edge controls * * @ingroup Layout */ class AuxGraph: public QObject, public Graph { Q_OBJECT; private: /** Layout algorithm inner variables */ bool layout_in_process; int cur_level; //last processed level int cur_pass; // current pass /** Watcher for processing layout in parallel with main event loop */ QFutureWatcher< void> *watcher; /** Array of node lists for ranks */ QVector< Level*> levels; /** Order numeration */ Numeration order; /** Ranking state */ bool ranking_valid; /** Ranking numeration */ Numeration ranking; /** Maximum used for ranking */ GraphNum max_rank; /** * Structure used for dfs traversal loop-wise implementation * Not part of interface used internally */ struct SimpleDfsStepInfo { AuxNode *node; // Node in consideration AuxEdge *edge; // Next edge /* Constructor */ SimpleDfsStepInfo( AuxNode *n) { node = n; edge = n->firstSucc(); } /* Constructor with direction specification */ SimpleDfsStepInfo( AuxNode *n, GraphDir dir) { node = n; edge = n->firstEdgeInDir( dir); } }; /** * Find enters for graph so that * for every node there would exist an enter from wich it is reachable */ QStack< SimpleDfsStepInfo *> findEnterNodes(); /** * Mark nodes that are reachable down from given node */ GraphNum markReachableDown( AuxNode *n, Marker m); /** Initialize levels */ void initLevels( Rank max_level); /** Delete levels */ void deleteLevels(); /** Set order of every node using DFS */ void orderNodesByDFS(); /** Try to reduce crossings */ void reduceCrossings(); /** Find proper vertical position for each level */ void adjustVerticalLevels(); /** Assign ranks to nodes in respect to maximum length of path from top */ Numeration rankNodes(); /** Assign edge types, mark edges that should be inverted */ void classifyEdges(); /** Get numeration that describes ranks in graph */ inline Numeration ranks() const { return ranking; } /** Get max rank number */ inline GraphNum maxRank() const { return max_rank; } protected: /** Create node overload */ virtual Node * createNode( int _id) { return new ( node_pool) AuxNode( this, _id); } /** Create edge overload */ virtual Edge * createEdge( int _id, Node *_pred, Node* _succ) { return new ( edge_pool) AuxEdge( this, _id, static_cast( _pred), static_cast( _succ) ); } /** Get node that is considered root one after the layout */ AuxNode* rootNode(); /** Arrange nodes horizontally */ void arrangeHorizontally(); /** Arrange nodes horizontally without respect of stable nodes */ void arrangeHorizontallyWOStable(); /** Arrange nodes horizontally with respect of stable nodes */ void arrangeHorizontallyWithStable( Rank min, Rank max); public slots: /** Process next level while doing layout in parallel with main event loop */ void layoutNextStep(); signals: /** signal some progess in layout process */ void progressChange( int value); /** signal that layout has finished */ void layoutDone(); public: /** Default constructor */ AuxGraph( bool create_pools); /** Destructor */ virtual ~AuxGraph(); /** Get graph's first edge */ inline AuxEdge* firstEdge() { return static_cast< AuxEdge *>( Graph::firstEdge()); } /** Get graph's first node */ inline AuxNode* firstNode() { return static_cast< AuxNode *>( Graph::firstNode()); } /** Check if ranking is is valid */ inline bool rankingValid() const { return ranking_valid; } /** Set ranking to invalid state */ inline void invalidateRanking() { ranking_valid = false; } /** Set ranking to valid state */ inline void validateRanking() { ranking_valid = true; } /** Debug info print */ virtual void debugPrint() { out( "AuxGraph debug print"); Graph::debugPrint(); } /** Perform layout */ void doLayout(); /** Perform layout using concurrent threads */ void doLayoutConcurrent(); /** * Run some actions after main layout algorithm */ virtual void layoutPostProcess(); }; /** * Representation of rank level * * @ingroup HLayout * A level rpresents a group of nodes that should have same/close vertical position */ class Level { qreal _height; qreal y_pos; Rank level_rank; QList< AuxNode*> node_list; public: /** Default constructor */ inline Level(): level_rank( 0), node_list(), _height( 0), y_pos( 0){}; /** Constructor with rank parameter */ inline Level( Rank r): level_rank( r), node_list(), _height( 0), y_pos( 0){}; /** Arrange nodes with respect to adjacent level*/ void arrangeNodes( GraphDir dir, bool commit_placement, bool first_pass); /** Sort nodes by their order */ void sortNodesByOrder(); /** Get level's rank */ inline Rank rank() const { return level_rank; } /** Set level's rank */ inline void setRank( Rank r) { level_rank = r; } /** Get node list */ inline QList< AuxNode*> nodes() const { return node_list; } /** Add a node to list */ inline void add( AuxNode *node) { node_list.push_back( node); if ( _height < node->height()) _height = node->height(); node->setLevel( this); node->setRank( level_rank); } /** Set level height */ inline void setHeight( qreal h) { _height = h; } /** Get level height */ inline qreal height() const { return _height; } /** Set level vertical position */ inline void setY( qreal yy) { y_pos = yy; } /** Get level vertical pos */ inline qreal y() const { return y_pos; } }; /** Constructors are made private, only nodes and graph can create edges */ inline AuxEdge::AuxEdge( AuxGraph *graph_p, int _id, AuxNode *_pred, AuxNode* _succ): Edge( graph_p, _id, _pred, _succ), priv_fixed( true), priv_type( UNKNOWN_TYPE_EDGE) { if ( _pred == _succ) priv_type = SELF_EDGE; }; /** Constructor for node */ inline AuxNode::AuxNode( AuxGraph *graph_p, int _id): Node( graph_p, _id), priv_x(0), priv_y(0), priv_height(0), priv_width(0), priv_priority(-1), priv_level( NULL), priv_order(-1), node_type( AUX_NODE_SIMPLE), is_for_placement( true), stable( false) { } #endif /** AUX_GRAPH_H */ codequery-0.18.1/showgraph/Layout/aux_node.h000066400000000000000000000207701300045745200210410ustar00rootroot00000000000000/** * @file: aux_node.h * Layout Node class * * Graph for performing layouts, consists of dummy nodes. * Layout library, 2d graph placement of graphs in ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * AuxGraph, AuxNode and AuxEdge classes represent auxiliary graph used for layout purposes */ #ifndef AUX_NODE_H #define AUX_NODE_H /** * Types of a node * * @ingroup Layout */ enum AuxNodeType { /* Simple aux node that represents one node of processed graph */ AUX_NODE_SIMPLE, /* Aux node that represents a control point of edge in processed graph */ AUX_EDGE_CONTROL, /** Aux node that represents an edge label */ AUX_EDGE_LABEL, /* Number of aux node types */ AUX_NODE_TYPES_NUM }; /** * Represents nodes and edge controls in Layout * * @ingroup Layout */ class AuxNode: public Node { double priv_x; double priv_y; double priv_height; double priv_width; qreal barycenter; int priv_priority; Level * priv_level; int priv_order; Rank priv_rank; AuxNodeType node_type; bool is_for_placement; bool stable; public: /** Get next graph's node */ inline AuxNode* nextNode() { return static_cast< AuxNode*>( Node::nextNode()); } /** Get prev graph's node */ inline AuxNode* prevNode() { return static_cast< AuxNode*>( Node::prevNode()); } /** Edge connection reimplementation */ inline void AddEdgeInDir( AuxEdge *edge, GraphDir dir); /** Add predecessor */ inline void AddPred( AuxEdge *edge); /** Add successor */ inline void AddSucc( AuxEdge *edge); /** Get first edge in given direction */ inline AuxEdge* firstEdgeInDir( GraphDir dir); /** Get first successor */ inline AuxEdge* firstSucc(); /** Get first predecessor */ inline AuxEdge* firstPred(); /** Check is node should be 'more stable' during layout process */ inline bool isStable() const { return stable; } /** Set node to be 'more stable' during layout process */ inline void setStable( bool st = true) { stable = st; } /** Get Height */ virtual double height() const { return priv_height; } /** Get Width */ virtual double width() const { return priv_width; } /** Get x coordinate */ inline double modelX() const { return priv_x; } /** Get y coordinate */ inline double modelY() const { return priv_y; } /** Get node's priority */ inline int priority() const { return priv_priority; } /** Get rank */ inline int rank() const { return priv_rank; } /** Get order */ inline int order() const { return priv_order; } /** Set horizontal coordinate */ inline void setX( double x) { priv_x = x; } /** Set vertical coordinate */ inline void setY( double y) { priv_y = y; } /** Get barycenter horizontal coordinate */ inline qreal bc() const { return barycenter; } /** Set barycenter horizontal coordinate */ inline void setBc( qreal center) { barycenter = center; } /** Set Height */ inline void setHeight( double h) { priv_height = h; } /** Set Width */ inline void setWidth( double w) { priv_width = w; } /** Set priority */ inline void setPriority( int p) { priv_priority = p; } /** Set level */ inline void setLevel( Level* l) { priv_level = l; } /** Get level */ inline Level *level() const { return priv_level; } /** Set order */ inline void setOrder( int order) { priv_order = order; } /** Set rank */ inline void setRank( Rank r) { priv_rank = r; } /** Set type */ inline void setType( AuxNodeType t) { node_type = t; } /** Get type */ inline AuxNodeType type() const { return node_type; } /** Check if this node is a simple one */ inline bool isSimple() const { return node_type == AUX_NODE_SIMPLE; } /** Check if this node is an edge control */ inline bool isEdgeControl() const { return node_type == AUX_EDGE_CONTROL; } /** Check if this node is an edge control */ inline bool isEdgeLabel() const { return node_type == AUX_EDGE_LABEL; } /** Check whether node is pseudo */ inline bool isPseudo() const { return isEdgeControl() || isEdgeLabel(); } /** Set node to be an edge control */ inline void setTypeEdgeControl() { node_type = AUX_EDGE_CONTROL; } /** Set node's type to simple */ inline void setTypeSimple() { node_type = AUX_NODE_SIMPLE; } /** Set node's type to simple */ inline void setTypeEdgeLabel() { node_type = AUX_EDGE_LABEL; } /** Check if this node participates in horizontal arrangement */ inline bool isForPlacement() const { return is_for_placement; } /** Set node to participate in horizontal arrangement */ inline void setForPlacement( bool placed = true) { is_for_placement = placed; } /** Print node's debug info */ inline void debugPrint() { switch( node_type) { case AUX_NODE_SIMPLE: out("SIMPLE %llu;", id()); break; case AUX_EDGE_CONTROL: out("EDGE CONTROL %llu;", id()); break; case AUX_EDGE_LABEL: out("EDGE LABEL %llu;", id()); break; default: assert( 0); out("NO_TYPE %llu;", id()); break; } } /** * Return value of spacing between previous and current node due to their types */ inline qreal spacing( AuxNodeType prev_type) const { switch ( prev_type) { case AUX_NODE_SIMPLE: if ( node_type == AUX_NODE_SIMPLE) { return NODE_NODE_MARGIN; } else { return NODE_CONTROL_MARGIN; } case AUX_EDGE_CONTROL: if ( node_type == AUX_NODE_SIMPLE) { return NODE_CONTROL_MARGIN; } else { return CONTROL_CONTROL_MARGIN; } case AUX_EDGE_LABEL: if ( node_type == AUX_NODE_SIMPLE) { return NODE_NODE_MARGIN; } else { return NODE_CONTROL_MARGIN; } case AUX_NODE_TYPES_NUM: return 0; } return NODE_NODE_MARGIN; } /** Destructor */ virtual ~AuxNode(); protected: /** We can't create nodes separately, do it through newNode method of graph */ AuxNode( AuxGraph *graph_p, int _id); friend class AuxGraph; }; #endif /* AUX_NODE_H */codequery-0.18.1/showgraph/Layout/layout.cpp000066400000000000000000000710041300045745200211030ustar00rootroot00000000000000/** * @file: layout.cpp * Layout algorithms implementation file * Layout library, 2d graph placement of graphs in ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #include "layout_iface.h" /** * Arrange nodes in level */ void arrangeLevel( Level *level, GraphDir dir, bool commit_placement, bool first_pass) { level->arrangeNodes( dir, commit_placement, first_pass); } /** * Compare orders of nodes */ bool compareOrders( AuxNode* node1, AuxNode* node2) { return ( node1->order() < node2->order()); } /** * compare center coordinates of group */ bool compareGroups( NodeGroup* g1, NodeGroup* g2) { /* * center = g.left + width / 2 = g.left + ( g.right - g.left) / 2 = ( g.left + g.right)/2 * * g1.center < g2.center * (g1.left + g1.right) / 2 < (g2.left + g2.right) / 2 * g1.left + g1.right < g2.left + g2.right */ if ( g1->nodes().count() == 1 && g1->nodes().count() == 1) { if ( g1->left() + g1->right() == g2->left() + g2->right()) { return g1->nodes().first()->order() < g2->nodes().first()->order(); } } return ( g1->left() + g1->right() < g2->left() + g2->right()); } /** * Sort nodes in a level with respect to their order */ void Level::sortNodesByOrder() { qSort( node_list.begin(), node_list.end(), compareOrders); } /** * Arranges nodes using group merge algorithm. * NodeGroup is a group of nodes which interleave if we apply barycentric heuristic directly. * These nodes are placed within group borders. If two groups interleave they are merged. * Arrangement is performed iteratively starting with groups that have one node each. */ void Level::arrangeNodes( GraphDir dir, bool commit_placement, bool first_pass) { QList< NodeGroup *> list; foreach ( AuxNode* node, node_list) { if ( node->isForPlacement()) { NodeGroup* group = new NodeGroup( node, dir, first_pass); list.push_back( group); } } /** Sort groups with respect to their coordinates */ qSort( list.begin(), list.end(), compareGroups); QLinkedList< NodeGroup *> groups; foreach( NodeGroup *group, list) { groups.push_back( group); } QLinkedList< NodeGroup *>::iterator it = groups.begin(); /** * For each group */ while( groups.count()) { /* * 1. Look at the group to the right and left and see they interleave * if they do -> merge groups and repeat */ NodeGroup* grp = *it; QLinkedList< NodeGroup *>::iterator it_right = it; it_right++; bool no_merge = true; /** Group to the left */ if ( it != groups.begin()) { QLinkedList< NodeGroup *>::iterator it_left = it; it_left--; NodeGroup* left_grp = *it_left; if ( grp->interleaves( left_grp)) { groups.erase( it_left); grp->merge( left_grp); no_merge = false; delete ( left_grp); } } /** Group to the right */ if ( it_right != groups.end()) { NodeGroup* right_grp = *it_right; if ( grp->interleaves( right_grp)) { groups.erase( it_right); grp->merge( right_grp); no_merge = false; delete ( right_grp); } } /** Proceed to the next group */ if ( no_merge) it++; /** End loop if we have processed all groups and merged everything we could */ if ( it == groups.end()) break; } if ( commit_placement) { /** Assign coordinates to nodes */ for ( it = groups.begin(); it != groups.end(); it++) { NodeGroup *grp = *it; grp->placeNodesFinal( dir); delete grp; } } else { /** Assign coordinates to nodes */ for ( it = groups.begin(); it != groups.end(); it++) { NodeGroup *grp = *it; grp->placeNodes(); delete grp; } } } /** * Mark nodes that are reachable in direction GRAPH_DIR_DOWN from given node */ GraphNum AuxGraph::markReachableDown( AuxNode *n, Marker m) { GraphNum marked = 1; QStack< AuxNode *> trav; trav.push( n); n->mark( m); while ( !trav.isEmpty()) { AuxNode *n = trav.pop(); AuxEdge *e; foreachSucc( e, n) { AuxNode* succ = e->succ(); if ( succ->mark( m)) { marked++; trav.push( succ); } } } return marked; } /** * Find enter nodes */ QStack< AuxGraph::SimpleDfsStepInfo *> AuxGraph::findEnterNodes() { QStack< SimpleDfsStepInfo *> stack; Marker m = newMarker(); GraphNum marked = 0; QStack< AuxNode *> trav; /** Find nodes that have no predecessors */ for ( AuxNode *n = firstNode(); isNotNullP( n); n = n->nextNode()) { if ( isNullP( n->firstPred())) { n->mark( m); marked++; stack.push( new SimpleDfsStepInfo( n)); trav.push( n); } else { bool has_valid_pred = false; AuxEdge* e = n->firstPred(); while ( isNotNullP( e)) { if ( areNotEqP( e->pred(),n)) { has_valid_pred = true; break; } e = e->nextPred(); } if ( !has_valid_pred) { n->mark( m); marked++; stack.push( new SimpleDfsStepInfo( n)); trav.push( n); } } } /** Mark nodes from enters */ while ( !trav.isEmpty()) { AuxNode *n = trav.pop(); AuxEdge *e; ForEdges( n, e, Succ) { AuxNode* succ = e->succ(); if ( succ->mark( m)) { marked++; trav.push( succ); } } } /** Check if we're done */ if ( marked == nodeCount()) { freeMarker( m); return stack; } /** Begin traverse from exits */ QStack< SimpleDfsStepInfo *> rev_trav; Marker visited = newMarker(); /* Fill stack with nodes that have no successors */ for ( AuxNode *n = firstNode(); isNotNullP( n); n = n->nextNode()) { bool has_valid_succ = false; if ( n->isMarked( m)) continue; AuxEdge* e = n->firstSucc(); while ( isNotNullP( e)) { if ( !e->succ()->isMarked( m) && areNotEqP( e->succ(),n)) { has_valid_succ = true; break; } e = e->nextSucc(); } if ( !has_valid_succ) { n->mark( m); n->mark( visited); rev_trav.push( new SimpleDfsStepInfo( n, GRAPH_DIR_UP)); } } /** Upward pass */ while( !rev_trav.isEmpty()) { SimpleDfsStepInfo *info = rev_trav.top(); AuxNode *node = info->node; AuxEdge *edge = info->edge; if ( isNotNullP( edge)) // Add predecessor to stack { AuxNode* pred_node = edge->pred(); info->edge = edge->nextPred(); if ( !pred_node->isMarked( m) && pred_node->isMarked( visited)) { //Backedge in reverse traversal terms. Consider edge's predecessor as enter node stack.push( new SimpleDfsStepInfo( edge->succ())); } if ( pred_node->mark( visited)) rev_trav.push( new SimpleDfsStepInfo( pred_node, GRAPH_DIR_UP)); } else // We're done with this node { node->mark( m); marked++; delete info; rev_trav.pop(); } } freeMarker( visited); /** Check if we're done */ if ( marked == nodeCount()) { freeMarker( m); return stack; } /** * If we didn't find all the nodes on previous passes then * they must be in infinite loops without a head so let's break these loops * r a n d o m l y */ for ( AuxNode *n = firstNode(); isNotNullP( n); n = n->nextNode()) { if ( !n->isMarked( m)) { stack.push( new SimpleDfsStepInfo( n)); marked+=markReachableDown( n, m); } } assertd( marked == nodeCount());// FIXME: node count needs updating on node delete freeMarker( m); return stack; } /** * Perform edge classification */ void AuxGraph::classifyEdges() { Marker m = newMarker(); // Marker for visiting nodes Marker doneMarker = newMarker(); // Marker for nodes that are finished AuxEdge* e; foreachEdge ( e, this) { e->setUnknown(); } /* Fill the traverse stack with enter nodes */ QStack< SimpleDfsStepInfo *> stack = findEnterNodes(); foreach ( SimpleDfsStepInfo *info, stack) { info->node->mark( m); } /* Walk graph with marker and perform classification */ while ( !stack.isEmpty()) { SimpleDfsStepInfo *info = stack.top(); AuxNode *node = info->node; AuxEdge *edge = info->edge; if ( isNotNullP( edge)) // Add successor to stack { AuxNode* succ_node = edge->succ(); info->edge = edge->nextSucc(); if ( !succ_node->isMarked( doneMarker) && succ_node->isMarked( m)) { edge->setBack(); AuxNode *pred = edge->pred(); while ( pred->isEdgeLabel()) { pred->firstPred()->setBack(); pred = pred->firstPred()->pred(); } } if ( succ_node->mark( m)) stack.push( new SimpleDfsStepInfo( succ_node)); } else // We're done with this node { node->mark( doneMarker); delete info; stack.pop(); } } freeMarker( m); freeMarker( doneMarker); return; } /** * Ranking of nodes. Level distribution of nodes. Marks tree edges. */ Numeration AuxGraph::rankNodes() { QVector< int> pred_nums( nodeCount()); QStack< AuxNode *> stack; // Node stack invalidateRanking(); Numeration own = newNum(); GraphNum i = 0; max_rank = 0; /** * Set numbers to nodes and count predecessors of each node. * predecessors include inverted edges */ AuxNode *n; foreachNode( n, this) { int pred_num = 0; n->setNumber( own, i); AuxEdge* e; foreachPred( e, n) { if ( e->pred() == e->succ()) continue; if ( !e->isInverted()) pred_num++; } foreachSucc( e, n) { if ( e->pred() == e->succ()) continue; if ( e->isInverted()) pred_num++; } pred_nums[ i] = pred_num; i++; } /* Fill ranking and ordering numerations by walking the nodes */ /* Add nodes with no preds to stack */ foreachNode( n, this) { if ( pred_nums[ n->number( own)] == 0) { stack.push( n); } } while( !stack.isEmpty()) { AuxNode* n = stack.pop(); AuxEdge* e; GraphNum rank = 0; /* Propagation part */ foreachPred( e, n) { if ( e->pred() == e->succ()) continue; if ( !e->isInverted()) { if ( rank < e->pred()->number( ranking) + 1) { rank = e->pred()->number( ranking) + 1; } } } foreachSucc( e, n) { if ( e->pred() == e->succ()) continue; if ( e->isInverted()) { if ( rank < e->succ()->number( ranking) + 1) { rank = e->succ()->number( ranking) + 1; } } } if ( rank > max_rank) max_rank = rank; n->setNumber( ranking, rank); #ifdef _DEBUG out( "%llu node rank is %u", n->id(), rank); #endif //n->setY( rank * RANK_SPACING); /* Traversal continuation */ foreachSucc( e, n) { if ( e->pred() == e->succ()) continue; if ( !e->isInverted()) { AuxNode* succ = e->succ(); pred_nums[ succ->number( own)] = pred_nums[ succ->number( own)] - 1; if ( pred_nums[ succ->number( own)] == 0) { stack.push( succ); } } } foreachPred( e, n) { if ( e->pred() == e->succ()) continue; if ( e->isInverted()) { AuxNode* succ = e->pred(); pred_nums[ succ->number( own)] = pred_nums[ succ->number( own)] - 1; if ( pred_nums[ succ->number( own)] == 0) { stack.push( succ); } } } } freeNum( own); /** Fill levels */ initLevels( maxRank()); foreachNode( n, this) { Rank rank = n->number( ranking); if ( rank == NUMBER_NO_NUM) { rank = 0; assert( 0); // Shouldn't be here. Means ranking did not cover all nodes } levels[ rank]->add( n); } /** Create edge control nodes */ AuxEdge* e; foreachEdge( e, this) { AuxNode* pred; AuxNode* succ; if ( e->pred() == e->succ()) continue; if ( e->isInverted()) { pred = e->succ(); succ = e->pred(); } else { pred = e->pred(); succ = e->succ(); } Rank pred_rank = pred->number( ranking); Rank succ_rank = succ->number( ranking); if ( pred_rank == NUMBER_NO_NUM) { pred_rank = 0; } if ( succ_rank == NUMBER_NO_NUM) { succ_rank = pred_rank + 1; } Rank curr_rank = pred_rank + 1; AuxEdge *curr_edge = e; while ( curr_rank != succ_rank) { AuxNode *node = curr_edge->insertNode(); if ( e->isInverted()) { curr_edge = node->firstPred(); } else { curr_edge = node->firstSucc(); } node->firstSucc()->setType( e->type()); node->setType( AUX_EDGE_CONTROL); node->setY( pred->modelY() + RANK_SPACING); levels[ curr_rank]->add( node); node->setNumber( ranking, curr_rank); pred = node; curr_rank++; } } validateRanking(); #ifdef _DEBUG //debugPrint(); #endif return ranking; } /** * Perform layout */ void AuxGraph::doLayout() { if ( layout_in_process) return; /** * 0. Remove all edge controls * FIXME: This is a stub. we should not delete controls, * instead we should reuse them and create new ones only if necessary */ for ( AuxNode* n = firstNode(); isNotNullP( n); ) { AuxNode *next = n->nextNode(); if ( n->isEdgeControl()) { deleteNode( n); } n = next; } /** 1. Perfrom edge classification */ classifyEdges(); /** 2. Rank nodes */ rankNodes(); /** 3. Adjust levels vertically */ adjustVerticalLevels(); /** 4. Perform edge crossings minimization */ reduceCrossings(); /** 5. Perform horizontal arrangement of nodes */ arrangeHorizontally(); /** 6. Move edge controls to enchance the picture readability */ } /** * Perform layout */ void AuxGraph::doLayoutConcurrent() { if ( layout_in_process) return; /** * 0. Remove all edge controls * FIXME: This is a stub. we should not delete controls, * instead we should reuse them and create new ones only if necessary */ for ( AuxNode* n = firstNode(); isNotNullP( n); ) { AuxNode *next = n->nextNode(); if ( n->isEdgeControl()) { deleteNode( n); } n = next; } /** 1. Perfrom edge classification */ classifyEdges(); /** 2. Rank nodes */ rankNodes(); /** 3. Adjust levels vertically */ adjustVerticalLevels(); /** 4. Perform edge crossings minimization */ reduceCrossings(); /** 5. Perform horizontal arrangement of nodes */ layout_in_process = true; cur_pass = 0; cur_level = 0; layoutNextStep(); /** 6. Move edge controls to enchance the picture readability */ } #define SIMPLE_DFS /** * Check if a node doesn't have any successors ( including inverted predecessors) */ static bool isStartNode( AuxNode *n) { #ifdef SIMPLE_DFS if ( isNotNullP( n->firstSucc())) { return false; } return true; #else AuxEdge *edge = n->firstSucc(); if ( isNullP( edge)) { edge = n->firstPred(); while ( isNotNullP( edge)) { if ( edge->isInverted()) { return false; } edge = edge->nextPred(); } } else { while ( isNotNullP( edge)) { if ( !edge->isInverted()) { return false; } edge = edge->nextSucc(); } if ( isNullP( edge)) { edge = n->firstPred(); while ( isNotNullP( edge)) { if ( edge->isInverted()) { return false; } edge = edge->nextPred(); } } } return true; #endif } /** Structure used for dfs traversal */ struct DfsStepInfo { AuxNode *node; /** Node in consideration */ AuxEdge *edge; /** Next edge */ bool inverted; /** If we have already processed preds and */ #ifdef SIMPLE_DFS /* Constructor */ DfsStepInfo( AuxNode *n) { LAYOUT_ASSERTD( isNotNullP( n), "Null ptr to node in ordering traversal"); node = n; edge = n->firstPred(); inverted = false; } /** Next edge of this node */ void shiftEdge() { LAYOUT_ASSERTD( isNotNullP( edge), "Null ptr to edge in ordering traversal"); edge = edge->nextPred(); } /** Node in direction of traversal */ AuxNode *nodeInDepth() { LAYOUT_ASSERTD( isNotNullP( edge), "Null ptr to edge in ordering traversal"); return edge->pred(); } #else /* Constructor */ DfsStepInfo( AuxNode *n) { LAYOUT_ASSERTD( isNotNullP( n), "Null ptr to node in ordering traversal"); node = n; edge = n->firstPred(); inverted = false; if ( isNullP( edge)) { inverted = true; edge = node->firstSucc(); while ( isNotNullP( edge) && !edge->isInverted()) { edge = edge->nextSucc(); } LAYOUT_ASSERTD( isNullP( edge) || edge->isInverted(), "Should be inverted or null"); } else { while ( isNotNullP( edge) && edge->isInverted()) { edge = edge->nextPred(); } if ( isNullP( edge)) { inverted = true; edge = node->firstSucc(); while ( isNotNullP( edge) && !edge->isInverted()) { edge = edge->nextSucc(); } LAYOUT_ASSERTD( isNullP( edge) || edge->isInverted(), "Should be inverted or null"); } } } /** Next edge of this node */ void shiftEdge() { LAYOUT_ASSERTD( isNotNullP( edge), "Null ptr to edge in ordering traversal"); if ( inverted) { edge = edge->nextSucc(); while ( isNotNullP( edge) && !edge->isInverted()) { edge = edge->nextSucc(); } LAYOUT_ASSERTD( isNullP( edge) || edge->isInverted(), "Should be inverted or null"); } else { edge = edge->nextPred(); while ( isNotNullP( edge) && edge->isInverted()) { edge = edge->nextPred(); } if ( isNullP( edge)) { inverted = true; edge = node->firstSucc(); while ( isNotNullP( edge) && !edge->isInverted()) { edge = edge->nextSucc(); } } } } /** Node in direction of traversal */ AuxNode *nodeInDepth() { LAYOUT_ASSERTD( isNotNullP( edge), "Null ptr to edge in ordering traversal"); if ( edge->isInverted()) { return edge->succ(); } else { return edge->pred(); } } #endif }; /** * Assign order to nodes by numbering in a reverse DFS traversal */ void AuxGraph::orderNodesByDFS() { if ( layout_in_process) return; Marker m = newMarker(); // Marker for visiting nodes QStack< ::DfsStepInfo *> stack; GraphNum num = nodeCount(); /* Fill stack with nodes that have no predecessors */ for ( AuxNode *n = firstNode(); isNotNullP( n); n = n->nextNode()) { if ( isStartNode( n) && !n->isMarked( m)) { //n->setOrder( num++); stack.push( new DfsStepInfo( n)); /* Walk graph with marker and perform classification */ while ( !stack.isEmpty()) { ::DfsStepInfo *info = stack.top(); if ( isNotNullP( info->edge)) // Add successor to stack { AuxNode* pred_node = info->nodeInDepth(); info->shiftEdge(); if ( pred_node->mark( m)) { stack.push( new DfsStepInfo( pred_node)); //pred_node->setOrder( num++); } } else // We're done with this node { info->node->setOrder( num--); delete info; stack.pop(); } } } } freeMarker( m); } /** * Arrange ranks vertically */ void AuxGraph::adjustVerticalLevels() { if ( layout_in_process) return; qreal y = 0; qreal prev_height = 0; for ( int i = 0; i < levels.size(); i++) { Level* level = levels[ i]; y += (prev_height + level->height() + RANK_SPACING) / 2; level->setY( y ); prev_height = level->height(); } } /** * Try to reduce number of edge crossings between levels */ void AuxGraph::reduceCrossings() { if ( layout_in_process) return; /** Perform numeration and sort nodes to avoid tree edges crossings */ orderNodesByDFS(); for ( int i = 0; i < levels.size(); i++) { Level* level = levels[ i]; level->sortNodesByOrder(); } } /** * Assign X coordinates to the nodes */ void AuxGraph::arrangeHorizontallyWOStable() { if ( layout_in_process) return; /* Descending pass */ for ( int i = 0; i < levels.size(); i++) { levels[ i]->arrangeNodes( GRAPH_DIR_DOWN, false, true); } /* Ascending pass */ for ( int i = levels.size() - 1; i >= 0; i--) { levels[ i]->arrangeNodes( GRAPH_DIR_UP, false, false); } /* Final pass */ for ( int i = 0; i < levels.size(); i++) { levels[ i]->arrangeNodes( GRAPH_DIR_DOWN, true, false); } } /** * Arrange with respect to stable nodes */ void AuxGraph::arrangeHorizontallyWithStable( Rank min, Rank max) { /* Descending pass */ for ( int i = min; i < levels.size(); i++) { levels[ i]->arrangeNodes( GRAPH_DIR_DOWN, true, true); } /* Ascending pass */ for ( int i = max; i >= 0; i--) { levels[ i]->arrangeNodes( GRAPH_DIR_UP, true, true); } /* Final pass */ for ( int i = min; i < levels.size(); i++) { //levels[ i]->arrangeNodes( GRAPH_DIR_DOWN, true, false); } } /** * Assign X coordinates to the nodes */ void AuxGraph::arrangeHorizontally() { AuxNode *n; bool with_stable = false; Rank min_stable_rank = this->nodeCount(); Rank max_stable_rank = 0; foreachNode( n, this) { if ( n->isStable()) { with_stable = true; Rank rank = n->number( ranking); if ( rank > max_stable_rank) max_stable_rank = rank; if ( rank < min_stable_rank) min_stable_rank = rank; } } if ( !with_stable) { arrangeHorizontallyWOStable(); } else { arrangeHorizontallyWithStable( min_stable_rank, max_stable_rank); } } /** Empty implementation */ void AuxGraph::layoutPostProcess() { } /** * Next step in concurrent processing of layout */ void AuxGraph::layoutNextStep() { if ( cur_pass) { int progress = 100 * ( (cur_pass - 1) * levels.size() + cur_level) / ( 3 * levels.size()); emit progressChange( progress); } switch ( cur_pass) { case 0:/* prepare data */ cur_level = 0; cur_pass++; case 1:/* Descending pass */ if ( cur_level < levels.size()) { watcher->setFuture( QtConcurrent::run( arrangeLevel, levels[ cur_level], GRAPH_DIR_DOWN, false, true)); cur_level++; break; } else { cur_pass++; cur_level = 0; } case 2:/* Ascending pass */ if ( cur_level < levels.size()) { watcher->setFuture( QtConcurrent::run( arrangeLevel, levels[ cur_level], GRAPH_DIR_UP, false, false)); cur_level++; break; } else { cur_level = 0; cur_pass++; } case 3: if ( cur_level < levels.size()) { watcher->setFuture( QtConcurrent::run( arrangeLevel, levels[ cur_level], GRAPH_DIR_DOWN, true, false)); cur_level++; break; } else { cur_level = 0; cur_pass++; } default: layoutPostProcess(); emit layoutDone(); layout_in_process = false; break; } }codequery-0.18.1/showgraph/Layout/layout_iface.h000066400000000000000000000062031300045745200216760ustar00rootroot00000000000000/** * @file: layout_iface.h * Layout interface * * Layout library, 2d graph placement of graphs in ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * @defgroup Layout 2D Graph layout * @ingroup Core * @page layout Graph layout * Drawing graph on a 2D plane is done via Sugiyama-like algorithm. * Drawing is done in two steps: * - Ranking, wich defines vertical position of every node and inserts * pseudo nodes on edges that span across multiple levels. * - Horizontal placement, wich uses barycenter heuristic to position a node close * to the nodes connected with it on other levels */ #ifndef LAYOUT_IFACE_H #define LAYOUT_IFACE_H class AuxNode; class AuxEdge; class AuxGraph; class Level; #ifdef USE_QT5 #include #include #else #include #endif #include /** Spacing between simple nodes */ const qreal NODE_NODE_MARGIN = 30; /** Spacing between node and edge control */ const qreal NODE_CONTROL_MARGIN = 5; /** Spacing between edge controls */ const qreal CONTROL_CONTROL_MARGIN = 5; /** Edge control width */ const qreal EDGE_CONTROL_WIDTH = 5; /** Edge control height */ const qreal EDGE_CONTROL_HEIGHT = 5; /** Vertical spacing between ranks */ const qreal RANK_SPACING = 40; /** Rank type and its undefined constant */ typedef unsigned int Rank; /** Rank undefined value constant */ const Rank RANK_UNDEF = (Rank) (-1); /** * Debug assert for layout library */ #if !defined(LAYOUT_ASSERTD) # define LAYOUT_ASSERTD(cond, what) ASSERT_XD(cond, "Layout", what) #endif #include "../Graph/graph_iface.h" #include "aux_node.h" #include "aux_edge.h" #include "aux_graph.h" #include "node_group.h" #endif /** LAYOUT_IFACE_H */ codequery-0.18.1/showgraph/Layout/node_group.cpp000066400000000000000000000142571300045745200217360ustar00rootroot00000000000000/** * @file: node_group.cpp * Implementation of node group class * Layout library, 2d graph placement of graphs in ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #include "layout_iface.h" /** * Compare orders of nodes */ bool compareBc( AuxNode* node1, AuxNode* node2) { if ( qFuzzyCompare( node1->bc(), node2->bc())) { return node1->order() < node2->order(); } return ( node1->bc() < node2->bc()); } /** * Constructor of group from a node. * Coordinates are computed with respect to pass direction */ NodeGroup::NodeGroup( AuxNode *n, // Parent node GraphDir dir, // Pass direction bool first_pass) // If this is the first run : node_list() { init(); addNode( n); /** Compute coordinates */ double sum = 0; unsigned int num_peers = 0; /** * On descending pass we compute center coordinate with respect to coordinates of predecessors, * on ascending - we look at successors */ GraphDir rdir = RevDir( dir); for ( AuxEdge* e = n->firstEdgeInDir( rdir); isNotNullP( e); e = e->nextEdgeInDir( rdir)) { if ( !e->isInverted()) { if ( !e->node( rdir)->isForPlacement()) continue; num_peers++; if ( e->node( rdir)->isEdgeLabel()) { sum+= ( e->node( rdir)->modelX()); } else { sum+= ( e->node( rdir)->modelX() + ( e->node( rdir)->width() / 2)); } } } for ( AuxEdge* e = n->firstEdgeInDir( dir); isNotNullP( e); e = e->nextEdgeInDir( dir)) { if ( e->isInverted()) { if ( !e->node( dir)->isForPlacement()) continue; num_peers++; if ( e->node( dir)->isEdgeLabel()) { sum+= ( e->node( dir)->modelX()); } else { sum+= ( e->node( dir)->modelX() + ( e->node( dir)->width() / 2)); } } } /** Barycenter heuristic */ double center = 0; edge_num = 1; if ( num_peers > 0) { edge_num = num_peers; center = sum / num_peers; } else if ( !first_pass) { edge_num = 1; center = n->modelX() + n->width() / 2; } if ( n->isEdgeLabel()) center += ( n->width() / 2); if ( n->isStable()) { center = n->modelX() + n->width() / 2; } n->setBc( center); barycenter = center; border_left = center - n->width() / 2; border_right = center + n->width() / 2; } /** * Merge two groups correcting borders and nodes list of resulting group */ void NodeGroup::merge( NodeGroup *grp) { /** Add nodes from group on the left */ node_list += grp->nodes(); AuxNodeType prev_type = AUX_NODE_TYPES_NUM; /** Recalculate border coordinates */ /* 1. calculate center coordinate */ qreal bc1 = bc(); qreal bc2 = grp->bc(); unsigned int e1 = adjEdgesNum(); unsigned int e2 = grp->adjEdgesNum(); qreal center = ( right() + left()) / 2; center = ( bc1 * e1 + bc2 * e2) / (e1 + e2); /* 2. calculate width */ qreal width = 0; int num = 0; qreal nodes_barycenter = 0; qSort( node_list.begin(), node_list.end(), compareBc); foreach ( AuxNode* node, node_list) { width += node->spacing( prev_type); nodes_barycenter += width + node->width() / 2; width += node->width(); prev_type = node->type(); num++; } nodes_barycenter = nodes_barycenter / num; /* 3. set borders */ setLeft( center - nodes_barycenter); setRight( left() + width); barycenter = center; edge_num = e1 + e2; //out("Width %e, center %e, barycenter %e", width, center, barycenter); } /** * Place nodes withing the group */ void NodeGroup::placeNodes() { AuxNodeType prev_type = AUX_NODE_TYPES_NUM; qreal curr_left = left(); foreach ( AuxNode* node, node_list) { curr_left += node->spacing( prev_type); node->setX( curr_left); curr_left += node->width(); prev_type = node->type(); } } /** * Place nodes withing the group */ void NodeGroup::placeNodesFinal( GraphDir dir) { AuxNodeType prev_type = AUX_NODE_TYPES_NUM; qreal curr_left = left(); //out("Node placement: from %e to %e", left(), right()); foreach ( AuxNode* node, node_list) { //out("Node %d", node->id()); curr_left += node->spacing( prev_type); node->setX( curr_left); curr_left += node->width(); prev_type = node->type(); node->setY( node->level()->y() - node->height() / 2 ); } }codequery-0.18.1/showgraph/Layout/node_group.h000066400000000000000000000100721300045745200213720ustar00rootroot00000000000000/** * @file: node_group.h * Group of nodes * * Layout library, 2d graph placement of graphs in ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * @defgroup HLayout Horizontal placement * @ingroup Layout */ #ifndef NODE_GROUP_H #define NODE_GROUP_H /** * Group of nodes * * Abstraction that aids multiple nodes manipulation inside a level. * * @ingroup HLayout */ class NodeGroup { /** Number of edges in adjacent layer */ unsigned int edge_num; /** Barycenter */ qreal barycenter; /** List of group's nodes */ QList< AuxNode *> node_list; /** Horizontal coordinate of left border */ qreal border_left; /** Horizontal coordinate of right border */ qreal border_right; /** The heuristic weight of the group */ float group_weight; public: /** Initialize attributes of the group */ inline void init() { border_left = 0; border_right = 0; group_weight = 0; } /** Get adjacent number of adjacent edges */ inline unsigned int adjEdgesNum() const { return edge_num; } /** Get barycenter of adjacent edges */ inline qreal bc() const { return barycenter; } /** Get weight */ inline float weight() const { return group_weight; } /** Get left border coordinate */ inline qreal left() const { return border_left; } /** Get right border coordinate */ inline qreal right() const { return border_right; } /** Set left border coordinate */ inline void setLeft( qreal pos) { border_left = pos; } /** Set right border coordinate */ inline void setRight( qreal pos) { border_right = pos; } /** Get node list */ QList nodes() const { return node_list; } /** Add node to list */ inline void addNode( AuxNode *node) { node_list.push_back( node); group_weight += 1; } /** Default constructor */ NodeGroup() : node_list() { init(); } /** Constructor of group from a node */ NodeGroup( AuxNode *n, GraphDir dir, bool first_pass); /** Check if this groups interleaves with the given one */ inline bool interleaves( NodeGroup *grp) const { return !( left() > grp->right() || right() < grp->left()); } /** Merge two groups correcting borders and nodes list of resulting group */ void merge( NodeGroup *grp); /** Place nodes inside group */ void placeNodes(); /** Place nodes and adjust the view */ void placeNodesFinal( GraphDir dir); }; #endifcodequery-0.18.1/showgraph/README.txt000066400000000000000000000036541300045745200173110ustar00rootroot00000000000000 https://github.com/boris-shurygin/showgraph http://code.google.com/p/showgraph/ Showgraph is a simple graph editor/viewer. It allows for creating nodes and connecting them with edges. Nodes have editable labels and edges can be routed using control points. One of primary goals was to create lightweight and easy-to-use tool for fast construction of a graph's visual representation. Showgraph features an auto-layout for directed graphs. Author: Boris Shurygin License: Copyright (c) 2014, Boris Shurygin All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. codequery-0.18.1/showgraph/Utils/000077500000000000000000000000001300045745200167035ustar00rootroot00000000000000codequery-0.18.1/showgraph/Utils/asrt.h000066400000000000000000000062701300045745200200320ustar00rootroot00000000000000/** * @file: asrt.h * Assertion related routines of Utils library for ShowGraph * @defgroup Asserts Assertions * @brief Assertion routines/macros * @ingroup Utils */ /* * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #ifndef ASRT_H #define ASRT_H /** * Assert macro that works only in debug version * @ingroup Asserts */ #if !defined(ASSERTD) # ifdef _DEBUG # define ASSERTD(cond) Q_ASSERT(cond) # else # define ASSERTD(cond) # endif #endif /** * @brief Assert macro with description that works only in debug version * @ingroup Asserts * @param cond The condition * @param where Description of functionality where failure occured * @param what Error message explaining what happened * * Assertion that in case of failure provides additional info about what happened */ #if !defined(ASSERT_XD) # ifdef _DEBUG # define ASSERT_XD(cond, where, what) Q_ASSERT_X(cond, where, what) # else # define ASSERT_XD(cond, where, what) # endif #endif /** * Simple assert macro * @ingroup Asserts */ #if !defined(ASSERT) # define ASSERT(cond) Q_ASSERT(cond) #endif /** * Generic assertion routine template * @ingroup Asserts */ template inline void assert( bool assertion) { if ( !assertion) { throw Excpt(); } } /** * Assertion routine template parameterized with thrown exception type * @ingroup Asserts */ template inline void assert( bool asrt, Excpt e) { if ( !asrt) { throw e; } } /** * Simple assertion routine * @ingroup Asserts */ inline void assert( bool asrt) { assert< int>( asrt); } /** * Assert that works only in debug version * @ingroup Asserts */ inline void assertd( bool asrt) { #ifdef _DEBUG assert< int>( asrt); #endif } #endif /* ASRT_H */ codequery-0.18.1/showgraph/Utils/conf.cpp000066400000000000000000000122731300045745200203410ustar00rootroot00000000000000/** * @file: conf.cpp * Implementation of configuration tools */ /* * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #include "utils_iface.h" #include /** * namespaces import */ using namespace Utils; /** Option's print routine */ void Option::print( QTextStream &stream) { //QTextStream stream( stdout); stream << "-" << short_name << ", " << "--" << long_name << " " << descr << endl; } /** Default constructor of configuration */ Conf::Conf(): short_opts(), long_opts(), unknown_options() { #ifdef _DEBUG /* Debug options */ #endif /* General purpose options */ } /** Print options */ void Conf::printOpts() { QTextStream stream( stdout); foreach( Option *opt, short_opts) { opt->print( stream); } } /** Print value defaults */ void Conf::printDefaults() { } /** Read input arguments */ void Conf::readArgs( int argc, char** argv) { app_name = QString( argv[ 0]); QTextStream err( stderr); for ( int i = 1; i < argc; i++) { QString curr( argv[ i]); QRegExp short_rx("^-([^-]+)"); QRegExp long_rx("^--([^-]+)"); Option *opt = NULL; if ( short_rx.indexIn( curr) != -1 ) { /* We look for expression among short option names */ QString name = short_rx.cap( 1); if ( short_opts.find( name) != short_opts.end()) { opt = short_opts[ name]; } else { err << "No such option " << name << endl; unknown_options.push_back( name); } } else if ( long_rx.indexIn( curr) != -1) { /* We look for expression among long option names */ QString name = long_rx.cap( 1); if ( long_opts.find( name) != long_opts.end()) { opt = long_opts[ name]; } else { err << "No such option " << name << endl; unknown_options.push_back( name); } } else { out("WTF"); /* Is not an option specifier */ err << "Unrecognized argument " << curr << endl; unknown_options.push_back( curr); } if ( isNotNullP( opt)) { OptType tp = opt->type(); opt->setDefined(); // option is defined now switch( tp) { case OPT_BOOL: /* For bool options we expect argument only if its default value is 'true' */ if ( opt->defBoolVal()) { i++; // advance in argument array QString val( argv[ i]); opt->setBoolVal( val.toInt()); } else /* However most bool options have default value of 'false' */ { opt->setBoolVal( true); } break; case OPT_INT: { i++; // advance in argument array QString val( argv[ i]); opt->setIntVal( val.toInt()); break; } case OPT_FLOAT: { i++; // advance in argument array QString val( argv[ i]); opt->setFloatVal( val.toFloat()); break; } case OPT_STRING: { i++; // advance in argument array QString val( argv[ i]); opt->setStringVal( val); break; } default: break; } } } }codequery-0.18.1/showgraph/Utils/conf.h000066400000000000000000000226131300045745200200050ustar00rootroot00000000000000/** * @file: conf.h * Implementation of options configuration of ShowGraph * @defgroup Opts Options * @brief Classes for configuring and parsing command-line options * @ingroup Utils */ /* * Utils library in Showgraph tool * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #ifndef CONF_H #define CONF_H #include #include /** * Command line option type * @ingroup Opts */ enum OptType { /** Boolean */ OPT_BOOL, /** Integer */ OPT_INT, /** Float */ OPT_FLOAT, /** String */ OPT_STRING, /** Number of types */ OPT_TYPES_NUM }; /** * Union type for option's values * @ingroup Opts */ union OptValues { /** Value for boolean option */ bool bool_val; /** Value for integer option */ int int_val; /** Value for floating point option */ qreal float_val; }; /** * Command line option descrition * @ingroup Opts */ class Option { /** Whether user has set value of this option */ bool defined; /** Type */ OptType _type; /** Option default values */ OptValues def_values; /** Option user's values */ OptValues values; QString string_val; /** Short name */ QString short_name; /** Long name */ QString long_name; /** Description */ QString descr; public: /** Constructor without default val */ Option( OptType _t, QString sname, QString lname, QString d): defined( false),_type( _t), short_name( sname), long_name( lname), descr( d) { switch ( _t) { case OPT_BOOL: def_values.bool_val = false; break; case OPT_INT: def_values.int_val = 0; break; case OPT_FLOAT: def_values.float_val = 0; break; case OPT_STRING: default: break; } values = def_values; }; /** Constructor with default bool val */ Option( QString sname, QString lname, QString d, bool val): defined( false), _type( OPT_BOOL), short_name( sname), long_name( lname), descr( d) { def_values.bool_val = val; values = def_values; } /** Constructor for string option */ Option( QString sname, QString lname, QString d): defined( false), _type( OPT_STRING), short_name( sname), long_name( lname), descr( d){}; /** Check if the option was defined */ inline bool isDefined() const { return defined; } /** Set the option to 'defined' state*/ inline void setDefined( bool def = true) { defined = def; } /** Get short name */ inline QString shortName() const { return short_name; } /** Get long name */ inline QString longName() const { return long_name; } /** Get option type */ inline OptType type() const { return _type; } /** Get option default val */ inline bool defBoolVal() const { assertd( _type == OPT_BOOL); return def_values.bool_val; } /** Set option boolean value */ inline void setBoolVal( bool val) { assertd( _type == OPT_BOOL); values.bool_val = val; } /** Set option boolean value */ inline void setIntVal( int val) { assertd( _type == OPT_INT); values.int_val = val; } /** Set option boolean value */ inline void setFloatVal( qreal val) { assertd( _type == OPT_FLOAT); values.float_val = val; } /** Set option boolean value */ inline void setStringVal( QString val) { assertd( _type == OPT_STRING); string_val = val; } /** Get string value of option */ inline QString string() const { assertd( _type == OPT_STRING); return string_val; } /** Get int value of option */ inline int intVal() const { assertd( _type == OPT_INT); return values.int_val; } /** Get float value of option */ inline qreal floatVal() const { assertd( _type == OPT_FLOAT); return values.float_val; } /** Get int value of option */ inline int isSet() const { assertd( _type == OPT_BOOL); return values.bool_val; } /** Print option's synopsis and description */ void print( QTextStream &stream); }; /** * @brief Configuration represention * @ingroup Opts * * @par * Allows for configuring command line options and reading them from C-string array. * Usage example: @code // simple main routine int main( int argc, char **argv) { Conf conf; // Configuring possible options and their type conf.addOption( new Option( OPT_STRING, "f", "file", "input graph description file name")); conf.addOption( new Option( OPT_STRING, "o", "output", "output image file name")); conf.readArgs( argc, argv); //checking options and reading their values if ( conf.longOption("file")->isDefined() && conf.longOption("output")->isDefined()) { QString xmlname = conf.longOption("file")->string(); // read value passed with '-file ...' ... } else { conf.printOpts(); // Print options to console } } @endcode */ class Conf { QString app_name; QHash< QString, Option *> short_opts; QHash< QString, Option *> long_opts; QList< QString> unknown_options; public: /** Constructor */ Conf(); /** Destructor wipes all the options */ ~Conf() { foreach( Option *opt, short_opts) { delete opt; } } /** Get number of arguments that were not recognized */ inline int unknownOptsNum() const { return unknown_options.count(); } /** Add option */ inline void addOption( Option *opt) { short_opts[ opt->shortName()] = opt; long_opts[ opt->longName()] = opt; } /** Convenience routine: adds option without default val */ inline void addOption( OptType _t, QString sname, QString lname, QString d) { Option *opt = new Option( _t, sname, lname, d); addOption( opt); } /** Convenience routine: adds option with default bool val */ inline void addOption( QString sname, QString lname, QString d, bool val) { Option *opt = new Option( sname, lname, d, val); addOption( opt); } /** Convenience routine: adds string option without default value */ inline void addOption( QString sname, QString lname, QString d) { Option *opt = new Option( sname, lname, d); addOption( opt); } /** Print options */ void printOpts(); /** Print value defaults */ void printDefaults(); /** * Parse arguments from C-string * @param argc number of arguments * @param argv pointer to array of C-strings */ void readArgs( int argc, char** argv); /** Get option based on its name */ inline Option* option( QString name) { /* try to look among short options */ if ( short_opts.find( name) != short_opts.end()) { return short_opts[ name]; } /* try to look among long options */ if ( long_opts.find( name) != long_opts.end()) { return long_opts[ name]; } /* if nothing's found return NULL */ return NULL; } /** Get option based on its short name */ inline Option* shortOption( QString name) { /* try to look among short options */ if ( short_opts.find( name) != short_opts.end()) { return short_opts[ name]; } /* if nothing's found return NULL */ return NULL; } /** Get option based on its long name */ inline Option* longOption( QString name) { /* try to look among long options */ if ( long_opts.find( name) != long_opts.end()) { return long_opts[ name]; } /* if nothing's found return NULL */ return NULL; } }; #endifcodequery-0.18.1/showgraph/Utils/conf_utest.cpp000066400000000000000000000063141300045745200215640ustar00rootroot00000000000000/** * @file: conf_utest.cpp * Implementation of testing of configuration */ /* * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #include "utils_iface.h" /** * Test configuration and options parsing */ bool uTestConf() { Conf *conf = new Conf(); /** Create some example options */ conf->addOption( new Option( OPT_STRING, "o", "output", "output file name( string option example)")); conf->addOption( new Option( OPT_BOOL, "b", "boolean", "boolean option example")); conf->addOption( new Option( OPT_INT, "i", "integer", "integer option example")); conf->addOption( new Option( OPT_FLOAT, "f", "float", "float option example")); conf->printOpts(); // Print them to console /** Check that created options can be accessed */ assert( isNullP( conf->option( "file"))); assert( isNotNullP( conf->option("output"))); assert( isNotNullP( conf->shortOption( "o"))); assert( isNullP( conf->shortOption( "output"))); assert( isNotNullP( conf->longOption("output"))); /** Create array of arguments */ char *args[ 8]; args[ 0] = (char*)"string";// treated as app name args[ 1] = (char*)"--output"; args[ 2] = (char*)"file"; args[ 3] = (char*)"-a"; args[ 4] = (char*)"--b"; args[ 5] = (char*)"-b"; args[ 6] = (char*)"-i"; args[ 7] = (char*)"80"; /** Read arguments from array and parse them */ conf->readArgs( 8, args); /** Check options values */ assert( conf->unknownOptsNum() == 2); // Check number of unknown arguments assert( !(conf->option( "output")->string().compare("file"))); Option *int_opt = conf->option( "integer"); assert( int_opt->isDefined()); assert( int_opt->intVal()== 80); assert( conf->option( "b")->isSet()); delete conf; return true; } codequery-0.18.1/showgraph/Utils/list.h000066400000000000000000000415541300045745200200400ustar00rootroot00000000000000/** * @file: list.h * List-related functionality implementation * @defgroup List Two-way linked list * * Implementation of two-way linked list * @ingroup Utils */ /* * Utils library in Showgraph tool * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #ifndef LIST_H #define LIST_H /** * @brief Types of direction in lists. * @ingroup List * * Lists are built from left to right by default. * That means if you take next in default direction - it will be element to the right. */ enum ListDir { /** Right direction */ LIST_DIR_RIGHT = 0, /** Default direction */ LIST_DIR_DEFAULT = LIST_DIR_RIGHT, /** Left Direction */ LIST_DIR_LEFT = 1, /** Direction reverse to default */ LIST_DIR_RDEFAULT = LIST_DIR_LEFT, /** Number of directions */ LIST_DIR_NUM = 2 }; /** * Return direction that is reverse to given one * @ingroup List */ inline ListDir ListRDir( ListDir dir) { assert( LIST_DIR_NUM == 2); return ( dir == LIST_DIR_DEFAULT)? LIST_DIR_RDEFAULT: LIST_DIR_DEFAULT; } /** * @brief Item of two-way connected list of pointers * @ingroup List * * @par * ListItem is used for storing pointers to objects in list. Items in list are two-way connected * with each other. This allows insertion and deletion of items in constant time. */ template class ListItem { ListItem * peer[ LIST_DIR_NUM]; Data *data_p; public: /**Get data */ inline Data *data() const { return data_p; } /** Set data */ inline void setData( Data* d) { data_p = d; } /** Get neighbour */ inline ListItem * GetPeerInDir( ListDir dir) const { return peer[ dir]; } /** Set neighbour */ inline void SetPeerInDir( ListItem *p, ListDir dir) { peer[ dir] = p; } /* Default peers gets */ /** Return next peer in default direction */ inline ListItem *next() const { return GetPeerInDir( LIST_DIR_DEFAULT); } /** Return prev peer in default direction */ inline ListItem* prev() const { return GetPeerInDir( LIST_DIR_RDEFAULT); } /** Set next peer */ inline void SetNext( ListItem *n) { SetPeerInDir( n, LIST_DIR_DEFAULT); } /** Set previous peer */ inline void SetPrev( ListItem *p) { SetPeerInDir( p, LIST_DIR_RDEFAULT); } /** Attach this item to peeer in give direction */ inline void AttachInDir( ListItem* p, ListDir dir) { ListDir rdir = ListRDir( dir); SetPeerInDir( p, dir); SetPeerInDir( NULL, rdir); if ( isNotNullP( p)) { ListItem* rdir_peer = p->GetPeerInDir( rdir); if ( isNotNullP( rdir_peer)) { rdir_peer->SetPeerInDir( this, dir); } p->SetPeerInDir( this, rdir); SetPeerInDir( rdir_peer, rdir); } } /** Attach in default direction */ inline void Attach( ListItem* peer) { AttachInDir( peer, LIST_DIR_DEFAULT); } /** Detach from neighbours */ inline void Detach() { /* Correct links in peers */ if ( isNotNullP( peer[ LIST_DIR_DEFAULT])) { peer[ LIST_DIR_DEFAULT]->SetPeerInDir( peer[ LIST_DIR_RDEFAULT], LIST_DIR_RDEFAULT); } if ( isNotNullP( peer[ LIST_DIR_RDEFAULT])) { peer[ LIST_DIR_RDEFAULT]->SetPeerInDir( peer[ LIST_DIR_DEFAULT], LIST_DIR_DEFAULT); } SetPeerInDir( NULL, LIST_DIR_DEFAULT); SetPeerInDir( NULL, LIST_DIR_RDEFAULT); } /** Default constructor */ ListItem() { setData( NULL); SetPeerInDir( NULL, LIST_DIR_DEFAULT); SetPeerInDir( NULL, LIST_DIR_RDEFAULT); }; /** Constructor from data pointer */ ListItem( Data* d) { setData( d); SetPeerInDir( NULL, LIST_DIR_DEFAULT); SetPeerInDir( NULL, LIST_DIR_RDEFAULT); }; /** Insert element before the given one */ ListItem( ListItem *peer, Data* d) { setData( d); SetPeerInDir( NULL, LIST_DIR_DEFAULT); SetPeerInDir( NULL, LIST_DIR_RDEFAULT); AttachInDir( peer, LIST_DIR_DEFAULT); } /** Insert element in given direction */ ListItem( ListItem *peer, ListDir dir, Data *d) { setData( d); SetPeerInDir( NULL, LIST_DIR_DEFAULT); SetPeerInDir( NULL, LIST_DIR_RDEFAULT); AttachInDir( peer, dir); } /** Destructor */ ~ListItem() { Detach(); } }; /** List number */ typedef quint16 ListId; /** * @brief List item that can be part of multiple lists. * @param dim Number of lists * @ingroup List * * The MListItem class provides means for making an object an item of multiple lists. The * implementation is intrusive: you have to inherit MListItem in your object to make it * a multiple list item. It is more convenient to inherit MListIface though, which in * turn inherits MListItem and provides list-related routines in terms of client type. E.g. * if you implement some MyObj class this way your MyObj::next() routine will return MyObj * instead of * MListItem *. */ template class MListItem { MListItem< dim> * peer[ dim][ LIST_DIR_NUM]; public: /** Get neighbour */ inline MListItem< dim> * peerInDir( ListId list, ListDir dir) const { ASSERTD( list < dim); return peer[ list][ dir]; } /** Set neighbour */ inline void setPeerInDir( ListId list, MListItem< dim> *p, ListDir dir) { ASSERTD( list < dim); peer[list][ dir] = p; } /** Set all pointeers to peeers to zero */ inline void zeroLinks() { for ( ListId list = 0; list < dim; list++) { setPeerInDir( list, NULL, LIST_DIR_DEFAULT); setPeerInDir( list, NULL, LIST_DIR_RDEFAULT); } } /* Default peers gets */ /** Return next peer in default direction */ inline MListItem< dim> *next( ListId list) const { return peerInDir( list, LIST_DIR_DEFAULT); } /** Return prev peer in default direction */ inline MListItem< dim>* prev( ListId list) const { return peerInDir( list, LIST_DIR_RDEFAULT); } /** Set next peer */ inline void setNext( ListId list, MListItem< dim> *n) { setPeerInDir( list, n, LIST_DIR_DEFAULT); } /** Set previous peer */ inline void setPrev( ListId list, MListItem< dim> *p) { setPeerInDir( list, p, LIST_DIR_RDEFAULT); } /** Attach this item to peeer in give direction */ inline void attachInDir( ListId list, MListItem< dim>* p, ListDir dir) { ListDir rdir = ListRDir( dir); setPeerInDir( list, p, dir); setPeerInDir( list, NULL, rdir); if ( isNotNullP( p)) { MListItem< dim>* rdir_peer = p->peerInDir( list, rdir); if ( isNotNullP( rdir_peer)) { rdir_peer->setPeerInDir( list, this, dir); } p->setPeerInDir( list, this, rdir); setPeerInDir( list, rdir_peer, rdir); } } /** Attach in default direction */ inline void attach( ListId list, MListItem< dim>* peer) { attachInDir( list, peer, LIST_DIR_DEFAULT); } /** Detach from neighbours */ inline void detach( ListId list) { ASSERTD( list < dim); /* Correct links in peers */ if ( isNotNullP( peer[ list][ LIST_DIR_DEFAULT])) { peer[ list][ LIST_DIR_DEFAULT]->setPeerInDir( list, peer[ list][ LIST_DIR_RDEFAULT], LIST_DIR_RDEFAULT); } if ( isNotNullP( peer[ list][ LIST_DIR_RDEFAULT])) { peer[ list][ LIST_DIR_RDEFAULT]->setPeerInDir( list, peer[ list][ LIST_DIR_DEFAULT], LIST_DIR_DEFAULT); } setPeerInDir( list, NULL, LIST_DIR_DEFAULT); setPeerInDir( list, NULL, LIST_DIR_RDEFAULT); } /** Detach from all lists */ inline void detachAll() { for ( ListId list = 0; list < dim; list++) { detach( list); } } /** Default constructor */ MListItem() { zeroLinks(); }; /** Insert element before the given one */ MListItem( ListId list, MListItem< dim> *peer) { zeroLinks(); attachInDir( list, peer, LIST_DIR_DEFAULT); } /** Insert element in given direction */ MListItem( ListId list, MListItem< dim> *peer, ListDir dir) { zeroLinks(); attachInDir( list, peer, dir); } /** Destructor */ virtual ~MListItem() { detachAll(); } }; /** * @brief Interface for Multi-list * @ingroup List * @param Item The type of list item * @param ListBase MListItem parameterized by list number or some derived class * @param dim Number of lists * * Allows for incorporating a list item functionality into object via inheritance. * Example: * @code // Define the lists we use enum ListTypes { LIST_ONE, LIST_TWO, LISTS_NUM }; // Derive class of linked objects class MyObj: public MListIface< MyObj, MListItem, LISTS_NUM> { ... }; // Usage void foo() { MyObj obj1(); MyObj obj2(); MyObj obj3(); obj1.attach( LIST_ONE, &obj2); // "LIST_ONE" is now obj1--obj2 obj2.attach( LIST_ONE, &obj3); // "LIST_ONE" is now obj1--obj2--obj3 obj1.attach( LIST_TWO, &obj3); // "LIST_TWO" is now obj1--obj3 } @endcode */ template < class Item, class ListBase, unsigned int dim> class MListIface: public ListBase { public: /** Return next item in default direction */ inline Item *next( ListId list) const { return static_cast< Item *>( MListItem< dim>::next( list)); } /** Return prev item in default direction */ inline Item* prev( ListId list) const { return static_cast< Item *>( MListItem< dim>::prev( list)); } /** Default constructor */ inline MListIface(): ListBase(){}; /** Insert element before the given one */ inline MListIface( ListId list, Item *peer): ListBase( list, peer){}; /** Insert element in given direction */ inline MListIface( ListId list, Item *peer, ListDir dir): ListBase( list, peer, dir){}; }; /** * @brief Specialization of the MListItem template for important case when the object * is intended to be item in only one list. * @ingroup List */ template<> class MListItem<1> { MListItem< 1> * peer[ LIST_DIR_NUM]; /** Get neighbour */ inline MListItem< 1> * peerInDir( ListDir dir) const { return peer[ dir]; } /** Set neighbour */ inline void setPeerInDir( MListItem< 1> *p, ListDir dir) { peer[ dir] = p; } public: /** Set all pointeers to peeers to zero */ inline void zeroLinks() { setPeerInDir( NULL, LIST_DIR_DEFAULT); setPeerInDir( NULL, LIST_DIR_RDEFAULT); } /* Default peers gets */ /** Return next peer in default direction */ inline MListItem< 1> *next() const { return peerInDir( LIST_DIR_DEFAULT); } /** Return prev peer in default direction */ inline MListItem< 1>* prev() const { return peerInDir( LIST_DIR_RDEFAULT); } /** Set next peer */ inline void setNext( MListItem< 1> *n) { setPeerInDir( n, LIST_DIR_DEFAULT); } /** Set previous peer */ inline void setPrev( MListItem< 1> *p) { setPeerInDir( p, LIST_DIR_RDEFAULT); } /** Attach this item to peeer in give direction */ inline void attachInDir( MListItem< 1>* p, ListDir dir) { ListDir rdir = ListRDir( dir); setPeerInDir( p, dir); setPeerInDir( NULL, rdir); if ( isNotNullP( p)) { MListItem< 1>* rdir_peer = p->peerInDir( rdir); if ( isNotNullP( rdir_peer)) { rdir_peer->setPeerInDir( this, dir); } p->setPeerInDir( this, rdir); setPeerInDir( rdir_peer, rdir); } } /** Attach in default direction */ inline void attach( MListItem< 1>* peer) { attachInDir( peer, LIST_DIR_DEFAULT); } /** Detach from neighbours */ inline void detach() { /* Correct links in peers */ if ( isNotNullP( peer[ LIST_DIR_DEFAULT])) { peer[ LIST_DIR_DEFAULT]->setPeerInDir( peer[ LIST_DIR_RDEFAULT], LIST_DIR_RDEFAULT); } if ( isNotNullP( peer[ LIST_DIR_RDEFAULT])) { peer[ LIST_DIR_RDEFAULT]->setPeerInDir( peer[ LIST_DIR_DEFAULT], LIST_DIR_DEFAULT); } setPeerInDir( NULL, LIST_DIR_DEFAULT); setPeerInDir( NULL, LIST_DIR_RDEFAULT); } /** Default constructor */ MListItem() { zeroLinks(); }; /** Insert element before the given one */ MListItem( MListItem< 1> *peer) { zeroLinks(); attachInDir( peer, LIST_DIR_DEFAULT); } /** Insert element in given direction */ MListItem( MListItem< 1> *peer, ListDir dir) { zeroLinks(); attachInDir( peer, dir); } /** Destructor */ virtual ~MListItem() { detach(); } }; /** Short name for simple list item */ typedef MListItem< 1> SListItem; /** * @brief Specialization of MListIface for case of one list * @ingroup List * @param Item The type of list item * @param ListBase MListItem or some derived class * * Allows for incorporating a single-list item functionality into object via inheritance. */ template< class Item, class ListBase> class MListIface< Item, ListBase, 1>: public ListBase { public: /** Return next item in default direction */ inline Item *next() const { return static_cast< Item *>( SListItem::next()); } /** Return prev item in default direction */ inline Item* prev() const { return static_cast< Item *>( SListItem::prev()); } /** Insert element before the given one */ inline MListIface(): ListBase(){}; /** Insert element before the given one */ inline MListIface( Item *peer): ListBase( peer){}; /** Insert element in given direction */ inline MListIface( Item *peer, ListDir dir): ListBase( peer, dir){}; }; /** * @brief Interface for simple list item * @ingroup List * @param Item The type of list item * @param ListBase SListItem (default) or some derived class. * * Allows for incorporating a list item functionality into object via inheritance. * Example: * @code // Derive class of linked objects class MyObj: public SListIface< MyObj> { ... }; // Usage void foo() { MyObj obj1(); MyObj obj2(); MyObj obj3(); obj1.attach( &obj2); // list is now obj1--obj2 obj2.attach( &obj3); // list is now obj1--obj2--obj3 } @endcode */ template< class Item, class ListBase=SListItem> class SListIface: public ListBase { public: /** Return next item in default direction */ inline Item *next() const { return static_cast< Item *>( SListItem::next()); } /** Return prev item in default direction */ inline Item* prev() const { return static_cast< Item *>( SListItem::prev()); } /** Insert element before the given one */ inline SListIface(): ListBase(){}; /** Insert element before the given one */ inline SListIface( Item *peer): ListBase( peer){}; /** Insert element in given direction */ inline SListIface( Item *peer, ListDir dir): SListItem( peer, dir){}; }; #endifcodequery-0.18.1/showgraph/Utils/list_utest.cpp000066400000000000000000000053651300045745200216170ustar00rootroot00000000000000/** * @file: conf_utest.cpp * Implementation of testing for lists */ /* * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #include "utils_iface.h" /** Define the lists we use */ enum ListTypes { LIST_ONE, LIST_TWO, LISTS_NUM }; /** Derive class of linked objects */ class classA: public MListIface< classA, MListItem, LISTS_NUM> { }; /** Derive class from A */ class B: public MListIface< B, classA, LISTS_NUM> { }; /** MList testing */ static bool uTestMList() { B *obj1 = new B(); B *obj2 = new B(); B *obj3 = new B(); obj1->attach( LIST_ONE, obj2); obj1->attach( LIST_TWO, obj3); ASSERT( areEqP( obj1->next( LIST_ONE), obj2)); ASSERT( areEqP( obj1->next( LIST_TWO), obj3)); ASSERT( isNullP( obj1->prev( LIST_ONE))); ASSERT( isNullP( obj1->prev( LIST_TWO))); ASSERT( areEqP( obj2->prev( LIST_ONE), obj1)); ASSERT( areEqP( obj3->prev( LIST_TWO), obj1)); ASSERT( isNullP( obj3->prev( LIST_ONE))); ASSERT( isNullP( obj2->prev( LIST_TWO))); ASSERT( isNullP( obj2->next( LIST_ONE))); ASSERT( isNullP( obj3->next( LIST_TWO))); obj2->detachAll(); delete obj2; delete obj1; delete obj3; return true; } /** * Test list classes operation */ bool uTestList() { if ( !uTestMList()) return false; return true; } codequery-0.18.1/showgraph/Utils/mem.h000066400000000000000000000077151300045745200176440ustar00rootroot00000000000000/** * @file: mem.h * Some experiments with memory manager * @defgroup Mem Memory Manager * * Implementation of memory manager, In Process of Design&Implementation. * * Memory manager should solve the following memory-related problems * - Dangling pointers. Solution: reference counting via smart pointers * - Memory leaks. Solution: Various checks in pools and in pointers * - Fragmentation. Solution: Fixed-sized chunks used in pools * - Poor locality. Solution: not clear yet :( * @ingroup Utils */ /* * Utils library in Showgraph tool * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #pragma once #ifndef MEM_H #define MEM_H #undef CHECK_CHUNKS #undef CHECK_ENTRY #undef USE_REF_COUNTERS #undef USE_MEM_EVENTS #undef CHECK_DELETE #ifdef _DEBUG # define CHECK_CHUNKS # define CHECK_ENTRY # define USE_REF_COUNTERS # define USE_MEM_EVENTS # define CHECK_DELETE #endif #include /** * Debug assert in memory manager * @ingroup Mem */ #if !defined(MEM_ASSERTD) # define MEM_ASSERTD(cond, what) ASSERT_XD(cond, "Memory manager", what) #endif /** * Namespace for memory-related routines * @ingroup Mem */ namespace Mem { /* Class pool predeclaration */ class Pool; } /** * Low level functinality for Mem package * @defgroup MemImpl Memory Manager Low Level * @ingroup Mem */ namespace MemImpl { /* Predeclaration on MemInfo */ class MemInfo; /* Predeclaration of mem entry class */ template < class Data> class Entry; /* Predeclaration of chunk class */ template < class Data> class Chunk; /** * Position in chunk type * @ingroup MemImpl */ typedef quint8 ChunkPos; /** * Max number of entries in chunk * @ingroup MemImpl */ #ifndef MEM_SMALL_CHUNKS const quint8 MAX_CHUNK_ENTRIES_NUM = ( quint8)( -1); #else const quint8 MAX_CHUNK_ENTRIES_NUM = 2; #endif /** * 'NULL' equivalent for ChunkPos * @ingroup MemImpl */ const ChunkPos UNDEF_POS = MAX_CHUNK_ENTRIES_NUM; }; namespace Mem { /** * Singleton for memory manager * @ingroup MemImpl */ typedef Single< MemImpl::MemInfo> MemMgr; }; #include #include "mem_mgr.h" /** Memory manager */ #include "mem_ref.h" /** Memory reference */ #include "mem_obj.h" /** Memory object base class */ #include "mem_chunk.h" /** Memory chunk class */ #include "mem_pool.h" /** Memory pool */ #include "mem_entry.h" /** Memory entry class */ #include "mem_fixed_pool.h" /** Memory pool */ #endif /* MEM_H */ codequery-0.18.1/showgraph/Utils/mem_chunk.h000066400000000000000000000164601300045745200210310ustar00rootroot00000000000000/** * @file: mem_chunk.h * Implementation of memory chunk */ /* * Utils/Mem library in Showgraph tool * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #pragma once #ifndef MEM_H # error #endif #ifndef MEM_CHUNK_H #define MEM_CHUNK_H namespace MemImpl { /** * Chunk lists identificators * @ingroup MemImpl */ enum ChunkListType { CHUNK_LIST_ALL, CHUNK_LIST_FREE, CHUNK_LISTS_NUM }; /** * Memory chunk representation * @ingroup MemImpl */ template class Chunk: public MListIface< Chunk< Data>, // List client data MListItem< CHUNK_LISTS_NUM>, // base class: pure multi-list item CHUNK_LISTS_NUM > // Lists number { void *dummy_ptr; //for alignment /** position of first free entry */ ChunkPos free_entry; /** busy entries num */ ChunkPos busy; /** Get chunk for given number */ inline Entry *entry( ChunkPos pos); public: #ifdef CHECK_CHUNKS void *pool; /** Get chunk's first busy entry */ inline Entry *firstBusyEntry(); #endif /** Constructor */ inline Chunk(); /** Check if this chunk has free entries */ inline bool isFree() const; /** Check if this chunk is empty */ inline bool isEmpty() const; /** Initialization of chunk */ inline void initialize(); /** Allocate on entry */ inline Data *allocateEntry(); /** Deallocate one entry */ inline void deallocateEntry( Entry *e); /** For some reason GCC asks for it :( */ inline void operator delete( void* mem); /** Placement new */ inline void *operator new ( size_t size, void* mem); /** * Operator 'delete' corresponding to placement new * WARNING: Compiler won't call this for deletion. * It is needed for freeing memory in case of exceptions in constructor */ inline void operator delete( void* ptr, void* mem); }; /** Constructor */ template Chunk< Data>::Chunk() { Entry *e = NULL; for ( int i = 0; i < MAX_CHUNK_ENTRIES_NUM; i++) { e = ( Entry< Data> *)( (quint8 *) this + sizeof( Chunk< Data>) + sizeof( Entry< Data>) * i); /** Initialization of every entry */ e->setPos( i); e->setNextFree( i + 1); #ifdef CHECK_ENTRY e->is_busy = false; #endif #ifdef USE_MEM_EVENTS e->alloc_event = 0; e->dealloc_event = 0; #endif } MEM_ASSERTD( e->nextFree() == UNDEF_POS, "Chunk size constant and undefined value do not match"); free_entry = 0; busy = 0; } /** Placement new */ template void* Chunk< Data>::operator new ( size_t size, void* mem) { return mem; } /** For some reason GCC asks for it :( */ template void Chunk< Data>::operator delete( void* mem) { } /** * Operator 'delete' corresponding to placement new * WARNING: Compiler won't call this for deletion. * It is needed for freeing memory in case of exceptions in constructor */ template void Chunk< Data>::operator delete( void* ptr, void* mem) { } /** Get entry by number */ template Entry< Data>* Chunk< Data>::entry( ChunkPos pos) { MEM_ASSERTD( pos != UNDEF_POS, "Requested entry with undefined number"); return ( Entry< Data> *)( (quint8 *) this + sizeof( Chunk< Data>) + sizeof( Entry< Data>) * pos); } #ifdef CHECK_CHUNKS /** Get chunk's first busy entry */ template Entry< Data>* Chunk< Data>::firstBusyEntry() { Entry *e = NULL; for ( int i = 0; i < MAX_CHUNK_ENTRIES_NUM; i++) { e = ( Entry< Data> *)( (quint8 *) this + sizeof( Chunk< Data>) + sizeof( Entry< Data>) * i); if ( e->is_busy) return e; } return NULL; } #endif /** Check if this chunk has free entries */ template bool Chunk< Data>::isFree() const { return free_entry != UNDEF_POS; } /** Check if this chunk is empty */ template bool Chunk< Data>::isEmpty() const { return busy == 0; } /** Allocate one entry */ template Data* Chunk< Data>::allocateEntry() { MEM_ASSERTD( this->isFree(), "Trying to allocated entry in a full chunk"); Entry< Data> *e = entry( free_entry); #ifdef CHECK_ENTRY e->is_busy = true; #endif #ifdef USE_MEM_EVENTS e->alloc_event = Mem::MemMgr::instance()->allocEvent(); #endif Data *res = static_cast( e); free_entry = e->nextFree(); busy++; return res; } /** Deallocate one entry */ template void Chunk< Data>::deallocateEntry( Entry *e) { MEM_ASSERTD( busy > 0, "Trying to deallocate entry of an empty chunk"); #ifdef CHECK_ENTRY MEM_ASSERTD( e->is_busy, "Trying to deallocate entry that is free. Check deallocation event ID"); e->is_busy = false; #endif #ifdef USE_MEM_EVENTS e->dealloc_event = Mem::MemMgr::instance()->deallocEvent(); #endif e->setNextFree( free_entry); free_entry = e->pos(); busy--; } }; /* namespace MemImpl */ #endif /* MEM_CHUNK_H */codequery-0.18.1/showgraph/Utils/mem_entry.h000066400000000000000000000074331300045745200210620ustar00rootroot00000000000000/** * @file: mem_entry.h * Implementation of memory entry */ /* * Utils/Mem library in Showgraph tool * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #pragma once #ifndef MEM_H # error #endif #ifndef MEM_ENTRY_H #define MEM_ENTRY_H namespace MemImpl { /** * Entry in memory that holds user data * * @ingroup MemImpl */ template < class Data> class Entry: private Data { public: /** Get position */ inline ChunkPos pos() const; /** Get position of next free chunk */ inline ChunkPos nextFree() const; /** Set position */ inline void setPos( ChunkPos pos); /** Set position of next free chunk */ inline void setNextFree( ChunkPos next); private: /** Classes fixed pool and chunk should have access to data and constructors */ friend class Chunk; /** Own position of this entry in chunk */ ChunkPos my_pos; /** Position of next free entry in chunk */ ChunkPos next_free_pos; #ifdef CHECK_ENTRY /** Debug info: entry status */ bool is_busy; #endif #ifdef USE_MEM_EVENTS /** Debug info: alloc event */ MemEventId alloc_event; /** Debug info: dealloc event */ MemEventId dealloc_event; #endif /** Private constructor to prevent direct creation of such objects */ Entry(); /** Private destructor */ ~Entry(); }; /** * Private constructor to prevent direct creation of such objects */ template< class Data> Entry< Data>::Entry() { assert( 0); } /** * Private destructor */ template< class Data> Entry< Data>::~Entry() { assert( 0); } /** Get position */ template< class Data> ChunkPos Entry< Data>::pos() const { return my_pos; } /** Get position of next free chunk */ template< class Data> ChunkPos Entry< Data>::nextFree() const { return next_free_pos; } /** Set position */ template< class Data> void Entry< Data>::setPos( ChunkPos pos) { my_pos = pos; } /** Set position of next free chunk */ template< class Data> void Entry< Data>::setNextFree( ChunkPos next) { next_free_pos = next; } }; #endif /* MEM_ENTRY_H */codequery-0.18.1/showgraph/Utils/mem_fixed_pool.h000066400000000000000000000305141300045745200220450ustar00rootroot00000000000000/** * @file: mem_fixed_pool.h * Implementation of memory pool with fixed entry size */ /* * Utils library in Showgraph tool * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #pragma once #ifndef MEM_H # error #endif #ifndef MEM_FIXED_POOL_H #define MEM_FIXED_POOL_H namespace Mem { /** * @brief Memory pool with fixed-size entries. * @ingroup Mem * @param Data Type of objects stored in pool. * * @details * A Fixed pool is a pool that creates entries of the same size which * is defined by template parameter. It uses the knowledge of the entry size for * optimization of allocation/deallocation process and for simplifying the internal * bookkeeping. This simplification significantly speeds up pool's operation. * * Internal implementation of a fixed pool is based on allocating memory in so-called * chunks. A chunk is a continuous block of memory which holds * a number of entries and is allocated with one system call. The allocated memory * is managed by the pool and released to system when pool doesn't need it. This * policy effectively avoids calling malloc() and free() routines for every entry * and prevents fragmentation. FixedPool internal implementattion trades off compactness * for quickness and uses additional info for every entry. Every entry keeps: * - Its own number. To calculate pointer to chunk info from pointer to entry. * - Number of next free entry in this chunk. For speeding up the allocation. * - Debug info like allocation/deallocation event number or ``free'' flag for checking * double deallocation. * * The chunks are organized in doubly-liked list to have constant time for chunk * creation and destruction. Free chunks are also linked in list to speed up the * allocation. On allocation request pool simply gets its first free chunk and * returns pointer to its first entry. On deallocation, pointer to chunk is calculated * from pointer to entry using its own number and entry is simply connected to the * head of free entry list in the chunk. The chunk itself is enrolled in the list of * free chunks if it isn't already there. If the chunk is completely empty after * this deallocation it may be deleted if there are other free chunks present. Both * allocation and deallocation demand constant time unless we have to allocate a new * chunk or free existing empty one. * * To decrease memory usage overhead the numbers in entries are effectively one byte long. * Thats two byte per entry overhead if we don't align entries on 8, 16, 32 or 64 bytes. * Thus memory overhead is significant if we store small objects in such a pool but for * a list unit this overhead is about 25% and for graph's node or edge it is 6.2%. * * When project is built in debug mode the pools keep track of every entry's allocation * and deallocation ID. This allows programmer to put in a breakpoint if a memory leak * or double-delete occurred. The conditional breakpoint should be placed in * MemInfo::allocReg( n) or MemInfo::deallocReg( n) where 'n' should be the ID that * can be obtained from suspicious entry. */ template < class Data> class FixedPool: public Pool { static const size_t CHUNK_SIZE = sizeof( MemImpl::Chunk< Data>) + sizeof( MemImpl::Entry< Data>) * MemImpl::MAX_CHUNK_ENTRIES_NUM; public: /** Create fixed pool with default parameters */ FixedPool(); /** Destroy the pool */ ~FixedPool(); /** Allocate new memory block */ void* allocate( size_t size); /** Free memory block */ void deallocate( void *ptr); /** Functionality of 'operator delete' for pooled objects */ void destroy( void *ptr); #ifdef _DEBUG /** Get first busy chunk */ inline MemImpl::Chunk< Data> *firstBusyChunk(); #endif private: /** Number of used entries */ EntryNum entry_count; /** First chunk */ MemImpl::Chunk< Data> *first_chunk; /** First free chunk */ MemImpl::Chunk< Data> *free_chunk; /* Internal routines */ /** Allocate one chunk */ inline MemImpl::Chunk< Data> *allocateChunk(); /** Deallocate one chunk */ inline void deallocateChunk( MemImpl::Chunk< Data> *chunk); /** Get pointer to chunk from pointer to entry */ inline MemImpl::Chunk< Data> *entryChunk( MemImpl::Entry< Data> *e); }; /** Create fixed pool with default parameters */ template < class Data> FixedPool::FixedPool(): entry_count( 0), first_chunk( NULL), free_chunk( NULL) { } /** Destroy the pool */ template < class Data> FixedPool< Data>::~FixedPool() { /** Deallocated cached chunks */ while ( isNotNullP( first_chunk)) { deallocateChunk( first_chunk); } /** Check that all entries are freed */ MEM_ASSERTD( entry_count == 0, "Trying to delete non-empty pool"); } #ifdef _DEBUG /** Get first busy chunk */ template < class Data> MemImpl::Chunk< Data> * FixedPool< Data>::firstBusyChunk() { MemImpl::Chunk< Data> *chunk = first_chunk; while ( isNotNullP( chunk)) { if ( !chunk->isEmpty()) return chunk; chunk = chunk->next( MemImpl::CHUNK_LIST_ALL); } return NULL; } #endif /** Allocate one chunk */ template < class Data> MemImpl::Chunk< Data> * FixedPool< Data>::allocateChunk() { /* We should only allocate chunk if there are no free chunks left */ MEM_ASSERTD( isNullP( free_chunk ), "Tried to deallocate chunk while there is a free chunk"); /* Allocate memory for chunk */ void *chunk_mem = ( MemImpl::Chunk< Data> *) new quint8[ CHUNK_SIZE]; MemImpl::Chunk< Data> * chunk = new ( chunk_mem) MemImpl::Chunk< Data>(); /* Add this chunk to pool */ chunk->attach( MemImpl::CHUNK_LIST_ALL, first_chunk); chunk->attach( MemImpl::CHUNK_LIST_FREE, free_chunk); first_chunk = chunk; free_chunk = chunk; #ifdef CHECK_CHUNKS chunk->pool = ( void *)this; #endif return chunk; } /** Deallocate one chunk */ template < class Data> void FixedPool::deallocateChunk( MemImpl::Chunk< Data> *chunk) { #ifdef CHECK_CHUNKS if ( !chunk->isEmpty()) { MEM_ASSERTD( isNotNullP( chunk->firstBusyEntry()), "Can't get first busy entry of non-empty chunk"); MEM_ASSERTD( 0, "Deallocated chunk is not empty. Check allocation ID of some busy entry"); } MEM_ASSERTD( areEqP( chunk->pool, this), "Deallocated chunk does not belong to this pool"); #endif if ( areEqP( first_chunk, chunk)) { first_chunk = chunk->next( MemImpl::CHUNK_LIST_ALL); } chunk->~Chunk(); delete[] (quint8 *)chunk; } /* Calculate pointer to chunk from pointer to entry */ template < class Data> MemImpl::Chunk< Data> * FixedPool::entryChunk( MemImpl::Entry< Data> *e) { MemImpl::ChunkPos e_pos = e->pos(); quint8 *ptr = ( quint8 *) e; ptr = ptr - sizeof( MemImpl::Entry< Data>) * e_pos - sizeof ( MemImpl::Chunk< Data>); return (MemImpl::Chunk< Data> *) ptr; } /* Allocate new memory block */ template < class Data> void* FixedPool::allocate( size_t size) { MEM_ASSERTD( sizeof( Data) == size, "Allocation size doesn't match FixedPool's template parameter size"); void *ptr = NULL; /* If we don't have a free chunk */ if ( isNullP( free_chunk)) { /* We need to create new chunk */ allocateChunk(); } MEM_ASSERTD( free_chunk->isFree(), "Pool's first free chunk is not free"); /* allocate one entry */ ptr = ( void *)free_chunk->allocateEntry(); /* if no more entries left */ if ( !free_chunk->isFree()) { MemImpl::Chunk< Data> *chunk = free_chunk; free_chunk = chunk->next( MemImpl::CHUNK_LIST_FREE); chunk->detach( MemImpl::CHUNK_LIST_FREE); } entry_count++; return ptr; } /** Free memory block */ template < class Data> void FixedPool::deallocate( void *ptr) { /* 1. Check pointer */ MEM_ASSERTD( isNotNullP( ptr), "Deallocation tried on NULL pointer"); /* 2. Check entry count */ MEM_ASSERTD( entry_count > 0, "Trying deallocate entry of an empty pool"); MemImpl::Entry< Data> *e =(MemImpl::Entry< Data> *) ptr; /* 3. Get chunk of the deallocated entry */ MemImpl::Chunk< Data> *chunk = entryChunk( e); #ifdef CHECK_CHUNKS /* 4. Check that we are deleting entry from this pool */ MEM_ASSERTD( areEqP( this, chunk->pool), "Trying deallocate entry from a wrong pool"); #endif /* * 5. If chunk is free already - it must be in free list * no need to add it again */ bool add_to_free_list = !chunk->isFree(); /* 6. Free entry in chunk */ chunk->deallocateEntry( e); /* * 7. If this chunk is not the same as the current 'free chunk' * add it to free list or deallocate it if it is empty */ if ( areNotEqP( chunk, free_chunk)) { if ( add_to_free_list) { /* Add chunk to free list if it is not already there */ chunk->attach( MemImpl::CHUNK_LIST_FREE, free_chunk); /* Deallocate previous free chunk if it is empty */ if ( isNotNullP( free_chunk) && free_chunk->isEmpty()) { deallocateChunk( free_chunk); } free_chunk = chunk; } else if ( chunk->isEmpty()) { /* Deallocate this chunk if it is empty and not the first free chunk */ deallocateChunk( chunk); } } entry_count--; } /** Functionality of 'operator delete' for pooled objects */ template < class Data> void FixedPool::destroy( void *ptr) { /* 1. Check null pointer( in DEBUG mode) */ MEM_ASSERTD( isNotNullP( ptr), "Destruction tried on NULL pointer"); Data *data_p = static_cast< Data *>( ptr); #ifdef CHECK_DELETE /* 2. Mark for deletion */ data_p->toBeDeleted(); #endif /* 3. Call destructor */ data_p->~Data(); /* 4. Free memory */ deallocate( ptr); } }; /* namespace Mem */ #endif /* MEM_FIXED_POOL_H */codequery-0.18.1/showgraph/Utils/mem_mgr.cpp000066400000000000000000000044321300045745200210350ustar00rootroot00000000000000/** * @file: mem_mgr.cpp * Implementation of memory manager */ /* * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #include "utils_iface.h" #include "mem.h" using namespace MemImpl; MemInfo::MemInfo() { alloc_counter = 1; dealloc_counter = 1; } /** Place for breakpoint on event number */ void MemInfo::allocReg( MemEventId n) { } /** Place for breakpoint on event number */ void MemInfo::deallocReg( MemEventId n) { } /** Registers the allocation event and returns its number */ MemEventId MemInfo::allocEvent() { /** Increase counter */ alloc_counter++; allocReg( alloc_counter); return alloc_counter; } /** Registers the deallocation event and returns its number */ MemEventId MemInfo::deallocEvent() { /** Increase counter */ dealloc_counter++; deallocReg( dealloc_counter); return dealloc_counter; } codequery-0.18.1/showgraph/Utils/mem_mgr.h000066400000000000000000000054141300045745200205030ustar00rootroot00000000000000/** * @file: asrt.h * Definition of memory manager class. Utils library in ShowGraph. */ /* * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #ifndef MEM_MGR_H #define MEM_MGR_H namespace MemImpl { /** * Event id type * @ingroup MemImpl */ typedef quint64 MemEventId; /** * Memory manager implementation * @ingroup MemImpl */ class MemInfo { public: /** Registers the allocation event and returns its number */ MemEventId allocEvent(); /** Registers the deallocation event and returns its number */ MemEventId deallocEvent(); private: /** Registers the allocation event - place for breakpoints */ void allocReg( MemEventId n); /** Registers the deallocation event - place for breakpoints */ void deallocReg( MemEventId n); /** Counter for allocation events */ MemEventId alloc_counter; /** Counter for deallocation event */ MemEventId dealloc_counter; /** private constructors, assignment and destructor */ MemInfo(); MemInfo( const MemInfo&){}; MemInfo& operator =( const MemInfo&){return *this;} ~MemInfo(){}; /** Needed for singleton creation */ friend class Single< MemImpl::MemInfo>; }; }; #endif /* MEM_MGR_H */ codequery-0.18.1/showgraph/Utils/mem_obj.h000066400000000000000000000054551300045745200204750ustar00rootroot00000000000000/** * @file: mem_obj.h * Implementation of memory object base class */ /* * Utils library in Showgraph tool * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #pragma once #ifndef MEM_H # error #endif #ifndef MEM_OBJ_H #define MEM_OBJ_H /** * Namespace for memory manager * @ingroup Mem */ namespace Mem { /** Type of reference count */ typedef unsigned int RefNumber; /** * Base class for all memory-managed objects * @ingroup Mem */ class Obj { private: /** Pointer to pool */ Pool *_pool; #ifdef USE_REF_COUNTERS private: /** Counter for references */ RefNumber ref_count; /* Additional memory used, the overhead of counted references */ public: /** Get the number of references */ inline RefNumber refCount() const { return ref_count; } /** Increase reference count */ inline void incRefCount() { ref_count++; } /** Decrease reference count */ inline void decRefCount() { assertd( ref_count > 0); ref_count--; } #endif public: /** Get pointer to pool */ inline Pool* pool() const { return _pool; } /** Constructor */ inline Obj() #ifdef USE_REF_COUNTERS :ref_count( 0) #endif { } /** Destructor */ ~Obj() { #ifdef USE_REF_COUNTERS assertd( ref_count == 0); #endif } }; }; #endif /** MEM_OBJ_H */codequery-0.18.1/showgraph/Utils/mem_pool.cpp000066400000000000000000000041701300045745200212200ustar00rootroot00000000000000/** * @file: mem_pool.cpp * Implementation of memory pool */ /* * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #include "utils_iface.h" using namespace Mem; /** * Default operator 'new' is disabled */ void * PoolObj::operator new( size_t size) { ASSERT( 0); #ifdef _MSC_VER return NULL; #endif } /** * Default operator 'delete' is disabled */ void PoolObj::operator delete( void *ptr) { ASSERT( 0); } /** * Default operator 'new[]' is disabled */ void * PoolObj::operator new[]( size_t size) { ASSERT( 0); #ifdef _MSC_VER return NULL; #endif } /** * Default operator 'delete[]' is disabled */ void PoolObj::operator delete[]( void *ptr) { ASSERT( 0); } codequery-0.18.1/showgraph/Utils/mem_pool.h000066400000000000000000000116371300045745200206730ustar00rootroot00000000000000/** * @file: mem_pool.h * Implementation of memory pool */ /* * Utils library in Showgraph tool * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #pragma once #ifndef MEM_H # error #endif #ifndef MEM_POOL_H #define MEM_POOL_H namespace Mem { /** * Type for memory entry size * @ingroup Mem */ typedef quint32 EntrySize; /** * Type for number of memory entries * @ingroup Mem */ typedef quint32 EntryNum; /** * Pool types * @ingroup Mem */ enum PoolType { /** Fixed-size entry pool */ POOL_FIXED, /** Float-size entry pool */ POOL_FLOAT, /** Number of types */ POOL_TYPES_NUM }; /** * Base class for memory pools * * @ingroup Mem */ class Pool { public: /** Allocate new memory block */ virtual void* allocate( size_t size) = 0; /** Free memory block */ virtual void deallocate( void *ptr) = 0; /** Functionality of 'operator delete' for pooled objects */ virtual void destroy( void *ptr) = 0; /** Destructor */ virtual ~Pool(){}; }; /** * Base class for all objects allocated in pools * * @ingroup Mem */ class PoolObj { #ifdef CHECK_DELETE bool to_be_deleted; #endif /** Copy constructor disabled*/ PoolObj( PoolObj &obj){}; /** Assignment disabled */ PoolObj& operator = ( const PoolObj& obj){ return *this;}; public: #ifdef CHECK_DELETE /** Default constructor */ PoolObj(): to_be_deleted( false){}; /** Mark for deletion */ inline void toBeDeleted() { MEM_ASSERTD( !to_be_deleted, "Tried to mark object for deletion more than once"); to_be_deleted = true; } #else /** Default constructor */ inline PoolObj(){}; #endif /** Default operator 'new' is disabled */ void *operator new ( size_t size); /** Default operator 'delete' is disabled */ void operator delete( void *ptr); /** Default operator 'new' is disabled */ void *operator new[] ( size_t size); /** Default operator 'delete' is disabled */ void operator delete[] ( void *ptr); /** Placement new */ inline void *operator new ( size_t size, Pool* pool); /** * Operator 'delete' corresponding to placement new * WARNING: Compiler won't call this for deletion. * It is needed for freeing memory in case of exceptions in constructor */ inline void operator delete( void *ptr, Pool* pool); /** Destructor is to be called by 'destroy' routine of pool class */ virtual ~PoolObj() { #ifdef CHECK_DELETE MEM_ASSERTD( to_be_deleted, "Deleted pool object not through pool interface. Probably operator delete used."); #endif } }; /** * Placement new */ inline void * PoolObj::operator new ( size_t size, Pool* pool) { return pool->allocate( size); } /** * Operator 'delete' corresponding to placement new * WARNING: Compiler won't call this for deletion. * It is needed for freeing memory in case of exceptions in constructor */ inline void PoolObj::operator delete( void *ptr, Pool* pool) { pool->deallocate( ptr); } }; /* namespace Mem */ #endif /* MEM_POOL_H */codequery-0.18.1/showgraph/Utils/mem_ref.h000066400000000000000000000073551300045745200205000ustar00rootroot00000000000000/** * @file: mem_ref.h * Implementation of memory reference template */ /* * Utils library in Showgraph tool * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #pragma once #ifndef MEM_H # error #endif #ifndef MEM_REF_H #define MEM_REF_H namespace Mem { /** * Memory reference template * @ingroup Mem */ template < class RefObj> class Ref { #ifdef USE_REF_COUNTERS #endif private: RefObj *ptr; public: /** Default constructor */ Ref(): ptr( NULL){}; /** Copy constructor !!! NO uTEST !!! */ Ref( const Ref< RefObj>& orig): ptr( orig.ptr) { #ifdef USE_REF_COUNTERS ptr->incRefCount(); #endif } /** Assignement operator overloading */ Ref< RefObj> & operator=( const Ref< RefObj>& orig) { ptr = orig.ptr; #ifdef USE_REF_COUNTERS ptr->incRefCount(); #endif return *this; } /** * Constructor from pointer * Used in Ref ref = new Obj(...) initialization * !!! No uTEST !!! */ Ref( RefObj* p): ptr( p) { #ifdef USE_REF_COUNTERS if ( ptr != 0) ptr->incRefCount(); #endif } /** * Assignement of pointer * Used in Ref ref; ref = new Obj(...) expression */ Ref< RefObj> & operator=( RefObj* p) { #ifdef USE_REF_COUNTERS /** Decrement object's ref count */ if ( ptr != 0) ptr->decRefCount(); #endif /** Assign a new pointer */ ptr = p; #ifdef USE_REF_COUNTERS /** Increment ref count */ if ( ptr != 0) ptr->incRefCount(); #endif return *this; } /** Destructor */ ~Ref() { #ifdef USE_REF_COUNTERS if ( ptr != 0) ptr->decRefCount(); #endif } /** Member access operator */ inline RefObj* operator->() { return ptr; } /** Equals operator */ inline bool operator == ( Ref< RefObj> &r) { return ptr == r.ptr; } /** Conversion to boolean */ inline operator bool() { return ptr != NULL; } /** * Conversion to Pointer * For using ref as delete operator argument. * Use in other expressions is prohibited. Unfortunatelly this is not ( can't be?) enforced. */ inline operator RefObj*() { RefObj *ret_val = ptr; assertd( ret_val != NULL); /** Decrement object's ref count */ if ( ptr != 0) { #ifdef USE_REF_COUNTERS ptr->decRefCount(); #endif ptr = 0; } return ret_val; } }; }; #endif /* MEM_REF_H */codequery-0.18.1/showgraph/Utils/mem_utest.cpp000066400000000000000000000117771300045745200214260ustar00rootroot00000000000000/** * @file: mem_utest.cpp * Implementation of testing of memory manager */ /* * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #include "utils_iface.h" #include "mem.h" using namespace Mem; /** Test object class */ class TestObj: public Obj { public: /** Some variable */ int a; }; /** * Reference to object */ typedef Ref< TestObj> ObjRef; /** * Test smart pointers */ static bool uTestRef() { /** #Test smart pointers behaviour */ ObjRef ref = new TestObj(); /** Test constructor from pointer */ ObjRef ref2; /** Test default constructor */ /** Test operator bool() */ assertd( !ref2 && ref); //assertd( ref2 == NULL && ref != NULL); assertd( ref2 == 0 && ref != 0); /** Test copy constructor */ ref2 = ref; assertd( ref2 && ref); /** Test operator == ( ref) */ assertd( ref == ref2); /** Test operator -> */ ref->a = 2; #ifdef USE_REF_COUNTERS assertd( ref->refCount() == 2); #endif bool catched = false; /** Test exception generation */ try { delete ref; } catch( int a) { catched = true; ref2->a = a; } assertd( catched); /** Test ref to pointer conversion and Obj destructor */ delete ref2; return true; } /** Sample object used as a baseclass for more complicated pool-stored objects */ class PoolBase: public PoolObj { virtual void setVal( quint32 val) = 0; virtual quint32 val() const = 0; }; /** * @brief Fairly complex pool-stored object * Class for testing complex objects stored in pool. Built with * multiple inheritance, virtual functions and additional members. */ class MyPoolObj: public PoolBase, public SListIface< MyPoolObj, SListItem> { quint32 priv_field; public: /** Some public fields */ quint32 a; quint32 b; bool *called; /** Base class routines implementation */ void setVal( quint32 val) { priv_field = val; } quint32 val() const { return priv_field; } ~MyPoolObj() { *called = true; } }; /** * Test memory pools */ static bool uTestPools() { Pool *pool = new FixedPool< MyPoolObj>(); MyPoolObj *p1 = new ( pool) MyPoolObj(); MyPoolObj *p2 = new ( pool) MyPoolObj(); bool called_destructor1 = false; bool called_destructor2 = false; ASSERT( p1 != p2); p1->a = 1; p2->a = 2; p1->b = 3; p2->b = 4; p1->called = &called_destructor1; p2->called = &called_destructor2; p1->setVal( 5); p2->setVal( 6); ASSERT( p1->a != p1->b); ASSERT( p1->a != p2->a); ASSERT( p1->b != p2->a); ASSERT( p1->b != p2->b); ASSERT( p1->a != p2->a); ASSERT( !called_destructor1); ASSERT( !called_destructor2); pool->destroy( p1); ASSERT( called_destructor1); ASSERT( !called_destructor2); pool->destroy( p2); ASSERT( called_destructor1); ASSERT( called_destructor2); /** More objects */ MyPoolObj *obj = NULL; for ( int i = 0; i < 20000; i++) { MyPoolObj *prev_obj = obj; obj = new ( pool) MyPoolObj(); obj->called = &called_destructor1; obj->attach( prev_obj); prev_obj = obj->next(); } while ( isNotNullP( obj)) { MyPoolObj *next = obj->next(); pool->destroy( obj); obj = next; } delete pool; return true; } /** * Test smart pointers, objects and pools */ bool uTestMem() { /** Test smart pointers */ if ( !uTestRef()) return false; /** Test memory pools */ if ( !uTestPools()) return false; return true; } codequery-0.18.1/showgraph/Utils/misc.h000066400000000000000000000050431300045745200200110ustar00rootroot00000000000000/** * @file: misc.h * @defgroup Misc Miscellaneous * @brief Various auxiliary routines * @ingroup Utils */ /* * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #ifndef MISC_H #define MISC_H /** * Check if pointer is not null * @ingroup Misc */ inline bool isNotNullP( const void *pointer) { return pointer != NULL; } /** * Check if pointer is null * @ingroup Misc */ inline bool isNullP( const void *pointer) { return pointer == NULL; } /** * Check if pointers are equal * @ingroup Misc */ inline bool areEqP( const void *p1, const void *p2) { return p1 == p2; } /** * Check if pointers are not equal * @ingroup Misc */ inline bool areNotEqP( const void *p1, const void *p2) { return p1 != p2; } /** * @brief Get absolute value * @ingroup Misc * @param Value value type * @param val signed value used to get absolute value * * @par * Returns absolute value for a given signed operand. Note that operators * "<" and "-" must be defined for parameter class */ template inline Value abs( Value val) { if( val < 0) return -val; return val; } #endifcodequery-0.18.1/showgraph/Utils/print.h000066400000000000000000000043201300045745200202070ustar00rootroot00000000000000/** * File: print.h - Wrapper for printing routines in ShowGraph * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #ifndef PRINT_H #define PRINT_H #include #include namespace PrintUtils { /** Print to file */ /** Print to console's STDOUT */ inline void out( const char* format, ...) { #ifdef _DEBUG va_list args; va_start( args, format); vfprintf( stdout, format, args); va_end( args); fprintf( stdout, "\n"); #endif } /** Print to console's STDERR */ inline void err( const char* format, ...) { #ifdef _DEBUG va_list args; va_start( args, format); vfprintf( stderr, format, args); va_end( args); fprintf( stderr, "\n"); #endif } }; #endifcodequery-0.18.1/showgraph/Utils/singleton.h000066400000000000000000000102031300045745200210520ustar00rootroot00000000000000/** * @file: singleton.h * @defgroup Singleton Singleton * @brief Definition of singleton template * @ingroup Utils */ /* * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #pragma once #ifndef SINGLETON_H #define SINGLETON_H /** * @brief Template for simple singleton objects. * @ingroup Singleton * @param T type of client object * * Singleton is a type of object that is guaranteed to have only one instance at any * given point of program execution. The Single template manages global access to single * instance of client object. Client object type is specified by template parameter. * A pointer to the single instance of client object can be obtained by calling intance(). * To control singleton's lifetime its initialization and destruction are made explicit. * Use init() and deinit() routines for these purposes. * Example of usage: @code // Sample class class classA { public: doSomething() {...} private: // private constructors, assignment and destructor classA(){}; classA( const classA&){}; classA& operator =( const classA&){}; ~classA(){}; // Needed for singleton opration friend class Single< classA>; }; // Typedef for classA encapsulated in singleton typedef Single< classA> SingleA; //void myfunc() { SingleA::instance()->doSomething(); } // Usage void useSingleA() { SingleA::init(); myfunc(); SingleA::deinit(); } @endcode */ template < class T> class Single { public: /** Create and initialize client object */ static void init(); /** Destroy client object */ static void deinit(); /** Get a pointer to client object */ static T* instance(); private:/* Uniqueness ensurance */ /** Private constructor */ Single(); /** Private copy constructor */ Single( const Single&); /** Private assignment */ Single& operator = ( const Single&); /** Private destructor */ ~Single(); /** * @brief Pointer to client object. * * Initialized to NULL on start and points to instance after init() is called */ static T* instance_p; }; /** * Initializtion of singleton */ template < class T> void Single< T>::init() { ASSERTD( isNullP( instance_p)); instance_p = new T(); } /** * Destruction of singleton */ template < class T> void Single< T>::deinit() { ASSERTD( isNotNullP( instance_p)); delete instance_p; instance_p = 0; } /** * Access to client object */ template < class T> T* Single< T>::instance() { ASSERTD( isNotNullP( instance_p)); return instance_p; } /** * Initialization of instance pointer */ template < class T> T *Single::instance_p = 0; #endif /* SINGLETON_H */ codequery-0.18.1/showgraph/Utils/ulist.h000066400000000000000000000000471300045745200202150ustar00rootroot00000000000000#ifndef ULIST_H #define ULIST_H #endifcodequery-0.18.1/showgraph/Utils/utils.cpp000066400000000000000000000000001300045745200205350ustar00rootroot00000000000000codequery-0.18.1/showgraph/Utils/utils_iface.h000066400000000000000000000042111300045745200213410ustar00rootroot00000000000000/** * @file: utils_iface.h * Interface of Utils library in ShowGraph * @defgroup Utils Utils * @ingroup Core * @brief Low level utils */ /* * Utils library in Showgraph tool * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #pragma once #ifndef UTILS_IFACE_H #define UTILS_IFACE_H #include #include #include #include "misc.h" #include "asrt.h" #include "print.h" #include "list.h" #include "singleton.h" #include "mem.h" #include "conf.h" namespace Utils { using namespace PrintUtils; }; /** * Test list classes */ bool uTestList(); /** * Test memory manager */ bool uTestMem(); /** * Test configuration-related functionality */ bool uTestConf(); #endifcodequery-0.18.1/showgraph/Utils/utils_utest.cpp000066400000000000000000000050711300045745200217760ustar00rootroot00000000000000/** * @file: utils_utest.cpp * Implementation of testing of utils */ /* * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #include "utils_iface.h" /** Sample class */ class classA { private: /** private constructors, assignment and destructor */ classA(){}; classA( const classA&){}; classA& operator =( const classA&){return *this;} ~classA(){}; /** Needed for singleton creation */ friend class Single< classA>; }; /** Typedef for classA encapsulated in singleton */ typedef Single< classA> SingleA; /** * Test simple singleton */ bool uTestSingle() { SingleA::init(); classA* a1 = SingleA::instance(); classA* a2 = SingleA::instance(); ASSERT( areEqP( a1, a2)); SingleA::deinit(); return true; } /** * Test Utils package */ bool uTestUtils() { /** test singleton */ if ( !uTestSingle()) return false; /** Tets list classes */ if ( !uTestList()) return false; /** Test memory management */ if ( !uTestMem()) return false; /** Test configuration classes functionality */ if ( !uTestConf()) return false; return true; } codequery-0.18.1/showgraph/core_iface.h000066400000000000000000000063241300045745200200400ustar00rootroot00000000000000/** * @file: core_iface.h * Interface file of showgraph's core library * @defgroup Core Core library for visualization of graphs */ /* * GraphCore for ShowGraph tool. * Copyright (c) 2009, Boris Shurygin * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #ifndef CORE_IFFACE_H #define CORE_IFFACE_H #include "GraphView/gview_iface.h" #endif /** CORE_IFFACE_H */codequery-0.18.1/showgraph/showgraph.cpp000066400000000000000000000043261300045745200203160ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ #include "core_iface.h" #include "showgraph.h" /** Magnifying factor for getting more detailed images */ const int IMAGE_EXPORT_SCALE_FACTOR = 2; /** Adjust value for image's bounding rectangle on scene rendering */ const qreal IMAGE_RECT_ADJUST = 10; QImage showgraph::convertToImage(QString grpxml) { /** Create graph instance */ GraphView* graph_view = new GraphView(); graph_view->setGraph( new GGraph( graph_view, true)); /** Read graph from XML */ graph_view->graph()->readFromXML( grpxml); /** * Perform layout in single thread. * Multi thread wouldn't work since we do not run QApplication::exec() and there is not event loop */ graph_view->graph()->doLayoutSingle(); /** Get scene rectangle */ QRectF scene_rect( graph_view->scene()->itemsBoundingRect() .adjusted( -IMAGE_RECT_ADJUST, -IMAGE_RECT_ADJUST, IMAGE_RECT_ADJUST, IMAGE_RECT_ADJUST)); /** Render to image */ QImage image( scene_rect.width() * IMAGE_EXPORT_SCALE_FACTOR, scene_rect.height() * IMAGE_EXPORT_SCALE_FACTOR, QImage::Format_RGB32); image.fill( graph_view->palette().base().color().rgb()); QPainter pp( &image); pp.setRenderHints( graph_view->renderHints()); graph_view->scene()->render( &pp, image.rect(), scene_rect); delete graph_view; return image; } codequery-0.18.1/showgraph/showgraph.h000066400000000000000000000017031300045745200177570ustar00rootroot00000000000000 /* * CodeQuery * Copyright (C) 2013-2016 ruben2020 https://github.com/ruben2020/ * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ #ifndef SHOWGRAPH_H_CQ #define SHOWGRAPH_H_CQ #ifdef USE_QT5 #include #else #include #endif class showgraph { public: static QImage convertToImage(QString grpxml); }; #endif //SHOWGRAPH_H_CQ codequery-0.18.1/test/000077500000000000000000000000001300045745200145605ustar00rootroot00000000000000codequery-0.18.1/test/cscope.out000066400000000000000000000321421300045745200165670ustar00rootroot00000000000000cscope 15 $HOME/code/codequery -c 0000013332 @build/CMakeFiles/3.0.1/CompilerIdC/CMakeCCompilerId.c 1 #ifdef __cplusplus 8 #if defined ( __18CXX ) 9 #define #ID_VOID_MAIN ) 12 #if defined ( __INTEL_COMPILER ) || defined( __ICC ) 13 #define #COMPILER_ID "Intel" ) 15 #define #COMPILER_VERSION_MAJOR `DEC ( __INTEL_COMPILER /100) ) 16 #define #COMPILER_VERSION_MINOR `DEC ( __INTEL_COMPILER /10 % 10) ) 17 #if defined ( __INTEL_COMPILER_UPDATE ) 18 #define #COMPILER_VERSION_PATCH `DEC ( __INTEL_COMPILER_UPDATE ) ) 20 #define #COMPILER_VERSION_PATCH `DEC ( __INTEL_COMPILER % 10) ) 22 #if defined ( __INTEL_COMPILER_BUILD_DATE ) 24 #define #COMPILER_VERSION_TWEAK `DEC ( __INTEL_COMPILER_BUILD_DATE ) ) 26 #if defined ( _MSC_VER ) 27 #define #SIMULATE_ID "MSVC" ) 29 #define #SIMULATE_VERSION_MAJOR `DEC ( _MSC_VER / 100) ) 30 #define #SIMULATE_VERSION_MINOR `DEC ( _MSC_VER % 100) ) 33 #elif defined ( __PATHCC__ ) 34 #define #COMPILER_ID "PathScale" ) 35 #define #COMPILER_VERSION_MAJOR `DEC ( __PATHCC__ ) ) 36 #define #COMPILER_VERSION_MINOR `DEC ( __PATHCC_MINOR__ ) ) 37 #if defined ( __PATHCC_PATCHLEVEL__ ) 38 #define #COMPILER_VERSION_PATCH `DEC ( __PATHCC_PATCHLEVEL__ ) ) 41 #elif defined ( __clang__ ) 42 #if defined ( __apple_build_version__ ) 43 #define #COMPILER_ID "AppleClang" ) 44 #define #COMPILER_VERSION_TWEAK `DEC ( __apple_build_version__ ) ) 46 #define #COMPILER_ID "Clang" ) 48 #define #COMPILER_VERSION_MAJOR `DEC ( __clang_major__ ) ) 49 #define #COMPILER_VERSION_MINOR `DEC ( __clang_minor__ ) ) 50 #define #COMPILER_VERSION_PATCH `DEC ( __clang_patchlevel__ ) ) 51 #if defined ( _MSC_VER ) 52 #define #SIMULATE_ID "MSVC" ) 54 #define #SIMULATE_VERSION_MAJOR `DEC ( _MSC_VER / 100) ) 55 #define #SIMULATE_VERSION_MINOR `DEC ( _MSC_VER % 100) ) 58 #elif defined ( __BORLANDC__ ) && defined( __CODEGEARC_VERSION__ ) 59 #define #COMPILER_ID "Embarcadero" ) 60 #define #COMPILER_VERSION_MAJOR `HEX ( __CODEGEARC_VERSION__ >>24 & 0x00FF) ) 61 #define #COMPILER_VERSION_MINOR `HEX ( __CODEGEARC_VERSION__ >>16 & 0x00FF) ) 62 #define #COMPILER_VERSION_PATCH `HEX ( __CODEGEARC_VERSION__ & 0xFFFF) ) 64 #elif defined ( __BORLANDC__ ) 65 #define #COMPILER_ID "Borland" ) 67 #define #COMPILER_VERSION_MAJOR `HEX ( __BORLANDC__ >>8) ) 68 #define #COMPILER_VERSION_MINOR `HEX ( __BORLANDC__ & 0xFF) ) 70 #elif defined ( __WATCOMC__ ) 71 #define #COMPILER_ID "Watcom" ) 73 #define #COMPILER_VERSION_MAJOR `DEC ( __WATCOMC__ / 100) ) 74 #define #COMPILER_VERSION_MINOR `DEC ( __WATCOMC__ % 100) ) 76 #elif defined ( __SUNPRO_C ) 77 #define #COMPILER_ID "SunPro" ) 78 #if __SUNPRO_C >= 0x5100 80 #define #COMPILER_VERSION_MAJOR `HEX ( __SUNPRO_C >>12) ) 81 #define #COMPILER_VERSION_MINOR `HEX ( __SUNPRO_C >>4 & 0xFF) ) 82 #define #COMPILER_VERSION_PATCH `HEX ( __SUNPRO_C & 0xF) ) 85 #define #COMPILER_VERSION_MAJOR `HEX ( __SUNPRO_C >>8) ) 86 #define #COMPILER_VERSION_MINOR `HEX ( __SUNPRO_C >>4 & 0xF) ) 87 #define #COMPILER_VERSION_PATCH `HEX ( __SUNPRO_C & 0xF) ) 90 #elif defined ( __HP_cc ) 91 #define #COMPILER_ID "HP" ) 93 #define #COMPILER_VERSION_MAJOR `DEC ( __HP_cc /10000) ) 94 #define #COMPILER_VERSION_MINOR `DEC ( __HP_cc /100 % 100) ) 95 #define #COMPILER_VERSION_PATCH `DEC ( __HP_cc % 100) ) 97 #elif defined ( __DECC ) 98 #define #COMPILER_ID "Compaq" ) 100 #define #COMPILER_VERSION_MAJOR `DEC ( __DECC_VER /10000000) ) 101 #define #COMPILER_VERSION_MINOR `DEC ( __DECC_VER /100000 % 100) ) 102 #define #COMPILER_VERSION_PATCH `DEC ( __DECC_VER % 10000) ) 104 #elif defined ( __IBMC__ ) 105 #if defined ( __COMPILER_VER__ ) 106 #define #COMPILER_ID "zOS" ) 108 #if __IBMC__ >= 800 109 #define #COMPILER_ID "XL" ) 111 #define #COMPILER_ID "VisualAge" ) 114 #define #COMPILER_VERSION_MAJOR `DEC ( __IBMC__ /100) ) 115 #define #COMPILER_VERSION_MINOR `DEC ( __IBMC__ /10 % 10) ) 116 #define #COMPILER_VERSION_PATCH `DEC ( __IBMC__ % 10) ) 119 #elif defined ( __PGI ) 120 #define #COMPILER_ID "PGI" ) 121 #define #COMPILER_VERSION_MAJOR `DEC ( __PGIC__ ) ) 122 #define #COMPILER_VERSION_MINOR `DEC ( __PGIC_MINOR__ ) ) 123 #if defined ( __PGIC_PATCHLEVEL__ ) 124 #define #COMPILER_VERSION_PATCH `DEC ( __PGIC_PATCHLEVEL__ ) ) 127 #elif defined ( _CRAYC ) 128 #define #COMPILER_ID "Cray" ) 129 #define #COMPILER_VERSION_MAJOR `DEC ( _RELEASE ) ) 130 #define #COMPILER_VERSION_MINOR `DEC ( _RELEASE_MINOR ) ) 132 #elif defined ( __TI_COMPILER_VERSION__ ) 133 #define #COMPILER_ID "TI" ) 135 #define #COMPILER_VERSION_MAJOR `DEC ( __TI_COMPILER_VERSION__ /1000000) ) 136 #define #COMPILER_VERSION_MINOR `DEC ( __TI_COMPILER_VERSION__ /1000 % 1000) ) 137 #define #COMPILER_VERSION_PATCH `DEC ( __TI_COMPILER_VERSION__ % 1000) ) 139 #elif defined ( __TINYC__ ) 140 #define #COMPILER_ID "TinyCC" ) 142 #elif defined ( __SCO_VERSION__ ) 143 #define #COMPILER_ID "SCO" ) 145 #elif defined ( __GNUC__ ) 146 #define #COMPILER_ID "GNU" ) 147 #define #COMPILER_VERSION_MAJOR `DEC ( __GNUC__ ) ) 148 #define #COMPILER_VERSION_MINOR `DEC ( __GNUC_MINOR__ ) ) 149 #if defined ( __GNUC_PATCHLEVEL__ ) 150 #define #COMPILER_VERSION_PATCH `DEC ( __GNUC_PATCHLEVEL__ ) ) 153 #elif defined ( _MSC_VER ) 154 #define #COMPILER_ID "MSVC" ) 156 #define #COMPILER_VERSION_MAJOR `DEC ( _MSC_VER / 100) ) 157 #define #COMPILER_VERSION_MINOR `DEC ( _MSC_VER % 100) ) 158 #if defined ( _MSC_FULL_VER ) 159 #if _MSC_VER >= 1400 161 #define #COMPILER_VERSION_PATCH `DEC ( _MSC_FULL_VER % 100000) ) 164 #define #COMPILER_VERSION_PATCH `DEC ( _MSC_FULL_VER % 10000) ) 167 #if defined ( _MSC_BUILD ) 168 #define #COMPILER_VERSION_TWEAK `DEC ( _MSC_BUILD ) ) 172 #elif defined ( __VISUALDSPVERSION__ ) 173 #define #COMPILER_ID "ADSP" ) 175 #define #COMPILER_VERSION_MAJOR `HEX ( __VISUALDSPVERSION__ >>24) ) 176 #define #COMPILER_VERSION_MINOR `HEX ( __VISUALDSPVERSION__ >>16 & 0xFF) ) 177 #define #COMPILER_VERSION_PATCH `HEX ( __VISUALDSPVERSION__ >>8 & 0xFF) ) 180 #elif defined ( __ADSPBLACKFIN__ ) || defined( __ADSPTS__ ) || defined( __ADSP21000__ ) 181 #define #COMPILER_ID "ADSP" ) 185 #elif defined ( __IAR_SYSTEMS_ICC__ ) || defined( __IAR_SYSTEMS_ICC ) 186 #define #COMPILER_ID "IAR" ) 190 #elif defined ( SDCC ) 191 #define #COMPILER_ID "SDCC" ) 193 #define #COMPILER_VERSION_MAJOR `DEC ( SDCC /100) ) 194 #define #COMPILER_VERSION_MINOR `DEC ( SDCC /10 % 10) ) 195 #define #COMPILER_VERSION_PATCH `DEC ( SDCC % 10) ) 197 #elif defined ( _SGI_COMPILER_VERSION ) || defined( _COMPILER_VERSION ) 198 #define #COMPILER_ID "MIPSpro" ) 199 #if defined ( _SGI_COMPILER_VERSION ) 201 #define #COMPILER_VERSION_MAJOR `DEC ( _SGI_COMPILER_VERSION /100) ) 202 #define #COMPILER_VERSION_MINOR `DEC ( _SGI_COMPILER_VERSION /10 % 10) ) 203 #define #COMPILER_VERSION_PATCH `DEC ( _SGI_COMPILER_VERSION % 10) ) 206 #define #COMPILER_VERSION_MAJOR `DEC ( _COMPILER_VERSION /100) ) 207 #define #COMPILER_VERSION_MINOR `DEC ( _COMPILER_VERSION /10 % 10) ) 208 #define #COMPILER_VERSION_PATCH `DEC ( _COMPILER_VERSION % 10) ) 214 #elif defined ( __sgi ) 215 #define #COMPILER_ID "MIPSpro" ) 217 #elif defined ( __hpux ) || defined( __hpua ) 218 #define #COMPILER_ID "HP" ) 221 #define #COMPILER_ID "" ) 229 char const* ginfo_compiler = "INFO" ":" "compiler[" COMPILER_ID "]"; 230 #ifdef SIMULATE_ID 231 char const* ginfo_simulate = "INFO" ":" "simulate[" SIMULATE_ID "]"; 234 #ifdef __QNXNTO__ 235 char const* gqnxnto = "INFO" ":" "qnxnto"; 239 #if defined ( __linux ) || defined( __linux__ ) || defined( linux ) 240 #define #PLATFORM_ID "Linux" ) 242 #elif defined ( __CYGWIN__ ) 243 #define #PLATFORM_ID "Cygwin" ) 245 #elif defined ( __MINGW32__ ) 246 #define #PLATFORM_ID "MinGW" ) 248 #elif defined ( __APPLE__ ) 249 #define #PLATFORM_ID "Darwin" ) 251 #elif defined ( _WIN32 ) || defined( __WIN32__ ) || defined( WIN32 ) 252 #define #PLATFORM_ID "Windows" ) 254 #elif defined ( __FreeBSD__ ) || defined( __FreeBSD ) 255 #define #PLATFORM_ID "FreeBSD" ) 257 #elif defined ( __NetBSD__ ) || defined( __NetBSD ) 258 #define #PLATFORM_ID "NetBSD" ) 260 #elif defined ( __OpenBSD__ ) || defined( __OPENBSD ) 261 #define #PLATFORM_ID "OpenBSD" ) 263 #elif defined ( __sun ) || defined( sun ) 264 #define #PLATFORM_ID "SunOS" ) 266 #elif defined ( _AIX ) || defined( __AIX ) || defined( __AIX__ ) || defined( __aix ) || defined( __aix__ ) 267 #define #PLATFORM_ID "AIX" ) 269 #elif defined ( __sgi ) || defined( __sgi__ ) || defined( _SGI ) 270 #define #PLATFORM_ID "IRIX" ) 272 #elif defined ( __hpux ) || defined( __hpux__ ) 273 #define #PLATFORM_ID "HP-UX" ) 275 #elif defined ( __HAIKU__ ) 276 #define #PLATFORM_ID "Haiku" ) 278 #elif defined ( __BeOS ) || defined( __BEOS__ ) || defined( _BEOS ) 279 #define #PLATFORM_ID "BeOS" ) 281 #elif defined ( __QNX__ ) || defined( __QNXNTO__ ) 282 #define #PLATFORM_ID "QNX" ) 284 #elif defined ( __tru64 ) || defined( _tru64 ) || defined( __TRU64__ ) 285 #define #PLATFORM_ID "Tru64" ) 287 #elif defined ( __riscos ) || defined( __riscos__ ) 288 #define #PLATFORM_ID "RISCos" ) 290 #elif defined ( __sinix ) || defined( __sinix__ ) || defined( __SINIX__ ) 291 #define #PLATFORM_ID "SINIX" ) 293 #elif defined ( __UNIX_SV__ ) 294 #define #PLATFORM_ID "UNIX_SV" ) 296 #elif defined ( __bsdos__ ) 297 #define #PLATFORM_ID "BSDOS" ) 299 #elif defined ( _MPRAS ) || defined( MPRAS ) 300 #define #PLATFORM_ID "MP-RAS" ) 302 #elif defined ( __osf ) || defined( __osf__ ) 303 #define #PLATFORM_ID "OSF1" ) 305 #elif defined ( _SCO_SV ) || defined( SCO_SV ) || defined( sco_sv ) 306 #define #PLATFORM_ID "SCO_SV" ) 308 #elif defined ( __ultrix ) || defined( __ultrix__ ) || defined( _ULTRIX ) 309 #define #PLATFORM_ID "ULTRIX" ) 311 #elif defined ( __XENIX__ ) || defined( _XENIX ) || defined( XENIX ) 312 #define #PLATFORM_ID "Xenix" ) 315 #define #PLATFORM_ID "" ) 324 #if defined ( _WIN32 ) && defined( _MSC_VER ) 325 #if defined ( _M_IA64 ) 326 #define #ARCHITECTURE_ID "IA64" ) 328 #elif defined ( _M_X64 ) || defined( _M_AMD64 ) 329 #define #ARCHITECTURE_ID "x64" ) 331 #elif defined ( _M_IX86 ) 332 #define #ARCHITECTURE_ID "X86" ) 334 #elif defined ( _M_ARM ) 335 #define #ARCHITECTURE_ID "ARM" ) 337 #elif defined ( _M_MIPS ) 338 #define #ARCHITECTURE_ID "MIPS" ) 340 #elif defined ( _M_SH ) 341 #define #ARCHITECTURE_ID "SHx" ) 344 #define #ARCHITECTURE_ID "" ) 348 #define #ARCHITECTURE_ID "" ) 352 #define #DEC ( n ) \ 353 ('0' + ((( n ) / 10000000)%10)), \ 354 ('0' + ((( n ) / 1000000)%10)), \ 355 ('0' + ((( n ) / 100000)%10)), \ 356 ('0' + ((( n ) / 10000)%10)), \ 357 ('0' + ((( n ) / 1000)%10)), \ 358 ('0' + ((( n ) / 100)%10)), \ 359 ('0' + ((( n ) / 10)%10)), \ 360 ('0' + (( n ) % 10)) ) 363 #define #HEX ( n ) \ 364 ('0' + (( n )>>28 & 0xF)), \ 365 ('0' + (( n )>>24 & 0xF)), \ 366 ('0' + (( n )>>20 & 0xF)), \ 367 ('0' + (( n )>>16 & 0xF)), \ 368 ('0' + (( n )>>12 & 0xF)), \ 369 ('0' + (( n )>>8 & 0xF)), \ 370 ('0' + (( n )>>4 & 0xF)), \ 371 ('0' + (( n ) & 0xF)) ) 374 #ifdef COMPILER_VERSION_MAJOR 375 char const ginfo_version [] = { 378 COMPILER_VERSION_MAJOR , 379 #ifdef COMPILER_VERSION_MINOR 380 '.', COMPILER_VERSION_MINOR , 381 #ifdef COMPILER_VERSION_PATCH 382 '.', COMPILER_VERSION_PATCH , 383 #ifdef COMPILER_VERSION_TWEAK 384 '.', COMPILER_VERSION_TWEAK , 392 #ifdef SIMULATE_VERSION_MAJOR 393 char const ginfo_simulate_version [] = { 396 SIMULATE_VERSION_MAJOR , 397 #ifdef SIMULATE_VERSION_MINOR 398 '.', SIMULATE_VERSION_MINOR , 399 #ifdef SIMULATE_VERSION_PATCH 400 '.', SIMULATE_VERSION_PATCH , 401 #ifdef SIMULATE_VERSION_TWEAK 402 '.', SIMULATE_VERSION_TWEAK , 413 char const* ginfo_platform = "INFO" ":" "platform[" PLATFORM_ID "]"; 414 char const* ginfo_arch = "INFO" ":" "arch[" ARCHITECTURE_ID "]"; 421 #ifdef ID_VOID_MAIN 422 void $main () { } } 424 int $main (int argc , char* argv []) 426 int require = 0; 427 require += info_compiler [ argc ]; 428 require += info_platform [ argc ]; 429 require += info_arch [ argc ]; 430 #ifdef COMPILER_VERSION_MAJOR 431 require += info_version [ argc ]; 433 #ifdef SIMULATE_ID 434 require += info_simulate [ argc ]; 436 #ifdef SIMULATE_VERSION_MAJOR 437 require += info_simulate_version [ argc ]; 439 (void) argv ; 440 return require ; 441 } } @ 1 . 1 /usr/include 1 54 build/CMakeFiles/3.0.1/CompilerIdC/CMakeCCompilerId.c codequery-0.18.1/test/tags000066400000000000000000006213341300045745200154520ustar00rootroot00000000000000!_TAG_FILE_FORMAT 2 /extended format; --format=1 will not append ;" to lines/ !_TAG_FILE_SORTED 1 /0=unsorted, 1=sorted, 2=foldcase/ !_TAG_PROGRAM_AUTHOR Darren Hiebert /dhiebert@users.sourceforge.net/ !_TAG_PROGRAM_NAME Exuberant Ctags // !_TAG_PROGRAM_URL http://ctags.sourceforge.net /official site/ !_TAG_PROGRAM_VERSION 5.8 // ABOUTDIALOG_H_CQ gui/aboutdialog.h /^#define ABOUTDIALOG_H_CQ$/;" d AEdge showgraph/Graph/agraph.h /^class AEdge: public Edge$/;" c AEdge showgraph/Graph/agraph.h /^inline AEdge::AEdge( AGraph *graph_p, int _id, ANode *_pred, ANode* _succ):$/;" f class:AEdge AGRAPH_H showgraph/Graph/agraph.h /^#define AGRAPH_H$/;" d AGraph showgraph/Graph/agraph.h /^ AGraph( bool create_pools): Graph( false)$/;" f class:AGraph AGraph showgraph/Graph/agraph.h /^class AGraph: public Graph$/;" c ANode showgraph/Graph/agraph.h /^class ANode: public Node$/;" c ANode showgraph/Graph/agraph.h /^inline ANode::ANode( AGraph *graph_p, int _id):$/;" f class:ANode ASRT_H showgraph/Utils/asrt.h /^#define ASRT_H$/;" d ASSERT showgraph/Utils/asrt.h /^# define ASSERT(/;" d ASSERTD showgraph/Utils/asrt.h /^# define ASSERTD(/;" d ASSERT_XD showgraph/Utils/asrt.h /^# define ASSERT_XD(/;" d AUX_EDGE_CONTROL showgraph/Layout/aux_node.h /^ AUX_EDGE_CONTROL,$/;" e enum:AuxNodeType AUX_EDGE_H showgraph/Layout/aux_edge.h /^#define AUX_EDGE_H$/;" d AUX_EDGE_LABEL showgraph/Layout/aux_node.h /^ AUX_EDGE_LABEL,$/;" e enum:AuxNodeType AUX_GRAPH_H showgraph/Layout/aux_graph.h /^#define AUX_GRAPH_H$/;" d AUX_NODE_H showgraph/Layout/aux_node.h /^#define AUX_NODE_H$/;" d AUX_NODE_SIMPLE showgraph/Layout/aux_node.h /^ AUX_NODE_SIMPLE,$/;" e enum:AuxNodeType AUX_NODE_TYPES_NUM showgraph/Layout/aux_node.h /^ AUX_NODE_TYPES_NUM$/;" e enum:AuxNodeType AbleToCopy gui/fileviewer.cpp /^void fileviewer::AbleToCopy(bool copy)$/;" f class:fileviewer AboutQtTriggered gui/mainwindow.cpp /^void mainwindow::AboutQtTriggered(bool checked)$/;" f class:mainwindow AboutTriggered gui/mainwindow.cpp /^void mainwindow::AboutTriggered(bool checked)$/;" f class:mainwindow AddEdgeInDir showgraph/Graph/agraph.h /^ANode::AddEdgeInDir( AEdge *edge, GraphDir dir)$/;" f class:ANode AddEdgeInDir showgraph/Graph/node_inline.h /^Node::AddEdgeInDir( Edge *edge, GraphDir dir)$/;" f class:Node AddEdgeInDir showgraph/GraphView/node_item.h /^ inline void AddEdgeInDir( GEdge *edge, GraphDir dir)$/;" f class:GNode AddEdgeInDir showgraph/Layout/aux_graph.h /^AuxNode::AddEdgeInDir( AuxEdge *edge, GraphDir dir)$/;" f class:AuxNode AddPred showgraph/Graph/agraph.h /^ANode::AddPred( AEdge *edge)$/;" f class:ANode AddPred showgraph/Graph/node_inline.h /^inline void Node::AddPred( Edge *edge)$/;" f class:Node AddPred showgraph/GraphView/node_item.h /^ inline void AddPred( GEdge *edge)$/;" f class:GNode AddPred showgraph/Layout/aux_graph.h /^AuxNode::AddPred( AuxEdge *edge)$/;" f class:AuxNode AddSucc showgraph/Graph/agraph.h /^ANode::AddSucc( AEdge *edge) $/;" f class:ANode AddSucc showgraph/Graph/node_inline.h /^inline void Node::AddSucc( Edge *edge) $/;" f class:Node AddSucc showgraph/GraphView/node_item.h /^ inline void AddSucc( GEdge *edge) $/;" f class:GNode AddSucc showgraph/Layout/aux_graph.h /^AuxNode::AddSucc( AuxEdge *edge) $/;" f class:AuxNode Attach showgraph/Utils/list.h /^ inline void Attach( ListItem* peer)$/;" f class:ListItem AttachInDir showgraph/Utils/list.h /^ inline void AttachInDir( ListItem* p, ListDir dir)$/;" f class:ListItem AuxEdge showgraph/Layout/aux_edge.h /^class AuxEdge: public Edge$/;" c AuxEdge showgraph/Layout/aux_graph.h /^inline AuxEdge::AuxEdge( AuxGraph *graph_p, int _id, AuxNode *_pred, AuxNode* _succ):$/;" f class:AuxEdge AuxEdgeType showgraph/Layout/aux_edge.h /^enum AuxEdgeType$/;" g AuxGraph showgraph/Layout/aux_graph.cpp /^AuxGraph::AuxGraph( bool create_pools):$/;" f class:AuxGraph AuxGraph showgraph/Layout/aux_graph.h /^class AuxGraph: public QObject, public Graph$/;" c AuxNode showgraph/Layout/aux_graph.h /^inline AuxNode::AuxNode( AuxGraph *graph_p, int _id):$/;" f class:AuxNode AuxNode showgraph/Layout/aux_node.h /^class AuxNode: public Node$/;" c AuxNodeType showgraph/Layout/aux_node.h /^enum AuxNodeType$/;" g B showgraph/Utils/list_utest.cpp /^class B: public MListIface< B, classA, LISTS_NUM>$/;" c file: BACK_EDGE showgraph/Layout/aux_edge.h /^ BACK_EDGE,$/;" e enum:AuxEdgeType BASE_LANG_PATH gui/langtable.cpp /^#define BASE_LANG_PATH /;" d file: BLURB gui/obsolete/highlighter.cpp /^#define BLURB /;" d file: BOTTOM_SECTOR showgraph/GraphView/navigation.h /^ BOTTOM_SECTOR,$/;" e enum:NavSector CHECK_CHUNKS showgraph/Utils/mem.h /^# define CHECK_CHUNKS$/;" d CHECK_CHUNKS showgraph/Utils/mem.h /^#undef CHECK_CHUNKS$/;" d CHECK_DELETE showgraph/Utils/mem.h /^# define CHECK_DELETE$/;" d CHECK_DELETE showgraph/Utils/mem.h /^#undef CHECK_DELETE$/;" d CHECK_ENTRY showgraph/Utils/mem.h /^# define CHECK_ENTRY$/;" d CHECK_ENTRY showgraph/Utils/mem.h /^#undef CHECK_ENTRY$/;" d CHUNK_LISTS_NUM showgraph/Utils/mem_chunk.h /^ CHUNK_LISTS_NUM$/;" e enum:MemImpl::ChunkListType CHUNK_LIST_ALL showgraph/Utils/mem_chunk.h /^ CHUNK_LIST_ALL,$/;" e enum:MemImpl::ChunkListType CHUNK_LIST_FREE showgraph/Utils/mem_chunk.h /^ CHUNK_LIST_FREE,$/;" e enum:MemImpl::ChunkListType CHUNK_SIZE showgraph/Utils/mem_fixed_pool.h /^ static const size_t CHUNK_SIZE = sizeof( MemImpl::Chunk< Data>) $/;" m class:Mem::FixedPool CODEEDITOR_H gui/obsolete/CodeEditor.h /^ #define CODEEDITOR_H$/;" d CODEQUERY_SW_LICENSE makedb/swver.h /^#define CODEQUERY_SW_LICENSE /;" d CODEQUERY_SW_LICENSE_PARA makedb/swver.h /^#define CODEQUERY_SW_LICENSE_PARA /;" d CODEQUERY_SW_LICENSE_PARA_LINK makedb/swver.h /^#define CODEQUERY_SW_LICENSE_PARA_LINK /;" d CODEQUERY_SW_VERSION makedb/swver.h /^#define CODEQUERY_SW_VERSION /;" d CODEQUERY_SW_VERSION_WEBSITE makedb/swver.h /^#define CODEQUERY_SW_VERSION_WEBSITE /;" d CONF_H showgraph/Utils/conf.h /^#define CONF_H$/;" d CONTEXT_VIEW showgraph/GraphView/graph_view.h /^ CONTEXT_VIEW,$/;" e enum:GraphViewMode CONTROL_CONTROL_MARGIN showgraph/Layout/layout_iface.h /^const qreal CONTROL_CONTROL_MARGIN = 5;$/;" v CORE_IFFACE_H showgraph/core_iface.h /^#define CORE_IFFACE_H$/;" d CS2SQ_H_CQ makedb/cs2sq.h /^#define CS2SQ_H_CQ$/;" d CSCOMMON_H_CQ makedb/cscommon.h /^#define CSCOMMON_H_CQ$/;" d CSClass makedb/cscommon.h /^#define CSClass /;" d CSDBHEADER_H makedb/csdbheader.h /^#define CSDBHEADER_H$/;" d CSDBPARSER_H_CQ makedb/csdbparser.h /^#define CSDBPARSER_H_CQ$/;" d CSDBP_GENERAL_CHK makedb/csdbparser.cpp /^#define CSDBP_GENERAL_CHK(/;" d file: CSDBP_MINIM_BUFSIZE makedb/csdbparser.h /^#define CSDBP_MINIM_BUFSIZE /;" d CSDBP_SUPPORTED_VER makedb/csdbparser.h /^#define CSDBP_SUPPORTED_VER /;" d CSDBP_SUPPORTED_VER_NUM makedb/csdbparser.h /^#define CSDBP_SUPPORTED_VER_NUM /;" d CSDBP_SUP_PARAM makedb/csdbparser.h /^#define CSDBP_SUP_PARAM /;" d CSDBP_SUP_PARAM2 makedb/csdbparser.h /^#define CSDBP_SUP_PARAM2 /;" d CSDirectAssgnIncrDecr makedb/cscommon.h /^#define CSDirectAssgnIncrDecr /;" d CSEnum makedb/cscommon.h /^#define CSEnum /;" d CSFile makedb/cscommon.h /^#define CSFile /;" d CSFuncCall makedb/cscommon.h /^#define CSFuncCall /;" d CSFuncDef makedb/cscommon.h /^#define CSFuncDef /;" d CSFuncParam makedb/cscommon.h /^#define CSFuncParam /;" d CSGlobalEnumStructUnion makedb/cscommon.h /^#define CSGlobalEnumStructUnion /;" d CSInclude makedb/cscommon.h /^#define CSInclude /;" d CSLocalFuncBlockDef makedb/cscommon.h /^#define CSLocalFuncBlockDef /;" d CSMacroDef makedb/cscommon.h /^#define CSMacroDef /;" d CSNoType makedb/cscommon.h /^#define CSNoType /;" d CSOtherGlobal makedb/cscommon.h /^#define CSOtherGlobal /;" d CSStruct makedb/cscommon.h /^#define CSStruct /;" d CSTypeDef makedb/cscommon.h /^#define CSTypeDef /;" d CSUnion makedb/cscommon.h /^#define CSUnion /;" d CTAGREAD_H_CQ makedb/ctagread.h /^#define CTAGREAD_H_CQ$/;" d CUSTOMWIDGETPLUGIN_H gui/obsolete/CodeEditorWidgetPlugin/CodeEditorWidgetPlugin.h /^ #define CUSTOMWIDGETPLUGIN_H$/;" d Chunk showgraph/Utils/mem_chunk.h /^ Chunk< Data>::Chunk()$/;" f class:MemImpl::Chunk Chunk showgraph/Utils/mem_chunk.h /^ template class Chunk: $/;" c namespace:MemImpl ChunkListType showgraph/Utils/mem_chunk.h /^ enum ChunkListType$/;" g namespace:MemImpl ChunkPos showgraph/Utils/mem.h /^ typedef quint8 ChunkPos;$/;" t namespace:MemImpl ClipSearch_ButtonClick gui/searchhandler.cpp /^void searchhandler::ClipSearch_ButtonClick(bool checked)$/;" f class:searchhandler CodeEditor gui/obsolete/CodeEditor.cpp /^ CodeEditor::CodeEditor(QWidget *parent) : QPlainTextEdit(parent)$/;" f class:CodeEditor CodeEditor gui/obsolete/CodeEditor.h /^ class CodeEditor : public QPlainTextEdit$/;" c CodeEditorWidgetPlugin gui/obsolete/CodeEditorWidgetPlugin/CodeEditorWidgetPlugin.cpp /^ CodeEditorWidgetPlugin::CodeEditorWidgetPlugin(QObject *parent)$/;" f class:CodeEditorWidgetPlugin CodeEditorWidgetPlugin gui/obsolete/CodeEditorWidgetPlugin/CodeEditorWidgetPlugin.h /^ class CodeEditorWidgetPlugin : public QObject, public QDesignerCustomWidgetInterface$/;" c ColorButton showgraph/GraphView/style_edit.cpp /^ColorButton::ColorButton( QWidget *parent):$/;" f class:ColorButton ColorButton showgraph/GraphView/style_edit.h /^class ColorButton: public QAbstractButton$/;" c Conf showgraph/Utils/conf.cpp /^Conf::Conf(): short_opts(), long_opts(), unknown_options()$/;" f class:Conf Conf showgraph/Utils/conf.h /^class Conf$/;" c DIM querylib/small_lib.h /^#define DIM(/;" d DIRSEP querylib/small_lib.h /^#define DIRSEP /;" d Detach showgraph/Utils/list.h /^ inline void Detach()$/;" f class:ListItem DfsStepInfo showgraph/Layout/layout.cpp /^ DfsStepInfo( AuxNode *n)$/;" f struct:DfsStepInfo DfsStepInfo showgraph/Layout/layout.cpp /^struct DfsStepInfo$/;" s file: Down_ButtonClick gui/listhandler.cpp /^void listhandler::Down_ButtonClick(bool checked)$/;" f class:listhandler EDGE_CONTROL_HEIGHT showgraph/Layout/layout_iface.h /^const qreal EDGE_CONTROL_HEIGHT = 5;$/;" v EDGE_CONTROL_WIDTH showgraph/Layout/layout_iface.h /^const qreal EDGE_CONTROL_WIDTH = 5;$/;" v EDGE_H showgraph/Graph/edge.h /^#define EDGE_H$/;" d EDGE_HELPER_H showgraph/GraphView/edge_helper.h /^#define EDGE_HELPER_H$/;" d EDGE_INLINE_H showgraph/Graph/edge_inline.h /^#define EDGE_INLINE_H$/;" d EDGE_LISTS_NUM showgraph/Graph/edge.h /^ EDGE_LISTS_NUM$/;" e enum:EdgeListType EDGE_LIST_GRAPH showgraph/Graph/edge.h /^ EDGE_LIST_GRAPH,$/;" e enum:EdgeListType EDGE_LIST_PREDS showgraph/Graph/edge.h /^ EDGE_LIST_PREDS,$/;" e enum:EdgeListType EDGE_LIST_SUCCS showgraph/Graph/edge.h /^ EDGE_LIST_SUCCS,$/;" e enum:EdgeListType EDGE_TYPES_NUM showgraph/Layout/aux_edge.h /^ EDGE_TYPES_NUM$/;" e enum:AuxEdgeType EDGE_W_H showgraph/GraphView/edge_item.h /^#define EDGE_W_H$/;" d EXT_EDITOR_DEFAULT_PATH gui/fileviewer.cpp /^#define EXT_EDITOR_DEFAULT_PATH /;" d file: Edge showgraph/Graph/edge.h /^ Edge( Graph *_graph_p, GraphUid _id, Node *_pred, Node* _succ):$/;" f class:Edge Edge showgraph/Graph/edge.h /^class Edge: $/;" c EdgeControlSize showgraph/GraphView/edge_item.h /^const qreal EdgeControlSize = 5;$/;" v EdgeHelper showgraph/GraphView/edge_helper.cpp /^EdgeHelper::EdgeHelper(): $/;" f class:EdgeHelper EdgeHelper showgraph/GraphView/edge_helper.h /^class EdgeHelper: public QGraphicsItem$/;" c EdgeHelperState showgraph/GraphView/edge_helper.h /^enum EdgeHelperState$/;" g EdgeItem showgraph/GraphView/edge_item.cpp /^EdgeItem::EdgeItem( GEdge *e_p): edge_p( e_p)$/;" f class:EdgeItem EdgeItem showgraph/GraphView/edge_item.h /^class EdgeItem: public QGraphicsItem$/;" c EdgeIter showgraph/Graph/node.h /^ typedef EdgeIterIface< UnDirIterImpl> EdgeIter; \/**< Undirected iterator for edges *\/$/;" t class:Node EdgeIterIface showgraph/Graph/node_inline.h /^inline EdgeIterIface< EdgeIterImpl>::EdgeIterIface( Node *n):$/;" f class:EdgeIterIface EdgeIterIface showgraph/Graph/node_inline.h /^inline EdgeIterIface< EdgeIterImpl>::EdgeIterIface( const EdgeIterIface& proto)$/;" f class:EdgeIterIface EdgeIterIface showgraph/Graph/node_inline.h /^inline EdgeIterIface< EdgeIterImpl>::EdgeIterIface()$/;" f class:EdgeIterIface EdgeIterIface showgraph/Graph/node_iter.h /^template < class EdgeIterImpl> class EdgeIterIface$/;" c EdgeListType showgraph/Graph/edge.h /^enum EdgeListType$/;" g EdgeMode showgraph/GraphView/edge_item.h /^ typedef enum EdgeMode$/;" g class:EdgeItem EdgeMode showgraph/GraphView/edge_item.h /^ } EdgeMode;$/;" t class:EdgeItem typeref:enum:EdgeItem::EdgeMode Entry showgraph/Utils/mem_entry.h /^ Entry< Data>::Entry()$/;" f class:MemImpl::Entry Entry showgraph/Utils/mem_entry.h /^ template < class Data> class Entry: private Data$/;" c namespace:MemImpl EntryNum showgraph/Utils/mem_pool.h /^ typedef quint32 EntryNum;$/;" t namespace:Mem EntrySize showgraph/Utils/mem_pool.h /^ typedef quint32 EntrySize;$/;" t namespace:Mem ExitTriggered gui/mainwindow.cpp /^void mainwindow::ExitTriggered(bool checked)$/;" f class:mainwindow FILEVIEWER_H_CQ gui/fileviewer.h /^#define FILEVIEWER_H_CQ$/;" d FILEVIEWSETTINGSDIALOG_H_CQ gui/fileviewsettingsdialog.h /^#define FILEVIEWSETTINGSDIALOG_H_CQ$/;" d FORWARD_EDGE showgraph/Layout/aux_edge.h /^ FORWARD_EDGE,$/;" e enum:AuxEdgeType FixedPool showgraph/Utils/mem_fixed_pool.h /^ FixedPool::FixedPool(): $/;" f class:Mem::FixedPool FixedPool showgraph/Utils/mem_fixed_pool.h /^ class FixedPool: public Pool$/;" c namespace:Mem ForEdges showgraph/Graph/graph_iface.h /^# define ForEdges(/;" d FreeOptList makedb/optlist.cpp /^void FreeOptList(option_t *list)$/;" f GEdge showgraph/GraphView/edge_item.cpp /^GEdge::GEdge( GGraph *graph_p, int _id, GNode *_pred, GNode* _succ):$/;" f class:GEdge GEdge showgraph/GraphView/edge_item.h /^class GEdge: public AuxEdge$/;" c GGraph showgraph/GraphView/graph_view.h /^ inline GGraph( GraphView *v, bool create_pools):$/;" f class:GGraph GGraph showgraph/GraphView/graph_view.h /^class GGraph: public AuxGraph$/;" c GGraphError showgraph/GraphView/gview_iface.h /^ GGraphError( QString str): msg_priv( str){};$/;" f class:GGraphError GGraphError showgraph/GraphView/gview_iface.h /^ GGraphError(){};$/;" f class:GGraphError GGraphError showgraph/GraphView/gview_iface.h /^class GGraphError$/;" c GNode showgraph/GraphView/node_item.cpp /^GNode::GNode( GGraph *graph_p, int _id):$/;" f class:GNode GNode showgraph/GraphView/node_item.cpp /^GNode::GNode( GGraph *graph_p, int _id, QPointF _pos):$/;" f class:GNode GNode showgraph/GraphView/node_item.h /^class GNode: public AuxNode$/;" c GRAPHDIALOG_H_CQ gui/graphdialog.h /^#define GRAPHDIALOG_H_CQ$/;" d GRAPH_ASSERTD showgraph/Graph/predecls.h /^# define GRAPH_ASSERTD(/;" d GRAPH_DIRS_NUM showgraph/Graph/predecls.h /^ GRAPH_DIRS_NUM = 2$/;" e enum:GraphDir GRAPH_DIR_DOWN showgraph/Graph/predecls.h /^ GRAPH_DIR_DOWN = 1,$/;" e enum:GraphDir GRAPH_DIR_UP showgraph/Graph/predecls.h /^ GRAPH_DIR_UP = 0,$/;" e enum:GraphDir GRAPH_H showgraph/Graph/graph.h /^#define GRAPH_H$/;" d GRAPH_IFACE_H showgraph/Graph/graph_iface.h /^#define GRAPH_IFACE_H$/;" d GRAPH_INLINE_H showgraph/Graph/graph_inline.h /^#define GRAPH_INLINE_H$/;" d GRAPH_MARKER_CLEAN showgraph/Graph/marker.h /^const MarkerValue GRAPH_MARKER_CLEAN = 0;$/;" v GRAPH_MARKER_FIRST showgraph/Graph/marker.h /^const MarkerValue GRAPH_MARKER_FIRST = 1;$/;" v GRAPH_MARKER_LAST showgraph/Graph/marker.h /^const MarkerValue GRAPH_MARKER_LAST = ( MarkerValue)( (int)-1);$/;" v GRAPH_MAX_EDGE_NUM showgraph/Graph/predecls.h /^const GraphNum GRAPH_MAX_EDGE_NUM = ( GraphNum)( -1);$/;" v GRAPH_MAX_NODE_NUM showgraph/Graph/predecls.h /^const GraphNum GRAPH_MAX_NODE_NUM = ( GraphNum)( -1);$/;" v GRAPH_PREDECLS_H showgraph/Graph/predecls.h /^#define GRAPH_PREDECLS_H$/;" d GRAPH_VIEW_H showgraph/GraphView/graph_view.h /^#define GRAPH_VIEW_H$/;" d GRAPH_VIEW_MODES_NUM showgraph/GraphView/graph_view.h /^ GRAPH_VIEW_MODES_NUM$/;" e enum:GraphViewMode GSTYLE_H showgraph/GraphView/gstyle.h /^#define GSTYLE_H$/;" d GStyle showgraph/GraphView/gstyle.h /^GStyle::GStyle( QDomElement e ): $/;" f class:GStyle GStyle showgraph/GraphView/gstyle.h /^GStyle::GStyle( QString nm, const GStyle& st)$/;" f class:GStyle GStyle showgraph/GraphView/gstyle.h /^class GStyle$/;" c GStyle showgraph/GraphView/gstyle.h /^inline GStyle::GStyle( const GStyle& st)$/;" f class:GStyle GStyle showgraph/GraphView/gstyle.h /^inline GStyle::GStyle(): $/;" f class:GStyle GVIEW_ASSERTD showgraph/GraphView/gview_iface.h /^# define GVIEW_ASSERTD(/;" d GVIEW_IFACE_H showgraph/GraphView/gview_iface.h /^#define GVIEW_IFACE_H$/;" d GVIEW_IMPL_H showgraph/GraphView/gview_impl.h /^#define GVIEW_IMPL_H$/;" d GetOptList makedb/optlist.cpp /^option_t *GetOptList(int argc, char* argv[], char* options)$/;" f GetPeerInDir showgraph/Utils/list.h /^ inline ListItem * GetPeerInDir( ListDir dir) const$/;" f class:ListItem GetTmpSrc showgraph/GraphView/graph_view.h /^ inline GNode* GetTmpSrc()$/;" f class:GraphView GoToLine_ButtonClick gui/fileviewer.cpp /^void fileviewer::GoToLine_ButtonClick(bool checked)$/;" f class:fileviewer Graph showgraph/Graph/graph.cpp /^Graph::Graph( bool create_pools):$/;" f class:Graph Graph showgraph/Graph/graph.h /^class Graph: public MarkerManager, public NumManager, public QDomDocument$/;" c GraphDir showgraph/Graph/predecls.h /^enum GraphDir$/;" g GraphNum showgraph/Graph/predecls.h /^typedef quint32 GraphNum;$/;" t GraphUid showgraph/Graph/predecls.h /^typedef quint64 GraphUid;$/;" t GraphView showgraph/GraphView/graph_view.cpp /^GraphView::GraphView(): $/;" f class:GraphView GraphView showgraph/GraphView/graph_view.h /^class GraphView: public QGraphicsView$/;" c GraphViewHistory showgraph/GraphView/graph_view.h /^ GraphViewHistory(): events()$/;" f class:GraphViewHistory GraphViewHistory showgraph/GraphView/graph_view.h /^class GraphViewHistory$/;" c GraphViewMode showgraph/GraphView/graph_view.h /^enum GraphViewMode$/;" g Graph_ButtonClick gui/searchhandler.cpp /^void searchhandler::Graph_ButtonClick(bool checked)$/;" f class:searchhandler HELPER_STATE_INITIAL showgraph/GraphView/edge_helper.h /^ HELPER_STATE_INITIAL,$/;" e enum:EdgeHelperState HELPER_STATE_REGULAR showgraph/GraphView/edge_helper.h /^ HELPER_STATE_REGULAR$/;" e enum:EdgeHelperState HIGHLIGHTER_H gui/obsolete/highlighter.h /^ #define HIGHLIGHTER_H$/;" d Highlighter gui/obsolete/highlighter.cpp /^ Highlighter::Highlighter(QTextDocument *parent)$/;" f class:Highlighter Highlighter gui/obsolete/highlighter.h /^ class Highlighter : public QSyntaxHighlighter$/;" c HighlightingRule gui/obsolete/highlighter.h /^ struct HighlightingRule$/;" s class:Highlighter IMAGE_EXPORT_SCALE_FACTOR showgraph/showgraph.cpp /^const int IMAGE_EXPORT_SCALE_FACTOR = 2;$/;" v IMAGE_RECT_ADJUST showgraph/showgraph.cpp /^const qreal IMAGE_RECT_ADJUST = 10;$/;" v ITERATE_GRAPH_EDGES showgraph/Graph/graph_iface.h /^#define ITERATE_GRAPH_EDGES(/;" d ITERATE_GRAPH_NODES showgraph/Graph/graph_iface.h /^#define ITERATE_GRAPH_NODES(/;" d ITERATE_NODE_EDGES showgraph/Graph/graph_iface.h /^#define ITERATE_NODE_EDGES(/;" d ITERATE_NODE_PREDS showgraph/Graph/graph_iface.h /^#define ITERATE_NODE_PREDS(/;" d ITERATE_NODE_SUCCS showgraph/Graph/graph_iface.h /^#define ITERATE_NODE_SUCCS(/;" d IndentSize showgraph/Graph/predecls.h /^const int IndentSize = 4;$/;" v IterImplBase showgraph/Graph/node_iter.h /^ inline IterImplBase(): edge_p( NULL) {}$/;" f class:IterImplBase IterImplBase showgraph/Graph/node_iter.h /^class IterImplBase$/;" c LANGTABLE_H_CQ gui/langtable.h /^#define LANGTABLE_H_CQ$/;" d LAYOUT_ASSERTD showgraph/Layout/layout_iface.h /^# define LAYOUT_ASSERTD(/;" d LAYOUT_IFACE_H showgraph/Layout/layout_iface.h /^#define LAYOUT_IFACE_H$/;" d LEFT_SECTOR showgraph/GraphView/navigation.h /^ LEFT_SECTOR,$/;" e enum:NavSector LISTHANDLER_H_CQ gui/listhandler.h /^#define LISTHANDLER_H_CQ$/;" d LISTS_NUM showgraph/Utils/list_utest.cpp /^ LISTS_NUM$/;" e enum:ListTypes file: LIST_DIR_DEFAULT showgraph/Utils/list.h /^ LIST_DIR_DEFAULT = LIST_DIR_RIGHT,$/;" e enum:ListDir LIST_DIR_LEFT showgraph/Utils/list.h /^ LIST_DIR_LEFT = 1,$/;" e enum:ListDir LIST_DIR_NUM showgraph/Utils/list.h /^ LIST_DIR_NUM = 2$/;" e enum:ListDir LIST_DIR_RDEFAULT showgraph/Utils/list.h /^ LIST_DIR_RDEFAULT = LIST_DIR_LEFT,$/;" e enum:ListDir LIST_DIR_RIGHT showgraph/Utils/list.h /^ LIST_DIR_RIGHT = 0,$/;" e enum:ListDir LIST_H showgraph/Utils/list.h /^#define LIST_H$/;" d LIST_ONE showgraph/Utils/list_utest.cpp /^ LIST_ONE,$/;" e enum:ListTypes file: LIST_TWO showgraph/Utils/list_utest.cpp /^ LIST_TWO,$/;" e enum:ListTypes file: LanguageTriggered gui/mainwindow.cpp /^void mainwindow::LanguageTriggered(bool checked)$/;" f class:mainwindow Level showgraph/Layout/aux_graph.h /^ inline Level( Rank r): level_rank( r), node_list(), _height( 0), y_pos( 0){};$/;" f class:Level Level showgraph/Layout/aux_graph.h /^ inline Level(): level_rank( 0), node_list(), _height( 0), y_pos( 0){};$/;" f class:Level Level showgraph/Layout/aux_graph.h /^class Level$/;" c LineNumberArea gui/obsolete/CodeEditor.h /^ LineNumberArea(CodeEditor *editor) : QWidget(editor) {$/;" f class:LineNumberArea LineNumberArea gui/obsolete/CodeEditor.h /^ class LineNumberArea : public QWidget$/;" c ListDir showgraph/Utils/list.h /^enum ListDir$/;" g ListId showgraph/Utils/list.h /^typedef quint16 ListId;$/;" t ListItem showgraph/Utils/list.h /^ ListItem( Data* d)$/;" f class:ListItem ListItem showgraph/Utils/list.h /^ ListItem( ListItem *peer, Data* d)$/;" f class:ListItem ListItem showgraph/Utils/list.h /^ ListItem( ListItem *peer, ListDir dir, Data *d)$/;" f class:ListItem ListItem showgraph/Utils/list.h /^ ListItem()$/;" f class:ListItem ListItem showgraph/Utils/list.h /^template class ListItem$/;" c ListRDir showgraph/Utils/list.h /^ListRDir( ListDir dir)$/;" f ListTypes showgraph/Utils/list_utest.cpp /^enum ListTypes$/;" g file: MAINWINDOW_H_CQ gui/mainwindow.h /^#define MAINWINDOW_H_CQ$/;" d MAX_CHUNK_ENTRIES_NUM showgraph/Utils/mem.h /^ const quint8 MAX_CHUNK_ENTRIES_NUM = ( quint8)( -1);$/;" m namespace:MemImpl MAX_CHUNK_ENTRIES_NUM showgraph/Utils/mem.h /^ const quint8 MAX_CHUNK_ENTRIES_NUM = 2;$/;" m namespace:MemImpl MAX_COT_VERTICAL showgraph/GraphView/visible_edge.cpp /^const qreal MAX_COT_VERTICAL = 0.1;$/;" v MAX_DELETED_ITEMS_COUNT showgraph/GraphView/graph_view.h /^ static const int MAX_DELETED_ITEMS_COUNT = 10000;$/;" m class:GraphView MAX_DELETED_ITEMS_COUNT showgraph/GraphView/graph_view.h /^ static const int MAX_DELETED_ITEMS_COUNT = 100;$/;" m class:GraphView MAX_GRAPH_MARKERS showgraph/Graph/marker.h /^const short int MAX_GRAPH_MARKERS = 10;$/;" v MAX_NUMERATIONS showgraph/Graph/num.h /^const short int MAX_NUMERATIONS = 10;$/;" v MAX_OPACITY showgraph/GraphView/gview_iface.h /^const qreal MAX_OPACITY = 6;$/;" v MAX_PLACE_LEN showgraph/GraphView/gview_impl.h /^const int MAX_PLACE_LEN = 3;$/;" v MAX_PRIORITY showgraph/GraphView/gview_impl.h /^const int MAX_PRIORITY = 6;$/;" v MAX_TAN_HORIZONTAL showgraph/GraphView/visible_edge.cpp /^const qreal MAX_TAN_HORIZONTAL = 0.1;$/;" v MAX_VISIBLE_LEN showgraph/GraphView/gview_impl.h /^const int MAX_VISIBLE_LEN = 3;$/;" v MEM_ASSERTD showgraph/Utils/mem.h /^# define MEM_ASSERTD(/;" d MEM_CHUNK_H showgraph/Utils/mem_chunk.h /^#define MEM_CHUNK_H$/;" d MEM_ENTRY_H showgraph/Utils/mem_entry.h /^#define MEM_ENTRY_H$/;" d MEM_FIXED_POOL_H showgraph/Utils/mem_fixed_pool.h /^#define MEM_FIXED_POOL_H$/;" d MEM_H showgraph/Utils/mem.h /^#define MEM_H$/;" d MEM_MGR_H showgraph/Utils/mem_mgr.h /^#define MEM_MGR_H$/;" d MEM_OBJ_H showgraph/Utils/mem_obj.h /^#define MEM_OBJ_H$/;" d MEM_POOL_H showgraph/Utils/mem_pool.h /^#define MEM_POOL_H$/;" d MEM_REF_H showgraph/Utils/mem_ref.h /^#define MEM_REF_H$/;" d MISC_H showgraph/Utils/misc.h /^#define MISC_H$/;" d MListIface showgraph/Utils/list.h /^ inline MListIface( Item *peer):$/;" f class:MListIface MListIface showgraph/Utils/list.h /^ inline MListIface( Item *peer, ListDir dir):$/;" f class:MListIface MListIface showgraph/Utils/list.h /^ inline MListIface( ListId list, Item *peer):$/;" f class:MListIface MListIface showgraph/Utils/list.h /^ inline MListIface( ListId list, Item *peer, ListDir dir):$/;" f class:MListIface MListIface showgraph/Utils/list.h /^ inline MListIface(): ListBase(){};$/;" f class:MListIface MListIface showgraph/Utils/list.h /^ inline MListIface():$/;" f class:MListIface MListIface showgraph/Utils/list.h /^template < class Item, class ListBase, unsigned int dim> class MListIface: public ListBase$/;" c MListIface showgraph/Utils/list.h /^template< class Item, class ListBase> class MListIface< Item, ListBase, 1>: public ListBase$/;" c MListItem showgraph/Utils/list.h /^ MListItem( ListId list, MListItem< dim> *peer)$/;" f class:MListItem MListItem showgraph/Utils/list.h /^ MListItem( ListId list, MListItem< dim> *peer, ListDir dir)$/;" f class:MListItem MListItem showgraph/Utils/list.h /^ MListItem( MListItem< 1> *peer)$/;" f class:MListItem MListItem showgraph/Utils/list.h /^ MListItem( MListItem< 1> *peer, ListDir dir)$/;" f class:MListItem MListItem showgraph/Utils/list.h /^ MListItem()$/;" f class:MListItem MListItem showgraph/Utils/list.h /^template class MListItem$/;" c MListItem showgraph/Utils/list.h /^template<> class MListItem<1>$/;" c M_ERROR_GENERIC showgraph/Graph/marker.h /^ M_ERROR_GENERIC,$/;" e enum:MarkerErrorType_e M_ERROR_NUM showgraph/Graph/marker.h /^ M_ERROR_NUM$/;" e enum:MarkerErrorType_e M_ERROR_OUT_OF_INDEXES showgraph/Graph/marker.h /^ M_ERROR_OUT_OF_INDEXES,$/;" e enum:MarkerErrorType_e M_ERROR_OUT_OF_VALUES showgraph/Graph/marker.h /^ M_ERROR_OUT_OF_VALUES,$/;" e enum:MarkerErrorType_e MakeOpt makedb/optlist.cpp /^option_t *MakeOpt(const char option, char *const argument, const int index)$/;" f Marked showgraph/Graph/marker.h /^class Marked$/;" c Marked showgraph/Graph/marker.h /^inline Marked::Marked()$/;" f class:Marked Marker showgraph/Graph/marker.h /^class Marker$/;" c Marker showgraph/Graph/marker.h /^inline Marker::Marker(): $/;" f class:Marker MarkerErrorType showgraph/Graph/marker.h /^} MarkerErrorType;$/;" t typeref:enum:MarkerErrorType_e MarkerErrorType_e showgraph/Graph/marker.h /^typedef enum MarkerErrorType_e$/;" g MarkerIndex showgraph/Graph/marker.h /^typedef unsigned short int MarkerIndex;$/;" t MarkerManager showgraph/Graph/marker.h /^class MarkerManager$/;" c MarkerManager showgraph/Graph/marker.h /^inline MarkerManager::MarkerManager()$/;" f class:MarkerManager MarkerValue showgraph/Graph/marker.h /^typedef unsigned int MarkerValue;$/;" t MatchOpt makedb/optlist.cpp /^int MatchOpt(const char argument, char *const options)$/;" f Mem showgraph/Utils/mem.h /^namespace Mem$/;" n Mem showgraph/Utils/mem_fixed_pool.h /^namespace Mem$/;" n Mem showgraph/Utils/mem_obj.h /^namespace Mem$/;" n Mem showgraph/Utils/mem_pool.h /^namespace Mem$/;" n Mem showgraph/Utils/mem_ref.h /^namespace Mem$/;" n MemEventId showgraph/Utils/mem_mgr.h /^ typedef quint64 MemEventId;$/;" t namespace:MemImpl MemImpl showgraph/Utils/mem.h /^namespace MemImpl$/;" n MemImpl showgraph/Utils/mem_chunk.h /^namespace MemImpl$/;" n MemImpl showgraph/Utils/mem_entry.h /^namespace MemImpl$/;" n MemImpl showgraph/Utils/mem_mgr.h /^namespace MemImpl$/;" n MemInfo showgraph/Utils/mem_mgr.cpp /^MemInfo::MemInfo()$/;" f class:MemInfo MemInfo showgraph/Utils/mem_mgr.h /^ MemInfo( const MemInfo&){};$/;" f class:MemImpl::MemInfo MemInfo showgraph/Utils/mem_mgr.h /^ class MemInfo$/;" c namespace:MemImpl MemMgr showgraph/Utils/mem.h /^ typedef Single< MemImpl::MemInfo> MemMgr;$/;" t namespace:Mem ModeEdit showgraph/GraphView/edge_item.h /^ ModeEdit$/;" e enum:EdgeItem::EdgeMode ModeShow showgraph/GraphView/edge_item.h /^ ModeShow,$/;" e enum:EdgeItem::EdgeMode MyPoolObj showgraph/Utils/mem_utest.cpp /^class MyPoolObj: public PoolBase, public SListIface< MyPoolObj, SListItem>$/;" c file: NAVIGATION_H showgraph/GraphView/navigation.h /^#define NAVIGATION_H$/;" d NAV_DIR_DOWN showgraph/GraphView/navigation.h /^ NAV_DIR_DOWN,$/;" e enum:NavDirection NAV_DIR_LEFT showgraph/GraphView/navigation.h /^ NAV_DIR_LEFT,$/;" e enum:NavDirection NAV_DIR_RIGHT showgraph/GraphView/navigation.h /^ NAV_DIR_RIGHT$/;" e enum:NavDirection NAV_DIR_UP showgraph/GraphView/navigation.h /^ NAV_DIR_UP,$/;" e enum:NavDirection NAV_EVENT_NODE_FOCUS showgraph/GraphView/graph_view.h /^ NAV_EVENT_NODE_FOCUS,$/;" e enum:NavEventType NAV_EVENT_TYPES_NUM showgraph/GraphView/graph_view.h /^ NAV_EVENT_TYPES_NUM$/;" e enum:NavEventType NODE_CONTROL_MARGIN showgraph/Layout/layout_iface.h /^const qreal NODE_CONTROL_MARGIN = 5;$/;" v NODE_GROUP_H showgraph/Layout/node_group.h /^#define NODE_GROUP_H$/;" d NODE_H showgraph/Graph/node.h /^#define NODE_H$/;" d NODE_INLINE_H showgraph/Graph/node_inline.h /^#define NODE_INLINE_H$/;" d NODE_ITER_H showgraph/Graph/node_iter.h /^#define NODE_ITER_H$/;" d NODE_NODE_MARGIN showgraph/Layout/layout_iface.h /^const qreal NODE_NODE_MARGIN = 30;$/;" v NODE_SHAPES_NUM showgraph/GraphView/gstyle.h /^ NODE_SHAPES_NUM $/;" e enum:NodeShape NODE_SHAPE_BOX showgraph/GraphView/gstyle.h /^ NODE_SHAPE_BOX,$/;" e enum:NodeShape NODE_SHAPE_CIRCLE showgraph/GraphView/gstyle.h /^ NODE_SHAPE_CIRCLE,$/;" e enum:NodeShape NODE_SHAPE_DEFAULT showgraph/GraphView/gstyle.h /^ NODE_SHAPE_DEFAULT = NODE_SHAPE_BOX,$/;" e enum:NodeShape NODE_SHAPE_DIAMOND showgraph/GraphView/gstyle.h /^ NODE_SHAPE_DIAMOND,$/;" e enum:NodeShape NODE_SHAPE_ELLIPSE showgraph/GraphView/gstyle.h /^ NODE_SHAPE_ELLIPSE,$/;" e enum:NodeShape NODE_SHAPE_ROUNDED_BOX showgraph/GraphView/gstyle.h /^ NODE_SHAPE_ROUNDED_BOX,$/;" e enum:NodeShape NODE_SPEED showgraph/GraphView/gview_impl.h /^const qreal NODE_SPEED = 4;$/;" v NODE_W_H showgraph/GraphView/node_item.h /^#define NODE_W_H$/;" d NUMBER_MAX showgraph/Graph/num.h /^const GraphNum NUMBER_MAX = (( GraphNum) -1) - 1;$/;" v NUMBER_NO_NUM showgraph/Graph/num.h /^const GraphNum NUMBER_NO_NUM = ( GraphNum) -1;$/;" v NUM_ERROR_GENERIC showgraph/Graph/num.h /^ NUM_ERROR_GENERIC,$/;" e enum:NumErrorType NUM_ERROR_NUM showgraph/Graph/num.h /^ NUM_ERROR_NUM$/;" e enum:NumErrorType NUM_ERROR_NUMBER_OUT_OF_RANGE showgraph/Graph/num.h /^ NUM_ERROR_NUMBER_OUT_OF_RANGE,$/;" e enum:NumErrorType NUM_ERROR_OUT_OF_INDEXES showgraph/Graph/num.h /^ NUM_ERROR_OUT_OF_INDEXES,$/;" e enum:NumErrorType NUM_ERROR_OUT_OF_VALUES showgraph/Graph/num.h /^ NUM_ERROR_OUT_OF_VALUES,$/;" e enum:NumErrorType NUM_OF_THEMES gui/themes_gen.cpp /^#define NUM_OF_THEMES /;" d file: NUM_VAL_CLEAN showgraph/Graph/num.h /^const NumValue NUM_VAL_CLEAN = 0;$/;" v NUM_VAL_FIRST showgraph/Graph/num.h /^const NumValue NUM_VAL_FIRST = 1;$/;" v NUM_VAL_LAST showgraph/Graph/num.h /^const NumValue NUM_VAL_LAST = ( NumValue)( (int)-1);$/;" v NavDirection showgraph/GraphView/navigation.h /^enum NavDirection$/;" g NavEvent showgraph/GraphView/graph_view.h /^ inline NavEvent( NavEventType t): type( t)$/;" f class:NavEvent NavEvent showgraph/GraphView/graph_view.h /^ inline NavEvent( NavEventType t, GNode *n): type( t)$/;" f class:NavEvent NavEvent showgraph/GraphView/graph_view.h /^class NavEvent$/;" c NavEventData showgraph/GraphView/graph_view.h /^ union NavEventData$/;" u class:NavEvent NavEventType showgraph/GraphView/graph_view.h /^enum NavEventType$/;" g NavSector showgraph/GraphView/navigation.h /^enum NavSector$/;" g NextSearch_ButtonClick gui/searchhandler.cpp /^void searchhandler::NextSearch_ButtonClick(bool checked)$/;" f class:searchhandler Next_ButtonClick gui/fileviewer.cpp /^void fileviewer::Next_ButtonClick(bool checked)$/;" f class:fileviewer Node showgraph/Graph/node.h /^class Node: public Marked, public Numbered, public PoolObj, public SListIface< Node>$/;" c Node showgraph/Graph/node_inline.h /^inline Node::Node( Graph *_graph_p, GraphUid _id):uid(_id), graph_p( _graph_p), element()$/;" f class:Node NodeGroup showgraph/Layout/node_group.cpp /^NodeGroup::NodeGroup( AuxNode *n, \/\/ Parent node$/;" f class:NodeGroup NodeGroup showgraph/Layout/node_group.h /^ NodeGroup() : node_list()$/;" f class:NodeGroup NodeGroup showgraph/Layout/node_group.h /^class NodeGroup$/;" c NodeItem showgraph/GraphView/node_item.h /^ inline NodeItem( GNode *n_p):$/;" f class:NodeItem NodeItem showgraph/GraphView/node_item.h /^class NodeItem: public QGraphicsTextItem$/;" c NodeNav showgraph/GraphView/navigation.cpp /^NodeNav::NodeNav( GNode *curr_node, NavSector nav_sector):$/;" f class:NodeNav NodeNav showgraph/GraphView/navigation.h /^class NodeNav$/;" c NodeShape showgraph/GraphView/gstyle.h /^enum NodeShape$/;" g NumErrorType showgraph/Graph/num.h /^enum NumErrorType$/;" g NumIndex showgraph/Graph/num.h /^typedef unsigned short int NumIndex;$/;" t NumManager showgraph/Graph/num.h /^class NumManager$/;" c NumManager showgraph/Graph/num.h /^inline NumManager::NumManager()$/;" f class:NumManager NumValue showgraph/Graph/num.h /^typedef unsigned int NumValue;$/;" t Numbered showgraph/Graph/num.h /^class Numbered$/;" c Numbered showgraph/Graph/num.h /^inline Numbered::Numbered()$/;" f class:Numbered Numeration showgraph/Graph/num.h /^class Numeration$/;" c Numeration showgraph/Graph/num.h /^inline Numeration::Numeration():$/;" f class:Numeration OL_NOINDEX makedb/optlist.h /^#define OL_NOINDEX /;" d OPACITY_STEP showgraph/GraphView/gview_impl.h /^const qreal OPACITY_STEP = 0.1;$/;" v OPTLIST_H makedb/optlist.h /^#define OPTLIST_H$/;" d OPT_BOOL showgraph/Utils/conf.h /^ OPT_BOOL,$/;" e enum:OptType OPT_FLOAT showgraph/Utils/conf.h /^ OPT_FLOAT,$/;" e enum:OptType OPT_INT showgraph/Utils/conf.h /^ OPT_INT,$/;" e enum:OptType OPT_STRING showgraph/Utils/conf.h /^ OPT_STRING,$/;" e enum:OptType OPT_TYPES_NUM showgraph/Utils/conf.h /^ OPT_TYPES_NUM$/;" e enum:OptType Obj showgraph/Utils/mem_obj.h /^ inline Obj() $/;" f class:Mem::Obj Obj showgraph/Utils/mem_obj.h /^ class Obj$/;" c namespace:Mem ObjRef showgraph/Utils/mem_utest.cpp /^typedef Ref< TestObj> ObjRef;$/;" t file: OpenDB_ButtonClick gui/searchhandler.cpp /^void searchhandler::OpenDB_ButtonClick(bool checked)$/;" f class:searchhandler OpenDB_indexChanged gui/searchhandler.cpp /^void searchhandler::OpenDB_indexChanged(const int& idx)$/;" f class:searchhandler OpenInEditor_ButtonClick gui/fileviewer.cpp /^void fileviewer::OpenInEditor_ButtonClick(bool checked)$/;" f class:fileviewer OptType showgraph/Utils/conf.h /^enum OptType$/;" g OptValues showgraph/Utils/conf.h /^union OptValues$/;" u Option showgraph/Utils/conf.h /^ Option( OptType _t, QString sname, QString lname, QString d):$/;" f class:Option Option showgraph/Utils/conf.h /^ Option( QString sname, QString lname, QString d):$/;" f class:Option Option showgraph/Utils/conf.h /^ Option( QString sname, QString lname, QString d, bool val):$/;" f class:Option Option showgraph/Utils/conf.h /^class Option$/;" c OptionsExtEditor_Triggered gui/fileviewer.cpp /^void fileviewer::OptionsExtEditor_Triggered(bool checked)$/;" f class:fileviewer POOL_FIXED showgraph/Utils/mem_pool.h /^ POOL_FIXED,$/;" e enum:Mem::PoolType POOL_FLOAT showgraph/Utils/mem_pool.h /^ POOL_FLOAT,$/;" e enum:Mem::PoolType POOL_TYPES_NUM showgraph/Utils/mem_pool.h /^ POOL_TYPES_NUM$/;" e enum:Mem::PoolType PRINT_H showgraph/Utils/print.h /^#define PRINT_H$/;" d Paste_ButtonClick gui/fileviewer.cpp /^void fileviewer::Paste_ButtonClick(bool checked)$/;" f class:fileviewer Pi showgraph/GraphView/gview_impl.h /^static const double Pi = 3.14159265358979323846264338327950288419717;$/;" v Pool showgraph/Utils/mem_pool.h /^ class Pool$/;" c namespace:Mem PoolBase showgraph/Utils/mem_utest.cpp /^class PoolBase: public PoolObj $/;" c file: PoolObj showgraph/Utils/mem_pool.h /^ PoolObj( PoolObj &obj){};$/;" f class:Mem::PoolObj PoolObj showgraph/Utils/mem_pool.h /^ PoolObj(): to_be_deleted( false){};$/;" f class:Mem::PoolObj PoolObj showgraph/Utils/mem_pool.h /^ inline PoolObj(){};$/;" f class:Mem::PoolObj PoolObj showgraph/Utils/mem_pool.h /^ class PoolObj$/;" c namespace:Mem PoolType showgraph/Utils/mem_pool.h /^ enum PoolType$/;" g namespace:Mem Pred showgraph/Graph/node.h /^ typedef EdgeIterIface< PredIterImpl> Pred; \/**< Iterator for predecessors *\/$/;" t class:Node PredIterImpl showgraph/Graph/node_inline.h /^inline PredIterImpl::PredIterImpl( Node *n)$/;" f class:PredIterImpl PredIterImpl showgraph/Graph/node_iter.h /^ inline PredIterImpl(){}; \/**< Default constructor *\/$/;" f class:PredIterImpl PredIterImpl showgraph/Graph/node_iter.h /^class PredIterImpl: public IterImplBase$/;" c PrevSearch_ButtonClick gui/searchhandler.cpp /^void searchhandler::PrevSearch_ButtonClick(bool checked)$/;" f class:searchhandler Prev_ButtonClick gui/fileviewer.cpp /^void fileviewer::Prev_ButtonClick(bool checked)$/;" f class:fileviewer PrintUtils showgraph/Utils/print.h /^namespace PrintUtils$/;" n Q_OBJECT showgraph/GraphView/graph_view.h /^ Q_OBJECT; \/** For MOC *\/$/;" m class:GraphView Q_OBJECT showgraph/GraphView/style_edit.h /^ Q_OBJECT;$/;" m class:StyleEdit Q_OBJECT showgraph/Layout/aux_graph.h /^ Q_OBJECT;$/;" m class:AuxGraph QueryType_indexChanged gui/searchhandler.cpp /^void searchhandler::QueryType_indexChanged(const int& idx)$/;" f class:searchhandler RANK_SPACING showgraph/Layout/layout_iface.h /^const qreal RANK_SPACING = 40;$/;" v RANK_UNDEF showgraph/Layout/layout_iface.h /^const Rank RANK_UNDEF = (Rank) (-1);$/;" v RIGHT_SECTOR showgraph/GraphView/navigation.h /^ RIGHT_SECTOR,$/;" e enum:NavSector Rank showgraph/Layout/layout_iface.h /^typedef unsigned int Rank;$/;" t Ref showgraph/Utils/mem_ref.h /^ Ref( RefObj* p): ptr( p)$/;" f class:Mem::Ref Ref showgraph/Utils/mem_ref.h /^ Ref( const Ref< RefObj>& orig): ptr( orig.ptr)$/;" f class:Mem::Ref Ref showgraph/Utils/mem_ref.h /^ Ref(): ptr( NULL){};$/;" f class:Mem::Ref Ref showgraph/Utils/mem_ref.h /^ template < class RefObj> class Ref$/;" c namespace:Mem RefNumber showgraph/Utils/mem_obj.h /^ typedef unsigned int RefNumber;$/;" t namespace:Mem RevDir showgraph/Graph/predecls.h /^RevDir( GraphDir dir)$/;" f SEARCHHANDLER_H_CQ gui/searchhandler.h /^#define SEARCHHANDLER_H_CQ$/;" d SELF_EDGE showgraph/Layout/aux_edge.h /^ SELF_EDGE,$/;" e enum:AuxEdgeType SE_HOR_MARGIN showgraph/GraphView/gview_impl.h /^const qreal SE_HOR_MARGIN = 20;$/;" v SE_VERT_MARGIN showgraph/GraphView/gview_impl.h /^const qreal SE_VERT_MARGIN = 20;$/;" v SHOWGRAPH_H_CQ showgraph/showgraph.h /^#define SHOWGRAPH_H_CQ$/;" d SIMPLE_DFS showgraph/Layout/layout.cpp /^#define SIMPLE_DFS$/;" d file: SINGLETON_H showgraph/Utils/singleton.h /^#define SINGLETON_H$/;" d SListIface showgraph/Utils/list.h /^ inline SListIface( Item *peer):$/;" f class:SListIface SListIface showgraph/Utils/list.h /^ inline SListIface( Item *peer, ListDir dir):$/;" f class:SListIface SListIface showgraph/Utils/list.h /^ inline SListIface():$/;" f class:SListIface SListIface showgraph/Utils/list.h /^template< class Item, class ListBase=SListItem> class SListIface: public ListBase$/;" c SListItem showgraph/Utils/list.h /^typedef MListItem< 1> SListItem;$/;" t SMALL_LIB_H_CQ querylib/small_lib.h /^#define SMALL_LIB_H_CQ$/;" d SQLBASE_H_CQ makedb/sqlbase.h /^#define SQLBASE_H_CQ$/;" d SQLQUERYADV_H_CQ gui/sqlqueryadv.h /^#define SQLQUERYADV_H_CQ$/;" d SQLQUERY_H_CQ querylib/sqlquery.h /^#define SQLQUERY_H_CQ$/;" d SQL_AUTOCOMPLETE querylib/sqlquery.cpp /^#define SQL_AUTOCOMPLETE /;" d file: SQL_CALLEDFUNC querylib/sqlquery.cpp /^#define SQL_CALLEDFUNC /;" d file: SQL_CALLINGFUNC querylib/sqlquery.cpp /^#define SQL_CALLINGFUNC /;" d file: SQL_CALLS_OF_FUNC querylib/sqlquery.cpp /^#define SQL_CALLS_OF_FUNC /;" d file: SQL_CHILDCLASS querylib/sqlquery.cpp /^#define SQL_CHILDCLASS /;" d file: SQL_CLASS_STRUCT querylib/sqlquery.cpp /^#define SQL_CLASS_STRUCT /;" d file: SQL_EM_CALLEDFUNC querylib/sqlquery.cpp /^#define SQL_EM_CALLEDFUNC /;" d file: SQL_EM_CALLINGFUNC querylib/sqlquery.cpp /^#define SQL_EM_CALLINGFUNC /;" d file: SQL_EM_CALLS_OF_FUNC querylib/sqlquery.cpp /^#define SQL_EM_CALLS_OF_FUNC /;" d file: SQL_EM_CHILDCLASS querylib/sqlquery.cpp /^#define SQL_EM_CHILDCLASS /;" d file: SQL_EM_CLASS_STRUCT querylib/sqlquery.cpp /^#define SQL_EM_CLASS_STRUCT /;" d file: SQL_EM_FILEPATH querylib/sqlquery.cpp /^#define SQL_EM_FILEPATH /;" d file: SQL_EM_FUNC_MACRO querylib/sqlquery.cpp /^#define SQL_EM_FUNC_MACRO /;" d file: SQL_EM_INCLUDE querylib/sqlquery.cpp /^#define SQL_EM_INCLUDE /;" d file: SQL_EM_MEMBERS querylib/sqlquery.cpp /^#define SQL_EM_MEMBERS /;" d file: SQL_EM_OWNERCLASS querylib/sqlquery.cpp /^#define SQL_EM_OWNERCLASS /;" d file: SQL_EM_PARENTCLASS querylib/sqlquery.cpp /^#define SQL_EM_PARENTCLASS /;" d file: SQL_EM_SYM querylib/sqlquery.cpp /^#define SQL_EM_SYM /;" d file: SQL_FILEPATH querylib/sqlquery.cpp /^#define SQL_FILEPATH /;" d file: SQL_FUNCSINFILE querylib/sqlquery.cpp /^#define SQL_FUNCSINFILE /;" d file: SQL_FUNC_MACRO querylib/sqlquery.cpp /^#define SQL_FUNC_MACRO /;" d file: SQL_INCLUDE querylib/sqlquery.cpp /^#define SQL_INCLUDE /;" d file: SQL_MEMBERS querylib/sqlquery.cpp /^#define SQL_MEMBERS /;" d file: SQL_OWNERCLASS querylib/sqlquery.cpp /^#define SQL_OWNERCLASS /;" d file: SQL_PARENTCLASS querylib/sqlquery.cpp /^#define SQL_PARENTCLASS /;" d file: SQL_SYM querylib/sqlquery.cpp /^#define SQL_SYM /;" d file: STD2QT_H_CQ gui/std2qt.h /^#define STD2QT_H_CQ$/;" d STYLE_EDIT_H showgraph/GraphView/style_edit.h /^#define STYLE_EDIT_H$/;" d SWVER_H_CQ makedb/swver.h /^#define SWVER_H_CQ$/;" d Search_ButtonClick gui/searchhandler.cpp /^void searchhandler::Search_ButtonClick(bool checked)$/;" f class:searchhandler Search_EnterKeyPressed gui/searchhandler.cpp /^void searchhandler::Search_EnterKeyPressed()$/;" f class:searchhandler SetCreateEdge showgraph/GraphView/graph_view.h /^ inline void SetCreateEdge( bool val)$/;" f class:GraphView SetInitFlags showgraph/GraphView/node_item.cpp /^NodeItem::SetInitFlags()$/;" f class:NodeItem SetNext showgraph/Utils/list.h /^ inline void SetNext( ListItem *n)$/;" f class:ListItem SetPeerInDir showgraph/Utils/list.h /^ inline void SetPeerInDir( ListItem *p, ListDir dir)$/;" f class:ListItem SetPrev showgraph/Utils/list.h /^ inline void SetPrev( ListItem *p)$/;" f class:ListItem SetTmpSrc showgraph/GraphView/graph_view.h /^ inline void SetTmpSrc( GNode* node)$/;" f class:GraphView SimpleDfsStepInfo showgraph/Layout/aux_graph.h /^ SimpleDfsStepInfo( AuxNode *n)$/;" f struct:AuxGraph::SimpleDfsStepInfo SimpleDfsStepInfo showgraph/Layout/aux_graph.h /^ SimpleDfsStepInfo( AuxNode *n, GraphDir dir)$/;" f struct:AuxGraph::SimpleDfsStepInfo SimpleDfsStepInfo showgraph/Layout/aux_graph.h /^ struct SimpleDfsStepInfo$/;" s class:AuxGraph Single showgraph/Utils/singleton.h /^template < class T> class Single$/;" c SingleA showgraph/Utils/utils_utest.cpp /^typedef Single< classA> SingleA;$/;" t file: StyleEdit showgraph/GraphView/style_edit.cpp /^StyleEdit::StyleEdit( QWidget *parent, bool show_additional)$/;" f class:StyleEdit StyleEdit showgraph/GraphView/style_edit.h /^class StyleEdit: public QDialog$/;" c StyleEditInfo showgraph/GraphView/graph_view.h /^ StyleEditInfo( GEdge* e, GStyle *olds, GStyle *news, StyleEdit* d):$/;" f struct:GraphView::StyleEditInfo StyleEditInfo showgraph/GraphView/graph_view.h /^ StyleEditInfo( GNode* n, GStyle *olds, GStyle *news, StyleEdit* d):$/;" f struct:GraphView::StyleEditInfo StyleEditInfo showgraph/GraphView/graph_view.h /^ struct StyleEditInfo$/;" s class:GraphView StyleId showgraph/GraphView/gstyle.h /^typedef quint32 StyleId;$/;" t Succ showgraph/Graph/node.h /^ typedef EdgeIterIface< SuccIterImpl> Succ; \/**< Iterator for successors *\/$/;" t class:Node SuccIterImpl showgraph/Graph/node_inline.h /^inline SuccIterImpl::SuccIterImpl( Node *n)$/;" f class:SuccIterImpl SuccIterImpl showgraph/Graph/node_iter.h /^ inline SuccIterImpl(){}; \/**< Default constructor *\/$/;" f class:SuccIterImpl SuccIterImpl showgraph/Graph/node_iter.h /^class SuccIterImpl: public IterImplBase$/;" c THEMES_H_CQ gui/themes.h /^#define THEMES_H_CQ$/;" d TOP_SECTOR showgraph/GraphView/navigation.h /^ TOP_SECTOR,$/;" e enum:NavSector TREE_EDGE showgraph/Layout/aux_edge.h /^ TREE_EDGE,$/;" e enum:AuxEdgeType TestObj showgraph/Utils/mem_utest.cpp /^class TestObj: public Obj$/;" c file: TextEnlarge_ButtonClick gui/fileviewer.cpp /^void fileviewer::TextEnlarge_ButtonClick(bool checked)$/;" f class:fileviewer TextShrink_ButtonClick gui/fileviewer.cpp /^void fileviewer::TextShrink_ButtonClick(bool checked)$/;" f class:fileviewer TwoPi showgraph/GraphView/gview_impl.h /^static double TwoPi = 2.0 * Pi;$/;" v Type showgraph/GraphView/edge_helper.h /^ enum {Type = TypeEdgeHelper};$/;" e enum:EdgeHelper::__anon7 Type showgraph/GraphView/edge_item.h /^ enum {Type = TypeEdge};$/;" e enum:EdgeItem::__anon8 Type showgraph/GraphView/node_item.h /^ enum {Type = TypeNode};$/;" e enum:NodeItem::__anon10 TypeEdge showgraph/GraphView/gview_iface.h /^ TypeEdge = QGraphicsItem::UserType + 2, \/** Edge item *\/$/;" e enum:__anon9 TypeEdgeControl showgraph/GraphView/gview_iface.h /^ TypeEdgeControl = QGraphicsItem::UserType + 3,\/** EdgeControl item *\/$/;" e enum:__anon9 TypeEdgeHelper showgraph/GraphView/gview_iface.h /^ TypeEdgeHelper = QGraphicsItem::UserType + 4 \/** Edge helper item *\/$/;" e enum:__anon9 TypeNode showgraph/GraphView/gview_iface.h /^ TypeNode = QGraphicsItem::UserType + 1, \/** Node item *\/$/;" e enum:__anon9 ULIST_H showgraph/Utils/ulist.h /^#define ULIST_H$/;" d UNDEF_POS showgraph/Utils/mem.h /^ const ChunkPos UNDEF_POS = MAX_CHUNK_ENTRIES_NUM; $/;" m namespace:MemImpl UNDEF_SECTOR showgraph/GraphView/navigation.h /^ UNDEF_SECTOR$/;" e enum:NavSector UNKNOWN_TYPE_EDGE showgraph/Layout/aux_edge.h /^ UNKNOWN_TYPE_EDGE = 0,$/;" e enum:AuxEdgeType USE_MEM_EVENTS showgraph/Utils/mem.h /^# define USE_MEM_EVENTS$/;" d USE_MEM_EVENTS showgraph/Utils/mem.h /^#undef USE_MEM_EVENTS$/;" d USE_REF_COUNTERS showgraph/Utils/mem.h /^# define USE_REF_COUNTERS$/;" d USE_REF_COUNTERS showgraph/Utils/mem.h /^#undef USE_REF_COUNTERS$/;" d UTILS_IFACE_H showgraph/Utils/utils_iface.h /^#define UTILS_IFACE_H$/;" d Ui gui/aboutdialog.h /^ namespace Ui {$/;" n Ui gui/fileviewsettingsdialog.h /^ namespace Ui {$/;" n Ui gui/graphdialog.h /^ namespace Ui {$/;" n Ui gui/mainwindow.h /^ namespace Ui {$/;" n UnDirIterImpl showgraph/Graph/node_inline.h /^inline UnDirIterImpl::UnDirIterImpl( Node *n)$/;" f class:UnDirIterImpl UnDirIterImpl showgraph/Graph/node_iter.h /^ inline UnDirIterImpl():is_pred( false){}; \/**< Default consturctor *\/$/;" f class:UnDirIterImpl UnDirIterImpl showgraph/Graph/node_iter.h /^class UnDirIterImpl: public IterImplBase$/;" c Up_ButtonClick gui/listhandler.cpp /^void listhandler::Up_ButtonClick(bool checked)$/;" f class:listhandler UpdatePlacement showgraph/GraphView/graph_view.cpp /^void GGraph::UpdatePlacement()$/;" f class:GGraph Utils showgraph/Utils/utils_iface.h /^namespace Utils$/;" n VEdge showgraph/GraphView/visible_edge.cpp /^VEdge::VEdge( GEdge *prototype)$/;" f class:VEdge VEdge showgraph/GraphView/visible_edge.cpp /^VEdge::VEdge( GNode *pred_node, GNode *succ_node):$/;" f class:VEdge VEdge showgraph/GraphView/visible_edge.h /^class VEdge$/;" c VISIBLE_EDGE_H showgraph/GraphView/visible_edge.h /^#define VISIBLE_EDGE_H$/;" d WHOLE_GRAPH_VIEW showgraph/GraphView/graph_view.h /^ WHOLE_GRAPH_VIEW,$/;" e enum:GraphViewMode WinMain gui/winmain.cpp /^int WINAPI WinMain(HINSTANCE, HINSTANCE, LPSTR, int)$/;" f _doc showgraph/GraphView/node_item.h /^ QTextDocument* _doc;$/;" m class:GNode _height showgraph/Layout/aux_graph.h /^ qreal _height;$/;" m class:Level _pool showgraph/Utils/mem_obj.h /^ Pool *_pool;$/;" m class:Mem::Obj _style showgraph/GraphView/edge_item.h /^ GStyle *_style;$/;" m class:GEdge _style showgraph/GraphView/node_item.h /^ GStyle *_style;$/;" m class:GNode _type showgraph/Utils/conf.h /^ OptType _type;$/;" m class:Option a showgraph/Utils/mem_utest.cpp /^ int a;$/;" m class:TestObj file: a showgraph/Utils/mem_utest.cpp /^ quint32 a;$/;" m class:MyPoolObj file: abs showgraph/Utils/misc.h /^template inline Value abs( Value val)$/;" f add showgraph/Layout/aux_graph.h /^ inline void add( AuxNode *node)$/;" f class:Level addNode showgraph/Layout/node_group.h /^ inline void addNode( AuxNode *node)$/;" f class:NodeGroup addOption showgraph/Utils/conf.h /^ inline void addOption( OptType _t, QString sname, QString lname, QString d)$/;" f class:Conf addOption showgraph/Utils/conf.h /^ inline void addOption( Option *opt)$/;" f class:Conf addOption showgraph/Utils/conf.h /^ inline void addOption( QString sname, QString lname, QString d)$/;" f class:Conf addOption showgraph/Utils/conf.h /^ inline void addOption( QString sname, QString lname, QString d, bool val)$/;" f class:Conf addStyle showgraph/GraphView/graph_view.h /^ void addStyle( QString &name, GStyle *style)$/;" f class:GGraph addToSearchMemory gui/searchhandler.cpp /^void searchhandler::addToSearchMemory(const QString& searchtxt, const QString& filtertxt)$/;" f class:searchhandler add_escape_char querylib/small_lib.cpp /^std::string add_escape_char(const char* oristr, char chr2escp, char escpchr)$/;" f add_escape_char querylib/small_lib.cpp /^std::string add_escape_char(std::string ori, char chr2escp, char escpchr)$/;" f add_symbols makedb/cs2sq.cpp /^cs2sq::enResult cs2sq::add_symbols(void)$/;" f class:cs2sq add_symdata makedb/cs2sq.cpp /^cs2sq::enResult cs2sq::add_symdata(symdatalist sdlist, const char* lineid, idxcounter* idx)$/;" f class:cs2sq adjEdgesNum showgraph/Layout/node_group.h /^ inline unsigned int adjEdgesNum() const$/;" f class:NodeGroup adjust showgraph/GraphView/edge_helper.cpp /^EdgeHelper::adjust()$/;" f class:EdgeHelper adjust showgraph/GraphView/edge_item.cpp /^EdgeItem::adjust()$/;" f class:EdgeItem adjustAssociates showgraph/GraphView/node_item.cpp /^void NodeItem::adjustAssociates()$/;" f class:NodeItem adjustScrollBar gui/graphdialog.cpp /^void cqDialogGraph::adjustScrollBar(QScrollBar *scrollBar, double factor)$/;" f class:cqDialogGraph adjustStyles showgraph/GraphView/edge_item.cpp /^GEdge::adjustStyles()$/;" f class:GEdge adjustVerticalLevels showgraph/Layout/layout.cpp /^void AuxGraph::adjustVerticalLevels()$/;" f class:AuxGraph advance showgraph/GraphView/node_item.cpp /^bool NodeItem::advance()$/;" f class:NodeItem advanceNodes showgraph/GraphView/graph_view.cpp /^void GraphView::advanceNodes()$/;" f class:GraphView advanceView showgraph/GraphView/graph_view.cpp /^void GraphView::advanceView()$/;" f class:GraphView allocEvent showgraph/Utils/mem_mgr.cpp /^MemEventId MemInfo::allocEvent()$/;" f class:MemInfo allocReg showgraph/Utils/mem_mgr.cpp /^void MemInfo::allocReg( MemEventId n)$/;" f class:MemInfo alloc_counter showgraph/Utils/mem_mgr.h /^ MemEventId alloc_counter;$/;" m class:MemImpl::MemInfo alloc_event showgraph/Utils/mem_entry.h /^ MemEventId alloc_event;$/;" m class:MemImpl::Entry allocate showgraph/Utils/mem_fixed_pool.h /^ FixedPool::allocate( size_t size)$/;" f class:Mem::FixedPool allocateChunk showgraph/Utils/mem_fixed_pool.h /^ FixedPool< Data>::allocateChunk()$/;" f class:Mem::FixedPool allocateEntry showgraph/Utils/mem_chunk.h /^ Chunk< Data>::allocateEntry()$/;" f class:MemImpl::Chunk alternate_background showgraph/GraphView/node_item.h /^ bool alternate_background; $/;" m class:NodeItem analyze makedb/sqlbase.cpp /^int sqlbase::analyze(const char* fn, const bool& debug)$/;" f class:sqlbase app_name showgraph/Utils/conf.h /^ QString app_name;$/;" m class:Conf areEqP showgraph/Utils/misc.h /^inline bool areEqP( const void *p1, const void *p2)$/;" f areNotEqP showgraph/Utils/misc.h /^inline bool areNotEqP( const void *p1, const void *p2)$/;" f argIndex makedb/optlist.h /^ int argIndex;$/;" m struct:option_t argument makedb/optlist.h /^ char *argument;$/;" m struct:option_t arrangeHorizontally showgraph/Layout/layout.cpp /^AuxGraph::arrangeHorizontally()$/;" f class:AuxGraph arrangeHorizontallyWOStable showgraph/Layout/layout.cpp /^void AuxGraph::arrangeHorizontallyWOStable()$/;" f class:AuxGraph arrangeHorizontallyWithStable showgraph/Layout/layout.cpp /^AuxGraph::arrangeHorizontallyWithStable( Rank min, Rank max)$/;" f class:AuxGraph arrangeLevel showgraph/Layout/layout.cpp /^void arrangeLevel( Level *level, GraphDir dir, bool commit_placement, bool first_pass)$/;" f arrangeNodes showgraph/Layout/layout.cpp /^void Level::arrangeNodes( GraphDir dir, bool commit_placement, bool first_pass)$/;" f class:Level arrowSize showgraph/GraphView/gview_impl.h /^const qreal arrowSize = 10;$/;" v assert showgraph/Utils/asrt.h /^inline void assert( bool asrt)$/;" f assert showgraph/Utils/asrt.h /^template inline void assert( bool asrt, Excpt e)$/;" f assert showgraph/Utils/asrt.h /^template inline void assert( bool assertion)$/;" f assertd showgraph/Utils/asrt.h /^inline void assertd( bool asrt)$/;" f assign querylib/small_lib.cpp /^void smartFILE::assign(FILE* fptr) {setme(fptr);}$/;" f class:smartFILE assign querylib/small_lib.cpp /^void smartFILE::assign(const smartFILE& sfp) {setme(sfp.m_fp);}$/;" f class:smartFILE attach showgraph/Utils/list.h /^ inline void attach( ListId list, MListItem< dim>* peer)$/;" f class:MListItem attach showgraph/Utils/list.h /^ inline void attach( MListItem< 1>* peer)$/;" f class:MListItem attachInDir showgraph/Utils/list.h /^ inline void attachInDir( ListId list, MListItem< dim>* p, ListDir dir)$/;" f class:MListItem attachInDir showgraph/Utils/list.h /^ inline void attachInDir( MListItem< 1>* p, ListDir dir)$/;" f class:MListItem autoCompleteFinished gui/searchhandler.cpp /^void searchhandler::autoCompleteFinished()$/;" f class:searchhandler autoCompleteStateChanged gui/searchhandler.cpp /^void searchhandler::autoCompleteStateChanged(int state)$/;" f class:searchhandler b showgraph/Utils/mem_utest.cpp /^ quint32 b;$/;" m class:MyPoolObj file: barycenter showgraph/Layout/aux_node.h /^ qreal barycenter;$/;" m class:AuxNode barycenter showgraph/Layout/node_group.h /^ qreal barycenter;$/;" m class:NodeGroup bc showgraph/Layout/aux_node.h /^ inline qreal bc() const$/;" f class:AuxNode bc showgraph/Layout/node_group.h /^ inline qreal bc() const$/;" f class:NodeGroup bgcolor gui/themes.cpp /^ const char *bgcolor;$/;" m struct:__anon2 file: bold_border showgraph/GraphView/node_item.h /^ bool bold_border;$/;" m class:NodeItem bool_val showgraph/Utils/conf.h /^ bool bool_val;$/;" m union:OptValues borderRect showgraph/GraphView/node_item.cpp /^NodeItem::borderRect() const$/;" f class:NodeItem border_left showgraph/Layout/node_group.h /^ qreal border_left;$/;" m class:NodeGroup border_right showgraph/Layout/node_group.h /^ qreal border_right;$/;" m class:NodeGroup boundingRect showgraph/GraphView/edge_helper.cpp /^EdgeHelper::boundingRect() const$/;" f class:EdgeHelper boundingRect showgraph/GraphView/edge_item.cpp /^EdgeItem::boundingRect() const$/;" f class:EdgeItem boundingRect showgraph/GraphView/node_item.cpp /^NodeItem::boundingRect() const$/;" f class:NodeItem boxPath showgraph/GraphView/node_item.cpp /^inline QPainterPath boxPath( QRectF rect)$/;" f boxRect showgraph/GraphView/node_item.cpp /^inline QRectF boxRect( QRectF rect)$/;" f box_adjust showgraph/GraphView/node_item.cpp /^const qreal box_adjust = 5;$/;" v brush showgraph/GraphView/gstyle.h /^inline QBrush GStyle::brush() const$/;" f class:GStyle brush_priv showgraph/GraphView/gstyle.h /^ QBrush brush_priv;$/;" m class:GStyle btmRight showgraph/GraphView/edge_helper.h /^ QPointF btmRight;$/;" m class:EdgeHelper btmRight showgraph/GraphView/edge_item.h /^ QPointF btmRight;$/;" m class:EdgeItem busy showgraph/Utils/mem_chunk.h /^ ChunkPos busy;$/;" m class:MemImpl::Chunk cAdditionalRules gui/obsolete/highlighter.cpp /^ void Highlighter::cAdditionalRules(const QString &text)$/;" f class:Highlighter cHighlightingRules gui/obsolete/highlighter.h /^ QVector cHighlightingRules;$/;" m class:Highlighter called showgraph/Utils/mem_utest.cpp /^ bool *called;$/;" m class:MyPoolObj file: calling_func makedb/csdbparser.h /^std::string calling_func;$/;" m class:sym_data calling_macro makedb/csdbparser.h /^std::string calling_macro;$/;" m class:sym_data cancel showgraph/GraphView/style_edit.h /^ QPushButton *cancel;$/;" m class:StyleEdit changeFillStyle showgraph/GraphView/style_edit.cpp /^void StyleEdit::changeFillStyle()$/;" f class:StyleEdit changeLineStyle showgraph/GraphView/style_edit.cpp /^void StyleEdit::changeLineStyle()$/;" f class:StyleEdit changeLineWidth showgraph/GraphView/style_edit.cpp /^void StyleEdit::changeLineWidth( double width)$/;" f class:StyleEdit changeShape showgraph/GraphView/style_edit.cpp /^void StyleEdit::changeShape()$/;" f class:StyleEdit changeStyleName showgraph/GraphView/style_edit.cpp /^void StyleEdit::changeStyleName()$/;" f class:StyleEdit charAtPos gui/obsolete/highlighter.cpp /^ #define charAtPos(/;" d file: checkDelItems showgraph/GraphView/graph_view.h /^ inline void checkDelItems()$/;" f class:GraphView checkNodes showgraph/Graph/edge.cpp /^bool Edge::checkNodes( Node* _pred, Node* _succ)$/;" f class:Edge checkUpDown gui/listhandler.cpp /^void listhandler::checkUpDown(void)$/;" f class:listhandler check_fileExists querylib/small_lib.cpp /^bool check_fileExists(const char *fn)$/;" f chomp querylib/small_lib.cpp /^const char* chomp(char* str)$/;" f chr makedb/csdbparser.cpp /^int chr;$/;" m struct:__anon5 file: chr2enum makedb/csdbparser.cpp /^} chr2enum;$/;" t typeref:struct:__anon5 file: circlePath showgraph/GraphView/node_item.cpp /^inline QPainterPath circlePath( QRectF rect)$/;" f circleRect showgraph/GraphView/node_item.cpp /^inline QRectF circleRect( QRectF rect)$/;" f classA showgraph/Utils/list_utest.cpp /^class classA: public MListIface< classA, MListItem, LISTS_NUM>$/;" c file: classA showgraph/Utils/utils_utest.cpp /^ classA( const classA&){};$/;" f class:classA file: classA showgraph/Utils/utils_utest.cpp /^ classA(){};$/;" f class:classA file: classA showgraph/Utils/utils_utest.cpp /^class classA$/;" c file: classifyEdges showgraph/Layout/layout.cpp /^void AuxGraph::classifyEdges()$/;" f class:AuxGraph clear makedb/csdbparser.cpp /^void sym_data::clear(void)$/;" f class:sym_data clear makedb/csdbparser.cpp /^void symdata_pack::clear(void)$/;" f class:symdata_pack clear querylib/small_lib.cpp /^void tempbuf::clear(void) {*m_buffer = 0;}$/;" f class:tempbuf clear showgraph/Graph/marker.h /^inline void Marked::clear( MarkerIndex i)$/;" f class:Marked clear showgraph/Graph/num.h /^Numbered::clear( NumIndex i)$/;" f class:Numbered clearList gui/fileviewer.cpp /^void fileviewer::clearList()$/;" f class:fileviewer clearList gui/listhandler.cpp /^void listhandler::clearList()$/;" f class:listhandler clearMarkersInObjects showgraph/Graph/graph.cpp /^Graph::clearMarkersInObjects()$/;" f class:Graph clearNodesPriority showgraph/GraphView/graph_view.cpp /^void GGraph::clearNodesPriority()$/;" f class:GGraph clearNumerationsInObjects showgraph/Graph/graph.cpp /^Graph::clearNumerationsInObjects()$/;" f class:Graph clearSearch showgraph/GraphView/graph_view.cpp /^void GraphView::clearSearch()$/;" f class:GraphView clearUnusedMarkers showgraph/Graph/marker.h /^MarkerManager::clearUnusedMarkers( Marked *m_obj)$/;" f class:MarkerManager clearUnusedNumerations showgraph/Graph/num.h /^inline void NumManager::clearUnusedNumerations( Numbered *n_obj)$/;" f class:NumManager close_csdb makedb/cs2sq.cpp /^void cs2sq::close_csdb(void)$/;" f class:cs2sq close_db makedb/cs2sq.cpp /^void cs2sq::close_db(void)$/;" f class:cs2sq close_dbfile querylib/sqlquery.cpp /^void sqlquery::close_dbfile(void)$/;" f class:sqlquery close_file makedb/csdbparser.cpp /^void csdbparser::close_file(void)$/;" f class:csdbparser close_file querylib/small_lib.cpp /^void smartFILE::close_file(void)$/;" f class:smartFILE close_files makedb/ctagread.cpp /^void ctagread::close_files(void)$/;" f class:ctagread cls makedb/ctagread.h /^ std::string cls;$/;" m struct:__anon6 codeEditor gui/obsolete/CodeEditor.h /^ CodeEditor *codeEditor;$/;" m class:LineNumberArea collateGrep gui/searchhandler.cpp /^void searchhandler::collateGrep(sqlqueryresultlist &result,$/;" f class:searchhandler color showgraph/GraphView/style_edit.h /^ QColor color;$/;" m class:ColorButton compare gui/fileviewer.cpp /^bool filedata::compare(const filedata& fd)$/;" f class:filedata compare gui/searchhandler.cpp /^int searchitem::compare(const searchitem& otheritem)$/;" f class:searchitem compareBc showgraph/Layout/node_group.cpp /^bool compareBc( AuxNode* node1,$/;" f compareFilenameOnly gui/fileviewer.cpp /^bool filedata::compareFilenameOnly(const filedata& fd)$/;" f class:filedata compareGroups showgraph/Layout/layout.cpp /^bool compareGroups( NodeGroup* g1,$/;" f compareOrders showgraph/Layout/layout.cpp /^bool compareOrders( AuxNode* node1,$/;" f constchar querylib/small_lib.cpp /^const char* tempbuf::constchar(void)$/;" f class:tempbuf contains showgraph/GraphView/node_item.cpp /^bool NodeItem::contains(const QPointF &point) const$/;" f class:NodeItem contextMenuEvent showgraph/GraphView/graph_view.cpp /^GraphView::contextMenuEvent( QContextMenuEvent * e)$/;" f class:GraphView convertToImage showgraph/showgraph.cpp /^QImage showgraph::convertToImage(QString grpxml)$/;" f class:showgraph cp1 showgraph/GraphView/edge_helper.h /^ QPointF cp1;$/;" m class:EdgeHelper cp1 showgraph/GraphView/edge_item.h /^ QPointF cp1;$/;" m class:EdgeItem cp2 showgraph/GraphView/edge_helper.h /^ QPointF cp2;$/;" m class:EdgeHelper cp2 showgraph/GraphView/edge_item.h /^ QPointF cp2;$/;" m class:EdgeItem cppFormat gui/obsolete/highlighter.h /^ QTextCharFormat cppFormat;$/;" m class:Highlighter cpp_Bespin gui/themes_gen.cpp /^static const lexstyle cpp_Bespin[] = {$/;" v file: cpp_Black_board gui/themes_gen.cpp /^static const lexstyle cpp_Black_board[] = {$/;" v file: cpp_Choco gui/themes_gen.cpp /^static const lexstyle cpp_Choco[] = {$/;" v file: cpp_Deep_Black gui/themes_gen.cpp /^static const lexstyle cpp_Deep_Black[] = {$/;" v file: cpp_Eclipse_Default gui/themes_gen.cpp /^static const lexstyle cpp_Eclipse_Default[] = {$/;" v file: cpp_Hello_Kitty gui/themes_gen.cpp /^static const lexstyle cpp_Hello_Kitty[] = {$/;" v file: cpp_HotFudgeSundae gui/themes_gen.cpp /^static const lexstyle cpp_HotFudgeSundae[] = {$/;" v file: cpp_Mono_Industrial gui/themes_gen.cpp /^static const lexstyle cpp_Mono_Industrial[] = {$/;" v file: cpp_Monokai gui/themes_gen.cpp /^static const lexstyle cpp_Monokai[] = {$/;" v file: cpp_MossyLawn gui/themes_gen.cpp /^static const lexstyle cpp_MossyLawn[] = {$/;" v file: cpp_Navajo gui/themes_gen.cpp /^static const lexstyle cpp_Navajo[] = {$/;" v file: cpp_NotepadPlusPlus gui/themes_gen.cpp /^static const lexstyle cpp_NotepadPlusPlus[] = {$/;" v file: cpp_Obsidian gui/themes_gen.cpp /^static const lexstyle cpp_Obsidian[] = {$/;" v file: cpp_Plastic_Code_Wrap gui/themes_gen.cpp /^static const lexstyle cpp_Plastic_Code_Wrap[] = {$/;" v file: cpp_Ruby_Blue gui/themes_gen.cpp /^static const lexstyle cpp_Ruby_Blue[] = {$/;" v file: cpp_Solarized gui/themes_gen.cpp /^static const lexstyle cpp_Solarized[] = {$/;" v file: cpp_Solarized_light gui/themes_gen.cpp /^static const lexstyle cpp_Solarized_light[] = {$/;" v file: cpp_Twilight gui/themes_gen.cpp /^static const lexstyle cpp_Twilight[] = {$/;" v file: cpp_Vibrant_Ink gui/themes_gen.cpp /^static const lexstyle cpp_Vibrant_Ink[] = {$/;" v file: cpp_Zenburn gui/themes_gen.cpp /^static const lexstyle cpp_Zenburn[] = {$/;" v file: cpp_khaki gui/themes_gen.cpp /^static const lexstyle cpp_khaki[] = {$/;" v file: cpp_vim_Dark_Blue gui/themes_gen.cpp /^static const lexstyle cpp_vim_Dark_Blue[] = {$/;" v file: cppstyle gui/themes_gen.cpp /^static const langstyle cppstyle[] = {$/;" v file: cqDialogAbout gui/aboutdialog.cpp /^cqDialogAbout::cqDialogAbout(QWidget *parent)$/;" f class:cqDialogAbout cqDialogAbout gui/aboutdialog.h /^class cqDialogAbout : public QDialog$/;" c cqDialogFileViewSettings gui/fileviewsettingsdialog.cpp /^cqDialogFileViewSettings::cqDialogFileViewSettings(QWidget *parent,$/;" f class:cqDialogFileViewSettings cqDialogFileViewSettings gui/fileviewsettingsdialog.h /^class cqDialogFileViewSettings : public QDialog$/;" c cqDialogGraph gui/graphdialog.cpp /^cqDialogGraph::cqDialogGraph(QWidget *parent)$/;" f class:cqDialogGraph cqDialogGraph gui/graphdialog.h /^class cqDialogGraph : public QDialog$/;" c createActions showgraph/GraphView/graph_view.cpp /^void GraphView::createActions()$/;" f class:GraphView createEdge showgraph/Graph/agraph.h /^inline Edge * AGraph::createEdge( int _id, Node *_pred, Node* _succ)$/;" f class:AGraph createEdge showgraph/Graph/graph.cpp /^Graph::createEdge( int _id, Node *_pred, Node* _succ)$/;" f class:Graph createEdge showgraph/GraphView/graph_view.h /^ bool createEdge;$/;" m class:GraphView createEdge showgraph/GraphView/graph_view.h /^ virtual Edge * createEdge( int _id, Node *_pred, Node* _succ)$/;" f class:GGraph createEdge showgraph/Layout/aux_graph.h /^ virtual Edge * createEdge( int _id, Node *_pred, Node* _succ)$/;" f class:AuxGraph createEdgeLabel showgraph/GraphView/graph_view.cpp /^void GGraph::createEdgeLabel( QPointF pos)$/;" f class:GGraph createEdgeLabel showgraph/GraphView/graph_view.cpp /^void GraphView::createEdgeLabel()$/;" f class:GraphView createEdgeLabelAct showgraph/GraphView/graph_view.h /^ QAction *createEdgeLabelAct;$/;" m class:GraphView createFontList gui/fileviewer.cpp /^void fileviewer::createFontList(void)$/;" f class:fileviewer createMenuForEdge showgraph/GraphView/graph_view.cpp /^QMenu* GraphView::createMenuForEdge( GEdge *e)$/;" f class:GraphView createMenuForNode showgraph/GraphView/graph_view.cpp /^QMenu* GraphView::createMenuForNode( GNode *n)$/;" f class:GraphView createMenus showgraph/GraphView/graph_view.cpp /^void GraphView::createMenus()$/;" f class:GraphView createNode showgraph/Graph/agraph.h /^inline Node * AGraph::createNode( int _id)$/;" f class:AGraph createNode showgraph/Graph/graph.cpp /^Graph::createNode( int _id)$/;" f class:Graph createNode showgraph/GraphView/graph_view.h /^ virtual Node * createNode( int _id)$/;" f class:GGraph createNode showgraph/Layout/aux_graph.h /^ virtual Node * createNode( int _id)$/;" f class:AuxGraph createPools showgraph/Graph/agraph.h /^ void createPools()$/;" f class:AGraph createPools showgraph/Graph/graph.cpp /^void Graph::createPools()$/;" f class:Graph createSESelected showgraph/GraphView/graph_view.cpp /^void GraphView::createSESelected()$/;" f class:GraphView createSelfEdge showgraph/GraphView/graph_view.cpp /^void GGraph::createSelfEdge()$/;" f class:GGraph createSelfEdgeAct showgraph/GraphView/graph_view.h /^ QAction *createSelfEdgeAct;$/;" m class:GraphView createWidget gui/obsolete/CodeEditorWidgetPlugin/CodeEditorWidgetPlugin.cpp /^ QWidget *CodeEditorWidgetPlugin::createWidget(QWidget *parent)$/;" f class:CodeEditorWidgetPlugin create_buf makedb/csdbparser.cpp /^void csdbparser::create_buf(int size)$/;" f class:csdbparser cs2sq makedb/cs2sq.cpp /^cs2sq::cs2sq()$/;" f class:cs2sq cs2sq makedb/cs2sq.h /^class cs2sq : public sqlbase$/;" c csdbheader makedb/csdbheader.cpp /^csdbheader::csdbheader()$/;" f class:csdbheader csdbheader makedb/csdbheader.cpp /^csdbheader::csdbheader(tStr hdr)$/;" f class:csdbheader csdbheader makedb/csdbheader.h /^class csdbheader$/;" c csdbparser makedb/csdbparser.cpp /^csdbparser::csdbparser()$/;" f class:csdbparser csdbparser makedb/csdbparser.h /^class csdbparser$/;" c ctagread makedb/ctagread.cpp /^ctagread::ctagread()$/;" f class:ctagread ctagread makedb/ctagread.h /^class ctagread : public sqlbase$/;" c cur_level showgraph/Layout/aux_graph.h /^ int cur_level; \/\/last processed level$/;" m class:AuxGraph cur_pass showgraph/Layout/aux_graph.h /^ int cur_pass; \/\/ current pass$/;" m class:AuxGraph currPos showgraph/GraphView/graph_view.h /^ inline QPointF currPos() const$/;" f class:GraphView curr_mode showgraph/GraphView/edge_item.h /^ EdgeMode curr_mode;$/;" m class:EdgeItem curr_pos showgraph/GraphView/graph_view.h /^ QPointF curr_pos;$/;" m class:GraphView data showgraph/GraphView/graph_view.h /^ NavEventData data;$/;" m class:NavEvent data showgraph/Utils/list.h /^ inline Data *data() const$/;" f class:ListItem data_p showgraph/Utils/list.h /^ Data *data_p;$/;" m class:ListItem deallocEvent showgraph/Utils/mem_mgr.cpp /^MemEventId MemInfo::deallocEvent()$/;" f class:MemInfo deallocReg showgraph/Utils/mem_mgr.cpp /^void MemInfo::deallocReg( MemEventId n)$/;" f class:MemInfo dealloc_counter showgraph/Utils/mem_mgr.h /^ MemEventId dealloc_counter;$/;" m class:MemImpl::MemInfo dealloc_event showgraph/Utils/mem_entry.h /^ MemEventId dealloc_event;$/;" m class:MemImpl::Entry deallocate showgraph/Utils/mem_fixed_pool.h /^ FixedPool::deallocate( void *ptr)$/;" f class:Mem::FixedPool deallocateChunk showgraph/Utils/mem_fixed_pool.h /^ FixedPool::deallocateChunk( MemImpl::Chunk< Data> *chunk)$/;" f class:Mem::FixedPool deallocateEntry showgraph/Utils/mem_chunk.h /^ Chunk< Data>::deallocateEntry( Entry *e)$/;" f class:MemImpl::Chunk debugPrint showgraph/Graph/edge.cpp /^Edge::debugPrint()$/;" f class:Edge debugPrint showgraph/Graph/graph.cpp /^Graph::debugPrint()$/;" f class:Graph debugPrint showgraph/Graph/node.cpp /^Node::debugPrint()$/;" f class:Node debugPrint showgraph/Layout/aux_graph.h /^ virtual void debugPrint()$/;" f class:AuxGraph debugPrint showgraph/Layout/aux_node.h /^ inline void debugPrint()$/;" f class:AuxNode decNumItems showgraph/GraphView/gstyle.h /^inline void GStyle::decNumItems()$/;" f class:GStyle decRefCount showgraph/Utils/mem_obj.h /^ inline void decRefCount()$/;" f class:Mem::Obj defBoolVal showgraph/Utils/conf.h /^ inline bool defBoolVal() const$/;" f class:Option def_values showgraph/Utils/conf.h /^ OptValues def_values;$/;" m class:Option defaultbgcolor gui/themes.cpp /^ const char *defaultbgcolor;$/;" m struct:__anon3 file: defaultfgcolor gui/themes.cpp /^ const char *defaultfgcolor;$/;" m struct:__anon3 file: defined showgraph/Utils/conf.h /^ bool defined;$/;" m class:Option deinit showgraph/Utils/singleton.h /^Single< T>::deinit()$/;" f class:Single del_edge_items showgraph/GraphView/graph_view.h /^ QList< EdgeItem* > del_edge_items;$/;" m class:GraphView del_node_items showgraph/GraphView/graph_view.h /^ QList< NodeItem* > del_node_items;$/;" m class:GraphView deleteEdge showgraph/Graph/graph_inline.h /^inline void Graph::deleteEdge( void *e)$/;" f class:Graph deleteEdgeInDir showgraph/Graph/node_inline.h /^Node::deleteEdgeInDir( GraphDir dir, Edge* edge)$/;" f class:Node deleteEdgeWithControls showgraph/GraphView/graph_view.cpp /^void GGraph::deleteEdgeWithControls( GEdge *edge)$/;" f class:GGraph deleteEdges showgraph/GraphView/graph_view.cpp /^void GGraph::deleteEdges()$/;" f class:GGraph deleteItemAct showgraph/GraphView/graph_view.h /^ QAction *deleteItemAct;$/;" m class:GraphView deleteItems showgraph/GraphView/graph_view.cpp /^GraphView::deleteItems()$/;" f class:GraphView deleteLaterEdgeItem showgraph/GraphView/graph_view.h /^ void deleteLaterEdgeItem( EdgeItem *item)$/;" f class:GraphView deleteLaterNodeItem showgraph/GraphView/graph_view.h /^ void deleteLaterNodeItem( NodeItem *item)$/;" f class:GraphView deleteLevels showgraph/Layout/aux_graph.cpp /^AuxGraph::deleteLevels()$/;" f class:AuxGraph deleteNode showgraph/Graph/graph_inline.h /^inline void Graph::deleteNode( void *n)$/;" f class:Graph deleteNodes showgraph/GraphView/graph_view.cpp /^void GGraph::deleteNodes()$/;" f class:GGraph deletePred showgraph/Graph/node_inline.h /^inline void Node::deletePred( Edge* edge)$/;" f class:Node deleteSelected showgraph/GraphView/graph_view.cpp /^void GraphView::deleteSelected()$/;" f class:GraphView deleteSucc showgraph/Graph/node_inline.h /^inline void Node::deleteSucc( Edge* edge)$/;" f class:Node deltaInDir showgraph/GraphView/navigation.cpp /^qreal NodeNav::deltaInDir( QPointF point, QPointF ref, NavDirection dir)$/;" f class:NodeNav desc makedb/csdbparser.cpp /^const char* desc;$/;" m struct:__anon5 file: descr showgraph/Utils/conf.h /^ QString descr;$/;" m class:Option destroy showgraph/Utils/mem_fixed_pool.h /^ FixedPool::destroy( void *ptr)$/;" f class:Mem::FixedPool destroyPools showgraph/Graph/graph.cpp /^void Graph::destroyPools()$/;" f class:Graph destroy_buf makedb/csdbparser.cpp /^void csdbparser::destroy_buf(void)$/;" f class:csdbparser detach showgraph/Utils/list.h /^ inline void detach( ListId list)$/;" f class:MListItem detach showgraph/Utils/list.h /^ inline void detach()$/;" f class:MListItem detachAll showgraph/Utils/list.h /^ inline void detachAll()$/;" f class:MListItem detachEdge showgraph/Graph/graph_inline.h /^inline void Graph::detachEdge( Edge * edge)$/;" f class:Graph detachFromGraph showgraph/Graph/edge.h /^ inline void detachFromGraph()$/;" f class:Edge detachFromGraph showgraph/Graph/node_inline.h /^inline void Node::detachFromGraph()$/;" f class:Node detachFromNode showgraph/Graph/edge_inline.h /^Edge::detachFromNode( GraphDir dir)$/;" f class:Edge detachNode showgraph/Graph/graph_inline.h /^inline void Graph::detachNode( Node* node)$/;" f class:Graph dialog showgraph/GraphView/graph_view.h /^ StyleEdit* dialog;$/;" m struct:GraphView::StyleEditInfo dialog showgraph/GraphView/graph_view.h /^ QProgressDialog *dialog;$/;" m class:GraphView dialog_ui gui/aboutdialog.h /^Ui::aboutDialog *dialog_ui;$/;" m class:cqDialogAbout dialog_ui gui/fileviewsettingsdialog.h /^Ui::fileViewSettingsDialog *dialog_ui;$/;" m class:cqDialogFileViewSettings dialog_ui gui/graphdialog.h /^Ui::DialogGraph *dialog_ui;$/;" m class:cqDialogGraph diamondPath showgraph/GraphView/node_item.cpp /^inline QPainterPath diamondPath( QRectF rect)$/;" f diamondRect showgraph/GraphView/node_item.cpp /^inline QRectF diamondRect( QRectF rect)$/;" f doGrep gui/searchhandler.cpp /^sqlqueryresultlist searchhandler::doGrep(const QString &fp)$/;" f class:searchhandler doLayout showgraph/GraphView/graph_view.cpp /^void GGraph::doLayout()$/;" f class:GGraph doLayout showgraph/Layout/layout.cpp /^void AuxGraph::doLayout()$/;" f class:AuxGraph doLayoutConcurrent showgraph/Layout/layout.cpp /^void AuxGraph::doLayoutConcurrent()$/;" f class:AuxGraph doLayoutSingle showgraph/GraphView/graph_view.cpp /^void GGraph::doLayoutSingle()$/;" f class:GGraph doc showgraph/GraphView/node_item.h /^ inline QTextDocument *doc() const$/;" f class:GNode domXml gui/obsolete/CodeEditorWidgetPlugin/CodeEditorWidgetPlugin.cpp /^ QString CodeEditorWidgetPlugin::domXml() const$/;" f class:CodeEditorWidgetPlugin dragEnterEvent showgraph/GraphView/graph_view.cpp /^void GraphView::dragEnterEvent(QDragEnterEvent *event)$/;" f class:GraphView dragMoveEvent showgraph/GraphView/graph_view.cpp /^void GraphView::dragMoveEvent( QDragMoveEvent *event)$/;" f class:GraphView drawBackground showgraph/GraphView/graph_view.cpp /^GraphView::drawBackground(QPainter *painter, const QRectF &rect)$/;" f class:GraphView dropEvent showgraph/GraphView/graph_view.cpp /^void GraphView::dropEvent(QDropEvent *event)$/;" f class:GraphView dst showgraph/GraphView/edge_helper.h /^EdgeHelper::dst() const$/;" f class:EdgeHelper dstP showgraph/GraphView/edge_helper.h /^ QPointF dstP;$/;" m class:EdgeHelper dstP showgraph/GraphView/edge_item.h /^ QPointF dstP;$/;" m class:EdgeItem dst_item showgraph/GraphView/edge_helper.h /^ NodeItem *dst_item;$/;" m class:EdgeHelper dummy showgraph/Graph/agraph.h /^ int dummy; \/\/Dummy class member$/;" m class:AGraph dummy showgraph/Graph/agraph.h /^ int dummy;$/;" m class:AEdge dummy showgraph/Graph/agraph.h /^ int dummy;$/;" m class:ANode dummy_ptr showgraph/Utils/mem_chunk.h /^ void *dummy_ptr; \/\/for alignment$/;" m class:MemImpl::Chunk edge showgraph/Graph/node_inline.h /^EdgeIterIface< EdgeIterImpl>::edge() const$/;" f class:EdgeIterIface edge showgraph/Graph/node_iter.h /^ inline Edge* edge() const { return edge_p;}$/;" f class:IterImplBase edge showgraph/GraphView/edge_item.h /^ inline GEdge* edge() const$/;" f class:EdgeItem edge showgraph/GraphView/graph_view.h /^ GEdge* edge;$/;" m struct:GraphView::StyleEditInfo edge showgraph/Layout/aux_graph.h /^ AuxEdge *edge; \/\/ Next edge$/;" m struct:AuxGraph::SimpleDfsStepInfo edge showgraph/Layout/layout.cpp /^ AuxEdge *edge; \/** Next edge *\/$/;" m struct:DfsStepInfo file: edgeCount showgraph/Graph/graph_inline.h /^inline GraphNum Graph::edgeCount() const$/;" f class:Graph edgeInDir showgraph/GraphView/navigation.cpp /^NodeNav::edgeInDir( GEdge * edge, NavDirection dir) const$/;" f class:NodeNav edgeItemMenu showgraph/GraphView/graph_view.h /^ QMenu *edgeItemMenu;$/;" m class:GraphView edgeMenu showgraph/GraphView/graph_view.h /^ inline QMenu *edgeMenu() const$/;" f class:GraphView edgePool showgraph/Graph/graph_inline.h /^inline Pool *Graph::edgePool() const$/;" f class:Graph edge_next_id showgraph/Graph/graph.h /^ GraphUid edge_next_id;$/;" m class:Graph edge_num showgraph/Graph/graph.h /^ GraphNum edge_num;$/;" m class:Graph edge_num showgraph/Layout/node_group.h /^ unsigned int edge_num;$/;" m class:NodeGroup edge_p showgraph/Graph/node_iter.h /^ Edge *edge_p;$/;" m class:IterImplBase edge_p showgraph/GraphView/edge_item.h /^ GEdge* edge_p;$/;" m class:EdgeItem edge_pool showgraph/Graph/graph.h /^ Pool *edge_pool;$/;" m class:Graph edgesBegin showgraph/Graph/node_inline.h /^inline Node::EdgeIter Node::edgesBegin()$/;" f class:Node edgesEnd showgraph/Graph/node_inline.h /^inline Node::EdgeIter Node::edgesEnd()$/;" f class:Node editable showgraph/GraphView/graph_view.h /^ bool editable;$/;" m class:GraphView editableSwitchAct showgraph/GraphView/graph_view.h /^ QAction *editableSwitchAct;$/;" m class:GraphView elem showgraph/Graph/edge_inline.h /^inline QDomElement Edge::elem() const$/;" f class:Edge elem showgraph/Graph/node_inline.h /^inline QDomElement Node::elem() const$/;" f class:Node element showgraph/Graph/edge.h /^ QDomElement element;$/;" m class:Edge element showgraph/Graph/node.h /^ QDomElement element;$/;" m class:Node ellipsePath showgraph/GraphView/node_item.cpp /^inline QPainterPath ellipsePath( QRectF rect)$/;" f ellipseRect showgraph/GraphView/node_item.cpp /^inline QRectF ellipseRect( QRectF rect)$/;" f emptySelection showgraph/GraphView/graph_view.h /^ inline void emptySelection()$/;" f class:GGraph enHighlightCPP gui/fileviewer.h /^ enHighlightCPP,$/;" e enum:langtypes enHighlightCPP gui/obsolete/highlighter.h /^ enHighlightCPP = 0,$/;" e enum:enHighlightLang enHighlightGo gui/fileviewer.h /^ enHighlightGo$/;" e enum:langtypes enHighlightJava gui/fileviewer.h /^ enHighlightJava,$/;" e enum:langtypes enHighlightJava gui/obsolete/highlighter.h /^ enHighlightJava,$/;" e enum:enHighlightLang enHighlightLang gui/obsolete/highlighter.h /^ enum enHighlightLang$/;" g enHighlightNone gui/fileviewer.h /^ enHighlightNone = 0,$/;" e enum:langtypes enHighlightPython gui/fileviewer.h /^ enHighlightPython,$/;" e enum:langtypes enHighlightPython gui/obsolete/highlighter.h /^ enHighlightPython$/;" e enum:enHighlightLang enHighlightRuby gui/fileviewer.h /^ enHighlightRuby,$/;" e enum:langtypes enResult makedb/cs2sq.h /^enum enResult$/;" g class:cs2sq enResult makedb/csdbparser.h /^enum enResult$/;" g class:csdbparser enResult makedb/ctagread.h /^enum enResult$/;" g class:ctagread enState makedb/csdbparser.h /^enum enState$/;" g class:csdbparser enSymType makedb/csdbparser.h /^enum enSymType$/;" g class:sym_data en_filereadstatus querylib/sqlquery.h /^enum en_filereadstatus$/;" g class:sqlquery en_queryType querylib/sqlquery.h /^enum en_queryType$/;" g class:sqlquery en_resultType querylib/sqlquery.h /^enum en_resultType$/;" g class:sqlqueryresultlist entry showgraph/Utils/mem_chunk.h /^ Chunk< Data>::entry( ChunkPos pos)$/;" f class:MemImpl::Chunk entryChunk showgraph/Utils/mem_fixed_pool.h /^ FixedPool::entryChunk( MemImpl::Entry< Data> *e)$/;" f class:Mem::FixedPool entry_count showgraph/Utils/mem_fixed_pool.h /^ EntryNum entry_count;$/;" m class:Mem::FixedPool eraseNode showgraph/GraphView/graph_view.cpp /^void GraphViewHistory::eraseNode( GNode *n)$/;" f class:GraphViewHistory err showgraph/Utils/print.h /^ inline void err( const char* format, ...)$/;" f namespace:PrintUtils events showgraph/GraphView/graph_view.h /^ QList< NavEvent *> events; \/\/ List of events$/;" m class:GraphViewHistory exactmatch gui/searchhandler.h /^ bool exactmatch;$/;" m class:searchitem execHighlightRule gui/obsolete/highlighter.cpp /^ void Highlighter::execHighlightRule(const HighlightingRule &rule, const QString &text)$/;" f class:Highlighter execstmt makedb/sqlbase.cpp /^int sqlbase::execstmt(sqlite3_stmt* pstmt, const char* v1)$/;" f class:sqlbase execstmt makedb/sqlbase.cpp /^int sqlbase::execstmt(sqlite3_stmt* pstmt, const char* v1, const char* v2)$/;" f class:sqlbase execstmt makedb/sqlbase.cpp /^int sqlbase::execstmt(sqlite3_stmt* pstmt, const char* v1, const char* v2, const char* v3)$/;" f class:sqlbase execstmt makedb/sqlbase.cpp /^int sqlbase::execstmt(sqlite3_stmt* pstmt, const char* v1, const char* v2, const char* v3, const char* v4)$/;" f class:sqlbase execstmt makedb/sqlbase.cpp /^int sqlbase::execstmt(sqlite3_stmt* pstmt, const char* v1, const char* v2, const char* v3, const char* v4, const char* v5)$/;" f class:sqlbase extract_filename querylib/small_lib.cpp /^const char* extract_filename(const char* filepath)$/;" f f_tags makedb/ctagread.h /^FILE* f_tags;$/;" m class:ctagread fgcolor gui/themes.cpp /^ const char *fgcolor;$/;" m struct:__anon2 file: fileToBeOpened gui/fileviewer.cpp /^void fileviewer::fileToBeOpened(QString filename, QString linenum)$/;" f class:fileviewer fileViewSettings_Triggered gui/fileviewer.cpp /^void fileviewer::fileViewSettings_Triggered(bool checked)$/;" f class:fileviewer file_sanity_check makedb/csdbparser.cpp /^csdbparser::enResult csdbparser::file_sanity_check(const char *fn)$/;" f class:csdbparser filedata gui/fileviewer.cpp /^filedata::filedata()$/;" f class:filedata filedata gui/fileviewer.cpp /^filedata::filedata(const QString& fn, const QString& ln)$/;" f class:filedata filedata gui/fileviewer.cpp /^filedata::filedata(const filedata& fd)$/;" f class:filedata filedata gui/fileviewer.h /^class filedata$/;" c fileexists cli/main_cli.cpp /^bool fileexists(const char* fn)$/;" f fileexists makedb/main.cpp /^bool fileexists(const char* fn)$/;" f filename gui/fileviewer.h /^ QString filename;$/;" m class:filedata filename makedb/csdbparser.h /^std::string filename;$/;" m class:symdata_pack filename querylib/sqlquery.h /^ tStr filename;$/;" m class:sqlqueryresult filepath querylib/sqlquery.h /^ tStr filepath;$/;" m class:sqlqueryresult fileviewer gui/fileviewer.cpp /^fileviewer::fileviewer(mainwindow* pmw)$/;" f class:fileviewer fileviewer gui/fileviewer.h /^class fileviewer : public QObject$/;" c fill_check showgraph/GraphView/style_edit.h /^ QCheckBox *fill_check; $/;" m class:StyleEdit fill_color_button showgraph/GraphView/style_edit.h /^ ColorButton *fill_color_button;$/;" m class:StyleEdit fill_color_label showgraph/GraphView/style_edit.h /^ QLabel *fill_color_label;$/;" m class:StyleEdit filterterm gui/searchhandler.h /^ QString filterterm;$/;" m class:searchitem finalize makedb/cs2sq.cpp /^cs2sq::enResult cs2sq::finalize(void)$/;" f class:cs2sq finalize makedb/ctagread.cpp /^ctagread::enResult ctagread::finalize(void)$/;" f class:ctagread finalize querylib/sqlquery.cpp /^void tempstmt::finalize(void)$/;" f class:tempstmt findContext showgraph/GraphView/graph_view.cpp /^void GGraph::findContext()$/;" f class:GGraph findContext showgraph/GraphView/graph_view.cpp /^void GraphView::findContext()$/;" f class:GraphView findContextAct showgraph/GraphView/graph_view.h /^ QAction *findContextAct;$/;" m class:GraphView findEnterNodes showgraph/Layout/layout.cpp /^AuxGraph::findEnterNodes()$/;" f class:AuxGraph findFreeIndex showgraph/Graph/marker.h /^MarkerManager::findFreeIndex()$/;" f class:MarkerManager findFreeIndex showgraph/Graph/num.h /^inline NumIndex NumManager::findFreeIndex()$/;" f class:NumManager findNextFreeValue showgraph/Graph/marker.h /^MarkerManager::findNextFreeValue()$/;" f class:MarkerManager findNextFreeValue showgraph/Graph/num.h /^inline NumValue NumManager::findNextFreeValue()$/;" f class:NumManager findNextNodeWithText showgraph/GraphView/graph_view.cpp /^GraphView::findNextNodeWithText( QString &findStr,$/;" f class:GraphView findNodeById showgraph/GraphView/graph_view.cpp /^GNode* GraphView::findNodeById( int id)$/;" f class:GraphView findNodeByLabel showgraph/GraphView/graph_view.cpp /^GNode* GraphView::findNodeByLabel( QString label)$/;" f class:GraphView findPrevNodeWithText showgraph/GraphView/graph_view.cpp /^GraphView::findPrevNodeWithText( QString &findStr,$/;" f class:GraphView firstBusyChunk showgraph/Utils/mem_fixed_pool.h /^ FixedPool< Data>::firstBusyChunk()$/;" f class:Mem::FixedPool firstBusyEntry showgraph/Utils/mem_chunk.h /^ Chunk< Data>::firstBusyEntry()$/;" f class:MemImpl::Chunk firstEdge showgraph/Graph/agraph.h /^ inline AEdge* firstEdge() $/;" f class:AGraph firstEdge showgraph/Graph/graph_inline.h /^inline Edge* Graph::firstEdge() $/;" f class:Graph firstEdge showgraph/GraphView/graph_view.h /^ inline GEdge* firstEdge() $/;" f class:GGraph firstEdge showgraph/Layout/aux_graph.h /^ inline AuxEdge* firstEdge() $/;" f class:AuxGraph firstEdgeInDir showgraph/Graph/agraph.h /^ANode::firstEdgeInDir( GraphDir dir)$/;" f class:ANode firstEdgeInDir showgraph/Graph/node_inline.h /^inline Edge* Node::firstEdgeInDir( GraphDir dir)$/;" f class:Node firstEdgeInDir showgraph/GraphView/node_item.h /^ inline GEdge* firstEdgeInDir( GraphDir dir)$/;" f class:GNode firstEdgeInDir showgraph/Layout/aux_graph.h /^AuxNode::firstEdgeInDir( GraphDir dir)$/;" f class:AuxNode firstEdgeInSector showgraph/GraphView/navigation.cpp /^NodeNav::firstEdgeInSector() const$/;" f class:NodeNav firstNode showgraph/Graph/agraph.h /^ inline ANode* firstNode()$/;" f class:AGraph firstNode showgraph/Graph/graph_inline.h /^inline Node* Graph::firstNode()$/;" f class:Graph firstNode showgraph/GraphView/graph_view.h /^ inline GNode* firstNode()$/;" f class:GGraph firstNode showgraph/Layout/aux_graph.h /^ inline AuxNode* firstNode()$/;" f class:AuxGraph firstPred showgraph/Graph/agraph.h /^ANode::firstPred()$/;" f class:ANode firstPred showgraph/Graph/node_inline.h /^inline Edge* Node::firstPred()$/;" f class:Node firstPred showgraph/GraphView/node_item.h /^ inline GEdge* firstPred()$/;" f class:GNode firstPred showgraph/Layout/aux_graph.h /^AuxNode::firstPred()$/;" f class:AuxNode firstSucc showgraph/Graph/agraph.h /^ANode::firstSucc()$/;" f class:ANode firstSucc showgraph/Graph/node_inline.h /^inline Edge* Node::firstSucc()$/;" f class:Node firstSucc showgraph/GraphView/node_item.h /^ inline GEdge* firstSucc()$/;" f class:GNode firstSucc showgraph/Layout/aux_graph.h /^AuxNode::firstSucc()$/;" f class:AuxNode first_chunk showgraph/Utils/mem_fixed_pool.h /^ MemImpl::Chunk< Data> *first_chunk;$/;" m class:Mem::FixedPool first_edge showgraph/Graph/graph.h /^ Edge* first_edge;$/;" m class:Graph first_edge showgraph/Graph/node.h /^ Edge *first_edge[ GRAPH_DIRS_NUM];$/;" m class:Node first_node showgraph/Graph/graph.h /^ Node* first_node;$/;" m class:Graph floatVal showgraph/Utils/conf.h /^ inline qreal floatVal() const$/;" f class:Option float_val showgraph/Utils/conf.h /^ qreal float_val;$/;" m union:OptValues focusEvent showgraph/GraphView/graph_view.h /^ inline void focusEvent( GNode *n)$/;" f class:GraphViewHistory focusOnNode showgraph/GraphView/graph_view.cpp /^void GraphView::focusOnNode( GNode *n, bool gen_event)$/;" f class:GraphView focusOutEvent showgraph/GraphView/node_item.cpp /^void NodeItem::focusOutEvent(QFocusEvent *event)$/;" f class:NodeItem fontSelectionTemporary gui/fileviewer.cpp /^void fileviewer::fontSelectionTemporary(const QString &fonttxt)$/;" f class:fileviewer fontstyle gui/themes.cpp /^ int fontstyle;$/;" m struct:__anon2 file: foreachEdge showgraph/Graph/graph_iface.h /^# define foreachEdge(/;" d foreachNode showgraph/Graph/graph_iface.h /^# define foreachNode(/;" d foreachPred showgraph/Graph/graph_iface.h /^# define foreachPred(/;" d foreachSucc showgraph/Graph/graph_iface.h /^# define foreachSucc(/;" d format gui/obsolete/highlighter.h /^ QTextCharFormat format;$/;" m struct:Highlighter::HighlightingRule freeMarker showgraph/Graph/marker.h /^inline void MarkerManager::freeMarker( Marker m)$/;" f class:MarkerManager freeNum showgraph/Graph/num.h /^inline void NumManager::freeNum( Numeration n)$/;" f class:NumManager free_chunk showgraph/Utils/mem_fixed_pool.h /^ MemImpl::Chunk< Data> *free_chunk;$/;" m class:Mem::FixedPool free_entry showgraph/Utils/mem_chunk.h /^ ChunkPos free_entry;$/;" m class:MemImpl::Chunk functionFormat gui/obsolete/highlighter.h /^ QTextCharFormat functionFormat;$/;" m class:Highlighter get querylib/small_lib.cpp /^FILE* smartFILE::get(void) {return m_fp;}$/;" f class:smartFILE get querylib/small_lib.cpp /^char* tempbuf::get(void) {return m_buffer;}$/;" f class:tempbuf get querylib/sqlquery.cpp /^sqlite3_stmt* tempstmt::get(void)$/;" f class:tempstmt getBasePath makedb/csdbparser.cpp /^const char* csdbparser::getBasePath(void)$/;" f class:csdbparser getHListOfClassIDs makedb/ctagread.cpp /^ctagread::enResult ctagread::getHListOfClassIDs(strctagIDList* idlist, const char* v1, std::vector *listClsHist)$/;" f class:ctagread getInt querylib/small_lib.cpp /^long unsigned int idxcounter::getInt(void) const {return m_ctr;}$/;" f class:idxcounter getLangFilePath gui/langtable.cpp /^QString langtable::getLangFilePath(const QString& lang)$/;" f class:langtable getLangNameList gui/langtable.cpp /^QStringList langtable::getLangNameList(void)$/;" f class:langtable getListOfClassIDs makedb/ctagread.cpp /^ctagread::enResult ctagread::getListOfClassIDs(strctagIDList* idlist, const char* v1)$/;" f class:ctagread getListOfSymIDs makedb/ctagread.cpp /^ctagread::enResult ctagread::getListOfSymIDs(sqlite3_stmt* pstmt, strctagIDList* idlist, const char* v1, const char* v2, const char* v3)$/;" f class:ctagread getStr querylib/small_lib.cpp /^const char* idxcounter::getStr(void) const {return m_buf;}$/;" f class:idxcounter getStrSize querylib/small_lib.cpp /^int idxcounter::getStrSize(void) const {return strlen(m_buf);}$/;" f class:idxcounter getThemesList gui/themes.cpp /^QStringList themes::getThemesList(void)$/;" f class:themes getTypeChar makedb/csdbparser.cpp /^const char sym_data::getTypeChar(void)$/;" f class:sym_data getTypeDesc makedb/csdbparser.cpp /^const char* sym_data::getTypeDesc(void)$/;" f class:sym_data get_base_path makedb/csdbheader.cpp /^tStr csdbheader::get_base_path(void)$/;" f class:csdbheader get_csdbpError makedb/cs2sq.h /^csdbparser::enResult get_csdbpError(void) {return m_csdbpLastErr;}$/;" f class:cs2sq get_last_part querylib/small_lib.cpp /^char* get_last_part(char* str, int c)$/;" f get_next_srcfil makedb/csdbparser.cpp /^csdbparser::enResult csdbparser::get_next_srcfil(std::string* srcfil)$/;" f class:csdbparser get_next_symbol makedb/csdbparser.cpp /^csdbparser::enResult csdbparser::get_next_symbol(symdata_pack* pack)$/;" f class:csdbparser get_param_list makedb/csdbheader.cpp /^tVecStr csdbheader::get_param_list(void)$/;" f class:csdbheader get_trailer_start makedb/csdbheader.cpp /^long int csdbheader::get_trailer_start(void)$/;" f class:csdbheader get_version makedb/csdbheader.cpp /^long int csdbheader::get_version(void)$/;" f class:csdbheader goBackInSearchMemory gui/searchhandler.cpp /^void searchhandler::goBackInSearchMemory(void)$/;" f class:searchhandler goForwardInSearchMemory gui/searchhandler.cpp /^void searchhandler::goForwardInSearchMemory(void)$/;" f class:searchhandler graph showgraph/Graph/edge_inline.h /^inline Graph * Edge::graph() const$/;" f class:Edge graph showgraph/Graph/node_inline.h /^inline Graph * Node::graph() const$/;" f class:Node graph showgraph/GraphView/edge_item.cpp /^GEdge::graph() const$/;" f class:GEdge graph showgraph/GraphView/graph_view.h /^ inline GGraph *graph() const$/;" f class:GraphView graph showgraph/GraphView/node_item.cpp /^GGraph* GNode::graph() const$/;" f class:GNode graph_p showgraph/Graph/edge.h /^ Graph * graph_p; \/\/Graph$/;" m class:Edge graph_p showgraph/Graph/node.h /^ Graph * graph_p;\/**< Pointer to graph *\/$/;" m class:Node graph_p showgraph/GraphView/graph_view.h /^ GGraph * graph_p;$/;" m class:GraphView group gui/obsolete/CodeEditorWidgetPlugin/CodeEditorWidgetPlugin.cpp /^ QString CodeEditorWidgetPlugin::group() const$/;" f class:CodeEditorWidgetPlugin group_weight showgraph/Layout/node_group.h /^ float group_weight;$/;" m class:NodeGroup gstyle showgraph/GraphView/style_edit.h /^ GStyle *gstyle;$/;" m class:StyleEdit handleFileCannotBeOpenedCase gui/fileviewer.cpp /^void fileviewer::handleFileCannotBeOpenedCase(void)$/;" f class:fileviewer hasSmoothFocus showgraph/GraphView/graph_view.h /^ inline bool hasSmoothFocus() const$/;" f class:GraphView height showgraph/GraphView/node_item.h /^ virtual inline double height() const$/;" f class:GNode height showgraph/Layout/aux_graph.h /^ inline qreal height() const$/;" f class:Level height showgraph/Layout/aux_node.h /^ virtual double height() const$/;" f class:AuxNode helper showgraph/GraphView/graph_view.h /^ EdgeHelper *helper;$/;" m class:GraphView highlight showgraph/GraphView/node_item.h /^ inline void highlight()$/;" f class:NodeItem highlightBlock gui/obsolete/highlighter.cpp /^ void Highlighter::highlightBlock(const QString &text)$/;" f class:Highlighter highlightCurrentLine gui/obsolete/CodeEditor.cpp /^ void CodeEditor::highlightCurrentLine()$/;" f class:CodeEditor highlightLine gui/fileviewer.cpp /^void fileviewer::highlightLine(unsigned int num)$/;" f class:fileviewer highlightLine gui/obsolete/CodeEditor.cpp /^ void CodeEditor::highlightLine(int linenum)$/;" f class:CodeEditor icon gui/obsolete/CodeEditorWidgetPlugin/CodeEditorWidgetPlugin.cpp /^ QIcon CodeEditorWidgetPlugin::icon() const$/;" f class:CodeEditorWidgetPlugin id makedb/cs2sq.h /^ std::string id;$/;" m struct:__anon4 id makedb/ctagread.h /^ std::string id;$/;" m struct:__anon6 id showgraph/Graph/edge_inline.h /^inline GraphUid Edge::id() const$/;" f class:Edge id showgraph/Graph/node_inline.h /^inline GraphUid Node::id() const$/;" f class:Node idxcounter querylib/small_lib.cpp /^idxcounter::idxcounter():m_ctr(0) {}$/;" f class:idxcounter idxcounter querylib/small_lib.cpp /^idxcounter::idxcounter(const idxcounter& idxc)$/;" f class:idxcounter idxcounter querylib/small_lib.h /^class idxcounter$/;" c impl showgraph/Graph/node_iter.h /^ EdgeIterImpl impl;$/;" m class:EdgeIterIface incNumItems showgraph/GraphView/gstyle.h /^inline void GStyle::incNumItems()$/;" f class:GStyle incRefCount showgraph/Utils/mem_obj.h /^ inline void incRefCount()$/;" f class:Mem::Obj includeFile gui/obsolete/CodeEditorWidgetPlugin/CodeEditorWidgetPlugin.cpp /^ QString CodeEditorWidgetPlugin::includeFile() const$/;" f class:CodeEditorWidgetPlugin index showgraph/Graph/marker.h /^ MarkerIndex index;$/;" m class:Marker index showgraph/Graph/num.h /^ NumIndex index;$/;" m class:Numeration init gui/fileviewer.cpp /^void fileviewer::init(void)$/;" f class:fileviewer init gui/listhandler.cpp /^void listhandler::init(void)$/;" f class:listhandler init gui/mainwindow.cpp /^void mainwindow::init(void)$/;" f class:mainwindow init gui/searchhandler.cpp /^void searchhandler::init(void)$/;" f class:searchhandler init showgraph/Layout/node_group.h /^ inline void init()$/;" f class:NodeGroup init showgraph/Utils/singleton.h /^Single< T>::init()$/;" f class:Single initLevels showgraph/Layout/aux_graph.cpp /^AuxGraph::initLevels( Rank max_level)$/;" f class:AuxGraph initialize gui/obsolete/CodeEditorWidgetPlugin/CodeEditorWidgetPlugin.cpp /^ void CodeEditorWidgetPlugin::initialize(QDesignerFormEditorInterface * \/* core *\/)$/;" f class:CodeEditorWidgetPlugin initialized gui/obsolete/CodeEditorWidgetPlugin/CodeEditorWidgetPlugin.h /^ bool initialized;$/;" m class:CodeEditorWidgetPlugin insertLabelNode showgraph/GraphView/edge_item.cpp /^GEdge::insertLabelNode( QPointF pos)$/;" f class:GEdge insertNode showgraph/Graph/agraph.h /^ virtual ANode *insertNode()$/;" f class:AEdge insertNode showgraph/Graph/edge_inline.h /^Edge::insertNode()$/;" f class:Edge insertNode showgraph/GraphView/edge_item.cpp /^GEdge::insertNode()$/;" f class:GEdge insertNode showgraph/Layout/aux_edge.h /^ inline AuxNode *insertNode()$/;" f class:AuxEdge insertNodeAct showgraph/GraphView/graph_view.h /^ QAction *insertNodeAct;$/;" m class:GraphView insertNodeOnCenter showgraph/GraphView/graph_view.cpp /^void GraphView::insertNodeOnCenter()$/;" f class:GraphView instance showgraph/Utils/singleton.h /^Single< T>::instance()$/;" f class:Single instance_p showgraph/Utils/singleton.h /^ static T* instance_p; $/;" m class:Single instance_p showgraph/Utils/singleton.h /^template < class T> T *Single::instance_p = 0; $/;" m class:Single intVal showgraph/Utils/conf.h /^ inline int intVal() const$/;" f class:Option int_val showgraph/Utils/conf.h /^ int int_val;$/;" m union:OptValues interleaves showgraph/Layout/node_group.h /^ inline bool interleaves( NodeGroup *grp) const$/;" f class:NodeGroup invalidateRanking showgraph/Layout/aux_graph.h /^ inline void invalidateRanking()$/;" f class:AuxGraph inverted showgraph/Layout/layout.cpp /^ bool inverted; \/** If we have already processed preds and *\/$/;" m struct:DfsStepInfo file: irId showgraph/GraphView/node_item.h /^ inline GraphNum irId() const$/;" f class:GNode ir_id showgraph/GraphView/node_item.h /^ GraphNum ir_id;$/;" m class:GNode isAbsolutePath querylib/small_lib.cpp /^bool isAbsolutePath(tStr fp)$/;" f isBack showgraph/Layout/aux_edge.h /^ inline bool isBack() const$/;" f class:AuxEdge isCSDBFileOpen makedb/cs2sq.h /^bool isCSDBFileOpen(void) {return m_csdbp.isFileOpen();}$/;" f class:cs2sq isContainer gui/obsolete/CodeEditorWidgetPlugin/CodeEditorWidgetPlugin.cpp /^ bool CodeEditorWidgetPlugin::isContainer() const$/;" f class:CodeEditorWidgetPlugin isContext showgraph/GraphView/graph_view.h /^ inline bool isContext() const$/;" f class:GraphView isCreateEdge showgraph/GraphView/graph_view.h /^ inline bool isCreateEdge() const$/;" f class:GraphView isDBOpen querylib/sqlquery.h /^ bool isDBOpen(void) {return (m_db != NULL);}$/;" f class:sqlquery isDefault showgraph/GraphView/gstyle.h /^inline bool GStyle::isDefault() const$/;" f class:GStyle isDefined showgraph/Utils/conf.h /^ inline bool isDefined() const$/;" f class:Option isDirApplicable showgraph/GraphView/navigation.cpp /^bool NodeNav::isDirApplicable( NavDirection dir, NavSector s)$/;" f class:NodeNav isEdgeControl showgraph/Layout/aux_node.h /^ inline bool isEdgeControl() const$/;" f class:AuxNode isEdgeInSector showgraph/GraphView/navigation.cpp /^bool NodeNav::isEdgeInSector( GEdge * edge) const$/;" f class:NodeNav isEdgeLabel showgraph/Layout/aux_node.h /^ inline bool isEdgeLabel() const$/;" f class:AuxNode isEditable showgraph/GraphView/graph_view.h /^ inline bool isEditable() const$/;" f class:GraphView isEmpty showgraph/Utils/mem_chunk.h /^ Chunk< Data>::isEmpty() const$/;" f class:MemImpl::Chunk isFileOpen makedb/csdbparser.h /^bool isFileOpen(void) {return (m_fp != NULL);}$/;" f class:csdbparser isFixed showgraph/Layout/aux_edge.h /^ inline bool isFixed() const$/;" f class:AuxEdge isFocus showgraph/GraphView/graph_view.h /^ bool isFocus() const$/;" f class:NavEvent isForPlacement showgraph/Layout/aux_node.h /^ inline bool isForPlacement() const$/;" f class:AuxNode isFree showgraph/Utils/mem_chunk.h /^ Chunk< Data>::isFree() const$/;" f class:MemImpl::Chunk isHorizontal showgraph/GraphView/visible_edge.cpp /^bool VEdge::isHorizontal() const$/;" f class:VEdge isInitialized gui/obsolete/CodeEditorWidgetPlugin/CodeEditorWidgetPlugin.cpp /^ bool CodeEditorWidgetPlugin::isInitialized() const$/;" f class:CodeEditorWidgetPlugin isInverted showgraph/Layout/aux_edge.h /^ inline bool isInverted() const$/;" f class:AuxEdge isMarked showgraph/Graph/marker.h /^inline bool Marked::isMarked( Marker marker)$/;" f class:Marked isNodeInFocus showgraph/GraphView/node_item.cpp /^bool GNode::isNodeInFocus() const$/;" f class:GNode isNotNullP showgraph/Utils/misc.h /^inline bool isNotNullP( const void *pointer)$/;" f isNullP showgraph/Utils/misc.h /^inline bool isNullP( const void *pointer)$/;" f isNumbered showgraph/Graph/num.h /^Numbered::isNumbered( Numeration num)$/;" f class:Numbered isPointInDir showgraph/GraphView/navigation.cpp /^bool NodeNav::isPointInDir( QPointF point, QPointF ref, NavDirection dir)$/;" f class:NodeNav isPseudo showgraph/Layout/aux_node.h /^ inline bool isPseudo() const$/;" f class:AuxNode isSelf showgraph/Layout/aux_edge.h /^ inline bool isSelf() const$/;" f class:AuxEdge isSet showgraph/Utils/conf.h /^ inline int isSet() const$/;" f class:Option isShowContextMenus showgraph/GraphView/graph_view.h /^ inline bool isShowContextMenus() const$/;" f class:GraphView isSimple showgraph/Layout/aux_node.h /^ inline bool isSimple() const$/;" f class:AuxNode isStable showgraph/Layout/aux_node.h /^ inline bool isStable() const$/;" f class:AuxNode isStartNode showgraph/Layout/layout.cpp /^static bool isStartNode( AuxNode *n)$/;" f file: isTextShown showgraph/GraphView/node_item.h /^ inline bool isTextShown() const$/;" f class:GNode isValueBusy showgraph/Graph/marker.h /^MarkerManager::isValueBusy( MarkerValue val)$/;" f class:MarkerManager isValueBusy showgraph/Graph/num.h /^inline bool NumManager::isValueBusy( NumValue val)$/;" f class:NumManager isVertical showgraph/GraphView/visible_edge.cpp /^bool VEdge::isVertical() const$/;" f class:VEdge is_busy showgraph/Utils/mem_entry.h /^ bool is_busy;$/;" m class:MemImpl::Entry is_default showgraph/GraphView/gstyle.h /^ bool is_default;$/;" m class:GStyle is_for_placement showgraph/Layout/aux_node.h /^ bool is_for_placement;$/;" m class:AuxNode is_pred showgraph/Graph/node_iter.h /^ bool is_pred;$/;" m class:UnDirIterImpl is_used showgraph/Graph/marker.h /^ bool is_used[ MAX_GRAPH_MARKERS];$/;" m class:MarkerManager is_used showgraph/Graph/num.h /^ bool is_used[ MAX_NUMERATIONS];$/;" m class:NumManager isempty querylib/small_lib.cpp /^bool tempbuf::isempty(void) const {return (*m_buffer == 0);}$/;" f class:tempbuf it showgraph/GraphView/graph_view.h /^ QList< NavEvent *>::Iterator it; \/\/ Iterator to hold current position in list$/;" m class:GraphViewHistory item showgraph/GraphView/edge_item.h /^ inline EdgeItem *item() const$/;" f class:GEdge item showgraph/GraphView/node_item.h /^ inline NodeItem* item() const$/;" f class:GNode itemChange showgraph/GraphView/edge_item.cpp /^EdgeItem::itemChange( GraphicsItemChange change, const QVariant &value)$/;" f class:EdgeItem itemChange showgraph/GraphView/node_item.cpp /^QVariant NodeItem::itemChange( GraphicsItemChange change, const QVariant &value)$/;" f class:NodeItem item_p showgraph/GraphView/edge_item.h /^ EdgeItem *item_p;$/;" m class:GEdge item_p showgraph/GraphView/node_item.h /^ NodeItem *item_p; $/;" m class:GNode javaHighlightingRules gui/obsolete/highlighter.h /^ QVector javaHighlightingRules;$/;" m class:Highlighter java_Bespin gui/themes_gen.cpp /^static const lexstyle java_Bespin[] = {$/;" v file: java_Black_board gui/themes_gen.cpp /^static const lexstyle java_Black_board[] = {$/;" v file: java_Choco gui/themes_gen.cpp /^static const lexstyle java_Choco[] = {$/;" v file: java_Deep_Black gui/themes_gen.cpp /^static const lexstyle java_Deep_Black[] = {$/;" v file: java_Eclipse_Default gui/themes_gen.cpp /^static const lexstyle java_Eclipse_Default[] = {$/;" v file: java_Hello_Kitty gui/themes_gen.cpp /^static const lexstyle java_Hello_Kitty[] = {$/;" v file: java_HotFudgeSundae gui/themes_gen.cpp /^static const lexstyle java_HotFudgeSundae[] = {$/;" v file: java_Mono_Industrial gui/themes_gen.cpp /^static const lexstyle java_Mono_Industrial[] = {$/;" v file: java_Monokai gui/themes_gen.cpp /^static const lexstyle java_Monokai[] = {$/;" v file: java_MossyLawn gui/themes_gen.cpp /^static const lexstyle java_MossyLawn[] = {$/;" v file: java_Navajo gui/themes_gen.cpp /^static const lexstyle java_Navajo[] = {$/;" v file: java_NotepadPlusPlus gui/themes_gen.cpp /^static const lexstyle java_NotepadPlusPlus[] = {$/;" v file: java_Obsidian gui/themes_gen.cpp /^static const lexstyle java_Obsidian[] = {$/;" v file: java_Plastic_Code_Wrap gui/themes_gen.cpp /^static const lexstyle java_Plastic_Code_Wrap[] = {$/;" v file: java_Ruby_Blue gui/themes_gen.cpp /^static const lexstyle java_Ruby_Blue[] = {$/;" v file: java_Solarized gui/themes_gen.cpp /^static const lexstyle java_Solarized[] = {$/;" v file: java_Solarized_light gui/themes_gen.cpp /^static const lexstyle java_Solarized_light[] = {$/;" v file: java_Twilight gui/themes_gen.cpp /^static const lexstyle java_Twilight[] = {$/;" v file: java_Vibrant_Ink gui/themes_gen.cpp /^static const lexstyle java_Vibrant_Ink[] = {$/;" v file: java_Zenburn gui/themes_gen.cpp /^static const lexstyle java_Zenburn[] = {$/;" v file: java_khaki gui/themes_gen.cpp /^static const lexstyle java_khaki[] = {$/;" v file: java_vim_Dark_Blue gui/themes_gen.cpp /^static const lexstyle java_vim_Dark_Blue[] = {$/;" v file: javastyle gui/themes_gen.cpp /^static const langstyle javastyle[] = {$/;" v file: keyPressEvent showgraph/GraphView/edge_item.cpp /^EdgeItem::keyPressEvent(QKeyEvent *event)$/;" f class:EdgeItem keyPressEvent showgraph/GraphView/graph_view.cpp /^GraphView::keyPressEvent(QKeyEvent *event)$/;" f class:GraphView keyPressEvent showgraph/GraphView/node_item.cpp /^void NodeItem::keyPressEvent(QKeyEvent *event)$/;" f class:NodeItem keywordFormat gui/obsolete/highlighter.h /^ QTextCharFormat keywordFormat;$/;" m class:Highlighter langFile gui/langtable.cpp /^ const char* langFile;$/;" m struct:__anon1 file: langName gui/langtable.cpp /^ const char* langName;$/;" m struct:__anon1 file: langTable gui/langtable.cpp /^static const langTableType langTable[]=$/;" v file: langTableType gui/langtable.cpp /^}langTableType;$/;" t typeref:struct:__anon1 file: langstyle gui/themes.cpp /^}langstyle;$/;" t typeref:struct:__anon3 file: langtable gui/langtable.h /^class langtable$/;" c langtypes gui/fileviewer.h /^enum langtypes$/;" g last showgraph/Graph/marker.h /^ MarkerValue last;$/;" m class:MarkerManager last showgraph/Graph/num.h /^ NumValue last;$/;" m class:NumManager last showgraph/GraphView/graph_view.cpp /^NavEvent *GraphViewHistory::last()$/;" f class:GraphViewHistory layoutNextStep showgraph/Layout/layout.cpp /^void AuxGraph::layoutNextStep()$/;" f class:AuxGraph layoutPostProcess showgraph/GraphView/graph_view.cpp /^void GGraph::layoutPostProcess()$/;" f class:GGraph layoutPostProcess showgraph/Layout/layout.cpp /^void AuxGraph::layoutPostProcess()$/;" f class:AuxGraph layout_in_process showgraph/Layout/aux_graph.h /^ bool layout_in_process;$/;" m class:AuxGraph left showgraph/Layout/node_group.h /^ inline qreal left() const$/;" f class:NodeGroup level showgraph/Layout/aux_node.h /^ inline Level *level() const$/;" f class:AuxNode level_rank showgraph/Layout/aux_graph.h /^ Rank level_rank;$/;" m class:Level levels showgraph/Layout/aux_graph.h /^ QVector< Level*> levels;$/;" m class:AuxGraph lexstyle gui/themes.cpp /^}lexstyle;$/;" t typeref:struct:__anon2 file: lexstylesize gui/themes.cpp /^ int lexstylesize;$/;" m struct:__anon3 file: lexstyletable gui/themes.cpp /^ const lexstyle *lexstyletable;$/;" m struct:__anon3 file: lineNumberArea gui/obsolete/CodeEditor.h /^ QWidget *lineNumberArea;$/;" m class:CodeEditor lineNumberAreaPaintEvent gui/obsolete/CodeEditor.cpp /^ void CodeEditor::lineNumberAreaPaintEvent(QPaintEvent *event)$/;" f class:CodeEditor lineNumberAreaWidth gui/obsolete/CodeEditor.cpp /^ int CodeEditor::lineNumberAreaWidth()$/;" f class:CodeEditor line_color_button showgraph/GraphView/style_edit.h /^ ColorButton *line_color_button;$/;" m class:StyleEdit line_color_label showgraph/GraphView/style_edit.h /^ QLabel *line_color_label;$/;" m class:StyleEdit line_num makedb/csdbparser.h /^long int line_num;$/;" m class:symdata_pack line_num_str makedb/csdbparser.cpp /^std::string symdata_pack::line_num_str(void)$/;" f class:symdata_pack line_style_combo showgraph/GraphView/style_edit.h /^ QComboBox *line_style_combo;$/;" m class:StyleEdit line_style_label showgraph/GraphView/style_edit.h /^ QLabel *line_style_label;$/;" m class:StyleEdit line_text makedb/csdbparser.h /^std::string line_text;$/;" m class:symdata_pack line_text_blob makedb/csdbparser.cpp /^std::string symdata_pack::line_text_blob(void)$/;" f class:symdata_pack line_text_escaped makedb/csdbparser.cpp /^std::string symdata_pack::line_text_escaped(void)$/;" f class:symdata_pack line_text_replacetab makedb/csdbparser.cpp /^std::string symdata_pack::line_text_replacetab(void)$/;" f class:symdata_pack line_width_label showgraph/GraphView/style_edit.h /^ QLabel *line_width_label;$/;" m class:StyleEdit line_width_spin showgraph/GraphView/style_edit.h /^ QDoubleSpinBox *line_width_spin;$/;" m class:StyleEdit linenum gui/fileviewer.h /^ QString linenum;$/;" m class:filedata linenum querylib/sqlquery.h /^ tStr linenum;$/;" m class:sqlqueryresult linetext querylib/sqlquery.h /^ tStr linetext;$/;" m class:sqlqueryresult listItemClicked gui/listhandler.cpp /^void listhandler::listItemClicked(QTreeWidgetItem * current, QTreeWidgetItem * previous)$/;" f class:listhandler listhandler gui/listhandler.cpp /^listhandler::listhandler(mainwindow* pmw)$/;" f class:listhandler listhandler gui/listhandler.h /^class listhandler : public QObject$/;" c literalFormat gui/obsolete/highlighter.h /^ QTextCharFormat literalFormat;$/;" m class:Highlighter longName showgraph/Utils/conf.h /^ inline QString longName() const$/;" f class:Option longOption showgraph/Utils/conf.h /^ inline Option* longOption( QString name)$/;" f class:Conf long_name showgraph/Utils/conf.h /^ QString long_name;$/;" m class:Option long_opts showgraph/Utils/conf.h /^ QHash< QString, Option *> long_opts;$/;" m class:Conf m_DBtimestamp gui/fileviewer.h /^QDateTime m_DBtimestamp;$/;" m class:fileviewer m_HighlightedLineNumber gui/obsolete/CodeEditor.h /^ int m_HighlightedLineNumber;$/;" m class:CodeEditor m_app gui/mainwindow.h /^QApplication *m_app;$/;" m class:mainwindow m_autocompBusy gui/searchhandler.h /^bool m_autocompBusy;$/;" m class:searchhandler m_autocompFutureWatcher gui/searchhandler.h /^QFutureWatcher m_autocompFutureWatcher;$/;" m class:searchhandler m_autocompSrchTerm gui/searchhandler.h /^QString m_autocompSrchTerm;$/;" m class:searchhandler m_autocompstmt querylib/sqlquery.h /^ tempstmt m_autocompstmt;$/;" m class:sqlquery m_base_path makedb/csdbheader.h /^tStr m_base_path;$/;" m class:csdbheader m_base_path makedb/csdbparser.h /^std::string m_base_path;$/;" m class:csdbparser m_basepath querylib/sqlquery.h /^ tStr m_basepath;$/;" m class:sqlquery m_buf makedb/cs2sq.h /^char* m_buf;$/;" m class:cs2sq m_buf makedb/csdbparser.h /^char *m_buf;$/;" m class:csdbparser m_buf querylib/small_lib.h /^ char m_buf[20];$/;" m class:idxcounter m_buffer querylib/small_lib.h /^char* m_buffer;$/;" m class:tempbuf m_bufsize makedb/csdbparser.h /^long int m_bufsize;$/;" m class:csdbparser m_calling_func makedb/cs2sq.h /^stStrID m_calling_func;$/;" m class:cs2sq m_calling_func makedb/csdbparser.h /^std::string m_calling_func;$/;" m class:csdbparser m_calling_macro makedb/cs2sq.h /^stStrID m_calling_macro;$/;" m class:cs2sq m_calling_macro makedb/csdbparser.h /^std::string m_calling_macro;$/;" m class:csdbparser m_callstmt makedb/cs2sq.h /^sqlite3_stmt* m_callstmt;$/;" m class:cs2sq m_checkBoxAutoComplete gui/searchhandler.h /^QCheckBox *m_checkBoxAutoComplete;$/;" m class:searchhandler m_checkBoxExactMatch gui/searchhandler.h /^QCheckBox *m_checkBoxExactMatch;$/;" m class:searchhandler m_checkBoxFilter gui/searchhandler.h /^QCheckBox *m_checkBoxFilter;$/;" m class:searchhandler m_checkBoxSymbolOnly gui/fileviewer.h /^QCheckBox *m_checkBoxSymbolOnly;$/;" m class:fileviewer m_comboBoxDB gui/searchhandler.h /^QComboBox *m_comboBoxDB;$/;" m class:searchhandler m_comboBoxFilter gui/searchhandler.h /^QComboBox *m_comboBoxFilter;$/;" m class:searchhandler m_comboBoxQueryType gui/searchhandler.h /^QComboBox *m_comboBoxQueryType;$/;" m class:searchhandler m_comboBoxSearch gui/searchhandler.h /^QComboBox *m_comboBoxSearch;$/;" m class:searchhandler m_completer gui/searchhandler.h /^QCompleter *m_completer;$/;" m class:searchhandler m_csdbp makedb/cs2sq.h /^csdbparser m_csdbp;$/;" m class:cs2sq m_csdbpLastErr makedb/cs2sq.h /^csdbparser::enResult m_csdbpLastErr;$/;" m class:cs2sq m_csdbver makedb/csdbheader.h /^long int m_csdbver;$/;" m class:csdbheader m_ctr querylib/small_lib.h /^ long unsigned int m_ctr;$/;" m class:idxcounter m_currentLanguage gui/mainwindow.h /^QString m_currentLanguage;$/;" m class:mainwindow m_current_srcfile makedb/csdbparser.h /^std::string m_current_srcfile;$/;" m class:csdbparser m_currentlang gui/fileviewer.h /^int m_currentlang;$/;" m class:fileviewer m_db makedb/sqlbase.h /^sqlite3 *m_db;$/;" m class:sqlbase m_db querylib/sqlquery.h /^ sqlite3 *m_db;$/;" m class:sqlquery m_debug makedb/csdbparser.h /^bool m_debug;$/;" m class:csdbparser m_debug makedb/sqlbase.h /^bool m_debug;$/;" m class:sqlbase m_dot gui/graphdialog.h /^QString m_dot;$/;" m class:cqDialogGraph m_externalEditorPath gui/fileviewer.h /^QString m_externalEditorPath;$/;" m class:fileviewer m_fileDataList gui/fileviewer.h /^QVector m_fileDataList;$/;" m class:fileviewer m_filesstmt makedb/cs2sq.h /^sqlite3_stmt* m_filesstmt;$/;" m class:cs2sq m_fileviewer gui/mainwindow.h /^fileviewer* m_fileviewer;$/;" m class:mainwindow m_fontlist gui/fileviewer.h /^QStringList m_fontlist;$/;" m class:fileviewer m_fontsize gui/fileviewer.h /^int m_fontsize;$/;" m class:fileviewer m_fonttemp gui/fileviewer.h /^QString m_fonttemp;$/;" m class:fileviewer m_fontwidthtemp gui/fileviewer.h /^int m_fontwidthtemp;$/;" m class:fileviewer m_fp makedb/csdbparser.h /^FILE *m_fp;$/;" m class:csdbparser m_fp querylib/small_lib.h /^FILE* m_fp;$/;" m class:smartFILE m_fv gui/fileviewsettingsdialog.h /^fileviewer* m_fv;$/;" m class:cqDialogFileViewSettings m_graphdesc gui/searchhandler.h /^QString m_graphdesc;$/;" m class:searchhandler m_grepExactMatch gui/searchhandler.cpp /^bool searchhandler::m_grepExactMatch = false;$/;" m class:searchhandler file: m_grepExactMatch gui/searchhandler.h /^static bool m_grepExactMatch;$/;" m class:searchhandler m_grepRegExp gui/searchhandler.cpp /^QRegExp* searchhandler::m_grepRegExp = NULL;$/;" m class:searchhandler file: m_grepRegExp gui/searchhandler.h /^static QRegExp* m_grepRegExp;$/;" m class:searchhandler m_header makedb/csdbheader.h /^tStr m_header;$/;" m class:csdbheader m_img gui/graphdialog.h /^QImage m_img;$/;" m class:cqDialogGraph m_insertinheritstmt makedb/ctagread.h /^sqlite3_stmt* m_insertinheritstmt;$/;" m class:ctagread m_insertstmt makedb/ctagread.h /^sqlite3_stmt* m_insertstmt;$/;" m class:ctagread m_intAddlRulesMode gui/obsolete/highlighter.h /^ int m_intAddlRulesMode;$/;" m class:Highlighter m_intLanguage gui/obsolete/highlighter.h /^ int m_intLanguage;$/;" m class:Highlighter m_itemlist gui/listhandler.h /^QList m_itemlist;$/;" m class:listhandler m_iter gui/fileviewer.h /^QVector::iterator m_iter;$/;" m class:fileviewer m_iter gui/searchhandler.h /^QVector::iterator m_iter;$/;" m class:searchhandler m_labelFilePath gui/fileviewer.h /^QLabel *m_labelFilePath;$/;" m class:fileviewer m_lexer gui/fileviewer.h /^QsciLexer* m_lexer;$/;" m class:fileviewer m_linesstmt makedb/cs2sq.h /^sqlite3_stmt* m_linesstmt;$/;" m class:cs2sq m_listhandler gui/mainwindow.h /^listhandler* m_listhandler;$/;" m class:mainwindow m_markerhandle gui/fileviewer.h /^int m_markerhandle;$/;" m class:fileviewer m_noclick gui/listhandler.h /^bool m_noclick;$/;" m class:listhandler m_param_list makedb/csdbheader.h /^tVecStr m_param_list;$/;" m class:csdbheader m_pushButtonClipSearch gui/searchhandler.h /^QPushButton *m_pushButtonClipSearch;$/;" m class:searchhandler m_pushButtonDown gui/listhandler.h /^QPushButton *m_pushButtonDown;$/;" m class:listhandler m_pushButtonGoToLine gui/fileviewer.h /^QPushButton *m_pushButtonGoToLine;$/;" m class:fileviewer m_pushButtonGraph gui/searchhandler.h /^QPushButton *m_pushButtonGraph;$/;" m class:searchhandler m_pushButtonNext gui/fileviewer.h /^QPushButton *m_pushButtonNext;$/;" m class:fileviewer m_pushButtonOpenDB gui/searchhandler.h /^QPushButton *m_pushButtonOpenDB;$/;" m class:searchhandler m_pushButtonOpenInEditor gui/fileviewer.h /^QPushButton *m_pushButtonOpenInEditor;$/;" m class:fileviewer m_pushButtonPaste gui/fileviewer.h /^QPushButton *m_pushButtonPaste;$/;" m class:fileviewer m_pushButtonPrev gui/fileviewer.h /^QPushButton *m_pushButtonPrev;$/;" m class:fileviewer m_pushButtonSearch gui/searchhandler.h /^QPushButton *m_pushButtonSearch;$/;" m class:searchhandler m_pushButtonSearchNext gui/searchhandler.h /^QPushButton *m_pushButtonSearchNext;$/;" m class:searchhandler m_pushButtonSearchPrev gui/searchhandler.h /^QPushButton *m_pushButtonSearchPrev;$/;" m class:searchhandler m_pushButtonTextEnlarge gui/fileviewer.h /^QPushButton *m_pushButtonTextEnlarge;$/;" m class:fileviewer m_pushButtonTextShrink gui/fileviewer.h /^QPushButton *m_pushButtonTextShrink;$/;" m class:fileviewer m_pushButtonUp gui/listhandler.h /^QPushButton *m_pushButtonUp;$/;" m class:listhandler m_readclassstmt makedb/ctagread.h /^sqlite3_stmt* m_readclassstmt;$/;" m class:ctagread m_readsymfstmt makedb/ctagread.h /^sqlite3_stmt* m_readsymfstmt;$/;" m class:ctagread m_readsymstmt makedb/ctagread.h /^sqlite3_stmt* m_readsymstmt;$/;" m class:ctagread m_scaleFactor gui/graphdialog.h /^double m_scaleFactor;$/;" m class:cqDialogGraph m_searchMemoryList gui/searchhandler.h /^QVector m_searchMemoryList;$/;" m class:searchhandler m_searchhandler gui/mainwindow.h /^searchhandler* m_searchhandler;$/;" m class:mainwindow m_searchstmt querylib/sqlquery.h /^ tempstmt m_searchstmt;$/;" m class:sqlquery m_size querylib/small_lib.h /^unsigned int m_size;$/;" m class:tempbuf m_sqlist gui/listhandler.h /^sqlqueryresultlist m_sqlist;$/;" m class:listhandler m_srchStrLstModel gui/searchhandler.h /^QStringListModel m_srchStrLstModel;$/;" m class:searchhandler m_state makedb/csdbparser.h /^enState m_state;$/;" m class:csdbparser m_stmt querylib/sqlquery.h /^sqlite3_stmt *m_stmt;$/;" m class:tempstmt m_symstmt makedb/cs2sq.h /^sqlite3_stmt* m_symstmt;$/;" m class:cs2sq m_tabwidthvalidator gui/fileviewsettingsdialog.h /^QIntValidator m_tabwidthvalidator;$/;" m class:cqDialogFileViewSettings m_textEditSource gui/fileviewer.h /^QsciScintilla *m_textEditSource;$/;" m class:fileviewer m_textEditSourceFont gui/fileviewer.h /^QFont m_textEditSourceFont;$/;" m class:fileviewer m_theme gui/fileviewer.h /^QString m_theme;$/;" m class:fileviewer m_themelast gui/fileviewer.h /^QString m_themelast;$/;" m class:fileviewer m_themetemp gui/fileviewer.h /^QString m_themetemp;$/;" m class:fileviewer m_timestampMismatchWarned gui/fileviewer.h /^bool m_timestampMismatchWarned;$/;" m class:fileviewer m_trailer_start makedb/csdbheader.h /^long int m_trailer_start;$/;" m class:csdbheader m_trailer_start makedb/csdbparser.h /^long int m_trailer_start;$/;" m class:csdbparser m_translator gui/mainwindow.h /^QTranslator m_translator;$/;" m class:mainwindow m_treeWidgetSearchResults gui/listhandler.h /^QTreeWidget *m_treeWidgetSearchResults;$/;" m class:listhandler m_typeOfGraph gui/searchhandler.h /^int m_typeOfGraph; \/\/ 1 = Function Call, 2 = Class Inheritance$/;" m class:searchhandler m_writedeststmt makedb/ctagread.h /^sqlite3_stmt* m_writedeststmt;$/;" m class:ctagread main cli/main_cli.cpp /^int main(int argc, char *argv[])$/;" f main gui/main_gui.cpp /^int main(int argc, char *argv[])$/;" f main makedb/main.cpp /^int main(int argc, char *argv[])$/;" f mainwindow gui/mainwindow.cpp /^mainwindow::mainwindow(QMainWindow *parent, QApplication *app)$/;" f class:mainwindow mainwindow gui/mainwindow.h /^class mainwindow : public QMainWindow$/;" c mark showgraph/Graph/marker.h /^inline bool Marked::mark( Marker marker)$/;" f class:Marked markReachableDown showgraph/Layout/layout.cpp /^AuxGraph::markReachableDown( AuxNode *n,$/;" f class:AuxGraph markers showgraph/Graph/marker.h /^ MarkerValue markers[ MAX_GRAPH_MARKERS];$/;" m class:Marked markers showgraph/Graph/marker.h /^ MarkerValue markers[ MAX_GRAPH_MARKERS];$/;" m class:MarkerManager maxRank showgraph/Layout/aux_graph.h /^ inline GraphNum maxRank() const$/;" f class:AuxGraph max_rank showgraph/Layout/aux_graph.h /^ GraphNum max_rank;$/;" m class:AuxGraph merge showgraph/Layout/node_group.cpp /^void NodeGroup::merge( NodeGroup *grp)$/;" f class:NodeGroup message showgraph/GraphView/gview_iface.h /^ inline QString message()$/;" f class:GGraphError mode showgraph/GraphView/edge_item.h /^ inline EdgeMode mode() const$/;" f class:EdgeItem modelX showgraph/Layout/aux_node.h /^ inline double modelX() const$/;" f class:AuxNode modelY showgraph/Layout/aux_node.h /^ inline double modelY() const$/;" f class:AuxNode mouseDoubleClickEvent showgraph/GraphView/edge_item.cpp /^void EdgeItem::mouseDoubleClickEvent(QGraphicsSceneMouseEvent *ev)$/;" f class:EdgeItem mouseDoubleClickEvent showgraph/GraphView/graph_view.cpp /^GraphView::mouseDoubleClickEvent(QMouseEvent *ev)$/;" f class:GraphView mouseDoubleClickEvent showgraph/GraphView/node_item.cpp /^void NodeItem::mouseDoubleClickEvent(QGraphicsSceneMouseEvent *event)$/;" f class:NodeItem mouseMoveEvent showgraph/GraphView/graph_view.cpp /^GraphView::mouseMoveEvent(QMouseEvent *ev)$/;" f class:GraphView mousePressEvent showgraph/GraphView/edge_item.cpp /^void EdgeItem::mousePressEvent(QGraphicsSceneMouseEvent *event)$/;" f class:EdgeItem mousePressEvent showgraph/GraphView/graph_view.cpp /^GraphView::mousePressEvent(QMouseEvent *ev)$/;" f class:GraphView mousePressEvent showgraph/GraphView/node_item.cpp /^void NodeItem::mousePressEvent( QGraphicsSceneMouseEvent *event)$/;" f class:NodeItem mouseReleaseEvent showgraph/GraphView/edge_item.cpp /^void EdgeItem::mouseReleaseEvent(QGraphicsSceneMouseEvent *ev)$/;" f class:EdgeItem mouseReleaseEvent showgraph/GraphView/graph_view.cpp /^GraphView::mouseReleaseEvent( QMouseEvent *ev)$/;" f class:GraphView mouseReleaseEvent showgraph/GraphView/node_item.cpp /^void NodeItem::mouseReleaseEvent( QGraphicsSceneMouseEvent *event)$/;" f class:NodeItem msg_priv showgraph/GraphView/gview_iface.h /^ QString msg_priv;$/;" m class:GGraphError multiLineCommentFormat gui/obsolete/highlighter.h /^ QTextCharFormat multiLineCommentFormat;$/;" m class:Highlighter mw gui/fileviewer.h /^mainwindow *mw;$/;" m class:fileviewer mw gui/listhandler.h /^mainwindow *mw;$/;" m class:listhandler mw gui/searchhandler.h /^mainwindow *mw;$/;" m class:searchhandler my_pos showgraph/Utils/mem_entry.h /^ ChunkPos my_pos;$/;" m class:MemImpl::Entry name gui/obsolete/CodeEditorWidgetPlugin/CodeEditorWidgetPlugin.cpp /^ QString CodeEditorWidgetPlugin::name() const$/;" f class:CodeEditorWidgetPlugin name showgraph/GraphView/gstyle.h /^inline QString GStyle::name() const$/;" f class:GStyle name_combo showgraph/GraphView/style_edit.h /^ QComboBox *name_combo;$/;" m class:StyleEdit name_label showgraph/GraphView/style_edit.h /^ QLabel *name_label;$/;" m class:StyleEdit name_priv showgraph/GraphView/gstyle.h /^ QString name_priv;$/;" m class:GStyle navNext showgraph/GraphView/graph_view.cpp /^void GraphView::navNext()$/;" f class:GraphView navPrev showgraph/GraphView/graph_view.cpp /^void GraphView::navPrev()$/;" f class:GraphView newEdge showgraph/Graph/agraph.h /^ AEdge* newEdge( ANode* pred, ANode* succ)$/;" f class:AGraph newEdge showgraph/Graph/graph_inline.h /^Graph::newEdge( Node * pred, Node * succ)$/;" f class:Graph newEdge showgraph/Graph/graph_inline.h /^Graph::newEdge( Node * pred, Node * succ, QDomElement e)$/;" f class:Graph newEdge showgraph/GraphView/graph_view.cpp /^GGraph::newEdge( GNode* pred, GNode* succ)$/;" f class:GGraph newEdge showgraph/GraphView/graph_view.cpp /^GGraph::newEdge( GNode* pred, GNode* succ, QDomElement e)$/;" f class:GGraph newEdge showgraph/GraphView/graph_view.h /^ AuxEdge* newEdge( AuxNode * pred, AuxNode *succ)$/;" f class:GGraph newEdge showgraph/GraphView/graph_view.h /^ AuxEdge* newEdge( AuxNode * pred, AuxNode *succ, QDomElement e)$/;" f class:GGraph newEdgeImpl showgraph/Graph/graph_inline.h /^Graph::newEdgeImpl( Node * pred, Node * succ)$/;" f class:Graph newMarker showgraph/Graph/marker.h /^inline Marker MarkerManager::newMarker()$/;" f class:MarkerManager newNode showgraph/Graph/agraph.h /^ ANode* newNode()$/;" f class:AGraph newNode showgraph/Graph/graph_inline.h /^Graph::newNode( QDomElement e)$/;" f class:Graph newNode showgraph/Graph/graph_inline.h /^Graph::newNode()$/;" f class:Graph newNode showgraph/GraphView/graph_view.cpp /^GGraph::newNode( QDomElement e)$/;" f class:GGraph newNode showgraph/GraphView/graph_view.cpp /^GGraph::newNode()$/;" f class:GGraph newNodeImpl showgraph/Graph/graph_inline.h /^Graph::newNodeImpl( GraphUid id)$/;" f class:Graph newNum showgraph/Graph/num.h /^inline Numeration NumManager::newNum()$/;" f class:NumManager newSearchText gui/searchhandler.cpp /^void searchhandler::newSearchText()$/;" f class:searchhandler newSearchTextSymbolOnly gui/searchhandler.cpp /^void searchhandler::newSearchTextSymbolOnly()$/;" f class:searchhandler new_style showgraph/GraphView/graph_view.h /^ GStyle *new_style;$/;" m struct:GraphView::StyleEditInfo next makedb/optlist.h /^ struct option_t *next;$/;" m struct:option_t typeref:struct:option_t::option_t next showgraph/GraphView/graph_view.cpp /^NavEvent *GraphViewHistory::next()$/;" f class:GraphViewHistory next showgraph/Utils/list.h /^ inline Item *next( ListId list) const$/;" f class:MListIface next showgraph/Utils/list.h /^ inline Item *next() const$/;" f class:MListIface next showgraph/Utils/list.h /^ inline Item *next() const$/;" f class:SListIface next showgraph/Utils/list.h /^ inline ListItem *next() const$/;" f class:ListItem next showgraph/Utils/list.h /^ inline MListItem< 1> *next() const$/;" f class:MListItem next showgraph/Utils/list.h /^ inline MListItem< dim> *next( ListId list) const$/;" f class:MListItem nextEdge showgraph/Graph/agraph.h /^ inline AEdge* nextEdge()$/;" f class:AEdge nextEdge showgraph/Graph/edge_inline.h /^inline Edge* Edge::nextEdge()$/;" f class:Edge nextEdge showgraph/Graph/node_inline.h /^inline void PredIterImpl::nextEdge()$/;" f class:PredIterImpl nextEdge showgraph/Graph/node_inline.h /^inline void SuccIterImpl::nextEdge()$/;" f class:SuccIterImpl nextEdge showgraph/Graph/node_inline.h /^inline void UnDirIterImpl::nextEdge()$/;" f class:UnDirIterImpl nextEdge showgraph/GraphView/edge_item.h /^ inline GEdge* nextEdge()$/;" f class:GEdge nextEdge showgraph/Layout/aux_edge.h /^ inline AuxEdge* nextEdge()$/;" f class:AuxEdge nextEdgeInDir showgraph/Graph/agraph.h /^ inline AEdge* nextEdgeInDir( GraphDir dir)$/;" f class:AEdge nextEdgeInDir showgraph/Graph/edge_inline.h /^inline Edge* Edge::nextEdgeInDir( GraphDir dir)$/;" f class:Edge nextEdgeInDir showgraph/GraphView/edge_item.h /^ inline GEdge* nextEdgeInDir( GraphDir dir)$/;" f class:GEdge nextEdgeInDir showgraph/Layout/aux_edge.h /^ inline AuxEdge* nextEdgeInDir( GraphDir dir)$/;" f class:AuxEdge nextFree showgraph/Utils/mem_entry.h /^ Entry< Data>::nextFree() const$/;" f class:MemImpl::Entry nextNode showgraph/Graph/agraph.h /^ inline ANode* nextNode()$/;" f class:ANode nextNode showgraph/Graph/node_inline.h /^inline Node* Node::nextNode()$/;" f class:Node nextNode showgraph/GraphView/node_item.h /^ inline GNode* nextNode()$/;" f class:GNode nextNode showgraph/Layout/aux_node.h /^ inline AuxNode* nextNode()$/;" f class:AuxNode nextPred showgraph/Graph/agraph.h /^ inline AEdge* nextPred()$/;" f class:AEdge nextPred showgraph/Graph/edge_inline.h /^inline Edge* Edge::nextPred()$/;" f class:Edge nextPred showgraph/GraphView/edge_item.h /^ inline GEdge* nextPred()$/;" f class:GEdge nextPred showgraph/Layout/aux_edge.h /^ inline AuxEdge* nextPred()$/;" f class:AuxEdge nextSucc showgraph/Graph/agraph.h /^ inline AEdge* nextSucc()$/;" f class:AEdge nextSucc showgraph/Graph/edge_inline.h /^inline Edge* Edge::nextSucc()$/;" f class:Edge nextSucc showgraph/GraphView/edge_item.h /^ inline GEdge* nextSucc()$/;" f class:GEdge nextSucc showgraph/Layout/aux_edge.h /^ inline AuxEdge* nextSucc()$/;" f class:AuxEdge nextValue showgraph/Graph/marker.h /^MarkerManager::nextValue()$/;" f class:MarkerManager nextValue showgraph/Graph/num.h /^inline NumValue NumManager::nextValue()$/;" f class:NumManager next_free_pos showgraph/Utils/mem_entry.h /^ ChunkPos next_free_pos;$/;" m class:MemImpl::Entry node showgraph/Graph/agraph.h /^ inline ANode *node( GraphDir dir) const$/;" f class:AEdge node showgraph/Graph/edge_inline.h /^inline Node *Edge::node( GraphDir dir) const$/;" f class:Edge node showgraph/Graph/node_inline.h /^EdgeIterIface< EdgeIterImpl>::node() const$/;" f class:EdgeIterIface node showgraph/Graph/node_inline.h /^inline Node * PredIterImpl::node() const$/;" f class:PredIterImpl node showgraph/Graph/node_inline.h /^inline Node * SuccIterImpl::node() const$/;" f class:SuccIterImpl node showgraph/Graph/node_inline.h /^inline Node * UnDirIterImpl::node() const$/;" f class:UnDirIterImpl node showgraph/GraphView/edge_item.cpp /^GEdge::node( GraphDir dir) const $/;" f class:GEdge node showgraph/GraphView/graph_view.h /^ GNode *node;$/;" m union:NavEvent::NavEventData node showgraph/GraphView/graph_view.h /^ GNode* node;$/;" m struct:GraphView::StyleEditInfo node showgraph/GraphView/graph_view.h /^ inline GNode *node() const$/;" f class:NavEvent node showgraph/GraphView/navigation.h /^GNode* NodeNav::node() const$/;" f class:NodeNav node showgraph/GraphView/node_item.h /^ inline GNode *node() const$/;" f class:NodeItem node showgraph/Layout/aux_edge.h /^ inline AuxNode *node( GraphDir dir) const$/;" f class:AuxEdge node showgraph/Layout/aux_graph.h /^ AuxNode *node; \/\/ Node in consideration$/;" m struct:AuxGraph::SimpleDfsStepInfo node showgraph/Layout/layout.cpp /^ AuxNode *node; \/** Node in consideration *\/$/;" m struct:DfsStepInfo file: nodeCount showgraph/Graph/graph_inline.h /^inline GraphNum Graph::nodeCount() const$/;" f class:Graph nodeDown showgraph/GraphView/visible_edge.cpp /^VEdge::nodeDown() const$/;" f class:VEdge nodeInDepth showgraph/Layout/layout.cpp /^ AuxNode *nodeInDepth()$/;" f struct:DfsStepInfo nodeInFocus showgraph/GraphView/graph_view.h /^ inline GNode* nodeInFocus() const$/;" f class:GGraph nodeItemMenu showgraph/GraphView/graph_view.h /^ QMenu *nodeItemMenu;$/;" m class:GraphView nodeLeft showgraph/GraphView/visible_edge.cpp /^VEdge::nodeLeft() const$/;" f class:VEdge nodeMenu showgraph/GraphView/graph_view.h /^ inline QMenu *nodeMenu() const$/;" f class:GraphView nodeNavigationSector showgraph/GraphView/graph_view.h /^ inline NavSector nodeNavigationSector() const$/;" f class:GGraph nodePool showgraph/Graph/graph_inline.h /^inline Pool *Graph::nodePool() const$/;" f class:Graph nodeRight showgraph/GraphView/visible_edge.cpp /^VEdge::nodeRight() const$/;" f class:VEdge nodeShape2Str showgraph/GraphView/gstyle.h /^nodeShape2Str( NodeShape shape)$/;" f nodeTextIsShown showgraph/GraphView/graph_view.h /^ Marker nodeTextIsShown;$/;" m class:GGraph nodeUp showgraph/GraphView/visible_edge.cpp /^VEdge::nodeUp() const$/;" f class:VEdge node_animation_timer showgraph/GraphView/graph_view.h /^ int node_animation_timer;$/;" m class:GraphView node_in_focus showgraph/GraphView/graph_view.h /^ NodeNav node_in_focus;\/\/ Node in focus + navigation sector$/;" m class:GGraph node_list showgraph/Layout/aux_graph.h /^ QList< AuxNode*> node_list;$/;" m class:Level node_list showgraph/Layout/node_group.h /^ QList< AuxNode *> node_list;$/;" m class:NodeGroup node_next_id showgraph/Graph/graph.h /^ GraphUid node_next_id;$/;" m class:Graph node_num showgraph/Graph/graph.h /^ GraphNum node_num;$/;" m class:Graph node_p showgraph/GraphView/node_item.h /^ GNode *node_p;$/;" m class:NodeItem node_pool showgraph/Graph/graph.h /^ Pool *node_pool;$/;" m class:Graph node_priv showgraph/GraphView/navigation.h /^ GNode *node_priv;$/;" m class:NodeNav node_type showgraph/Layout/aux_node.h /^ AuxNodeType node_type;$/;" m class:AuxNode nodes showgraph/Graph/edge.h /^ Node *nodes[ GRAPH_DIRS_NUM]; \/\/Adjacent nodes$/;" m class:Edge nodes showgraph/Layout/aux_graph.h /^ inline QList< AuxNode*> nodes() const$/;" f class:Level nodes showgraph/Layout/node_group.h /^ QList nodes() const$/;" f class:NodeGroup numItems showgraph/GraphView/gstyle.h /^inline GraphNum GStyle::numItems()$/;" f class:GStyle num_items showgraph/GraphView/gstyle.h /^ GraphNum num_items;$/;" m class:GStyle number showgraph/Graph/num.h /^Numbered::number( Numeration num)$/;" f class:Numbered numbers showgraph/Graph/num.h /^ GraphNum numbers[ MAX_NUMERATIONS];$/;" m class:Numbered nums showgraph/Graph/num.h /^ NumValue nums[ MAX_NUMERATIONS];$/;" m class:NumManager nums showgraph/Graph/num.h /^ NumValue nums[ MAX_NUMERATIONS];$/;" m class:Numbered ok showgraph/GraphView/style_edit.h /^ QPushButton *ok;$/;" m class:StyleEdit old_style showgraph/GraphView/graph_view.h /^ GStyle *old_style;$/;" m struct:GraphView::StyleEditInfo opacity showgraph/GraphView/node_item.h /^ qreal opacity;$/;" m class:NodeItem opacityLevel showgraph/GraphView/node_item.h /^ inline qreal opacityLevel() const$/;" f class:NodeItem open_csdb makedb/cs2sq.cpp /^csdbparser::enResult cs2sq::open_csdb(const char* csdbfn)$/;" f class:cs2sq open_db makedb/cs2sq.cpp /^cs2sq::enResult cs2sq::open_db(const char* sqldb)$/;" f class:cs2sq open_dbfile querylib/sqlquery.cpp /^sqlquery::en_filereadstatus sqlquery::open_dbfile(tStr dbfn)$/;" f class:sqlquery open_file makedb/csdbparser.cpp /^csdbparser::enResult csdbparser::open_file(const char *fn)$/;" f class:csdbparser open_files makedb/ctagread.cpp /^ctagread::enResult ctagread::open_files(const char* sqldb, const char* tagsfn)$/;" f class:ctagread operator != querylib/small_lib.cpp /^bool smartFILE::operator !=(FILE* fptr) const {return (m_fp != fptr);}$/;" f class:smartFILE operator != querylib/small_lib.cpp /^bool smartFILE::operator !=(const smartFILE& sfp) const {return (m_fp != sfp.m_fp);}$/;" f class:smartFILE operator != showgraph/Graph/node_inline.h /^EdgeIterIface< EdgeIterImpl>::operator!=(const EdgeIterIface< EdgeIterImpl>& o) const$/;" f class:EdgeIterIface operator () querylib/small_lib.cpp /^FILE* smartFILE::operator() () {return m_fp;}$/;" f class:smartFILE operator () querylib/small_lib.cpp /^char* tempbuf::operator() () {return m_buffer;}$/;" f class:tempbuf operator * showgraph/Graph/node_inline.h /^EdgeIterIface< EdgeIterImpl>::operator*()$/;" f class:EdgeIterIface operator ++ querylib/small_lib.cpp /^idxcounter& idxcounter::operator ++() {++m_ctr;sprintf(m_buf, "%lu", m_ctr); return *this;}$/;" f class:idxcounter operator ++ showgraph/Graph/node_inline.h /^EdgeIterIface< EdgeIterImpl>::operator++( int)$/;" f class:EdgeIterIface operator ++ showgraph/Graph/node_inline.h /^EdgeIterIface< EdgeIterImpl>::operator++()$/;" f class:EdgeIterIface operator -- querylib/small_lib.cpp /^idxcounter& idxcounter::operator --() {--m_ctr;sprintf(m_buf, "%lu", m_ctr); return *this;}$/;" f class:idxcounter operator -> showgraph/Utils/mem_ref.h /^ inline RefObj* operator->()$/;" f class:Mem::Ref operator = gui/fileviewer.cpp /^filedata& filedata::operator=(const filedata& fd)$/;" f class:filedata operator = gui/searchhandler.cpp /^searchitem& searchitem::operator=(const searchitem& otheritem)$/;" f class:searchitem operator = makedb/csdbparser.cpp /^sym_data& sym_data::operator= (const sym_data& copy)$/;" f class:sym_data operator = makedb/csdbparser.cpp /^symdata_pack& symdata_pack::operator= (const symdata_pack& copy)$/;" f class:symdata_pack operator = querylib/small_lib.cpp /^idxcounter& idxcounter::operator =(const idxcounter& idxc)$/;" f class:idxcounter operator = querylib/small_lib.cpp /^idxcounter& idxcounter::operator =(long unsigned int idx) {m_ctr = idx; return *this;}$/;" f class:idxcounter operator = querylib/small_lib.cpp /^smartFILE& smartFILE::operator =(FILE *fptr) {setme(fptr); return *this;}$/;" f class:smartFILE operator = querylib/small_lib.cpp /^smartFILE& smartFILE::operator =(const smartFILE& sfp)$/;" f class:smartFILE operator = querylib/sqlquery.cpp /^sqlqueryresultlist& sqlqueryresultlist::operator= (const sqlqueryresultlist& copy)$/;" f class:sqlqueryresultlist operator = showgraph/GraphView/gstyle.h /^GStyle::operator = ( const GStyle& st)$/;" f class:GStyle operator = showgraph/Utils/mem_mgr.h /^ MemInfo& operator =( const MemInfo&){};$/;" f class:MemImpl::MemInfo operator = showgraph/Utils/mem_pool.h /^ PoolObj& operator = ( const PoolObj& obj){ return *this;};$/;" f class:Mem::PoolObj operator = showgraph/Utils/mem_ref.h /^ Ref< RefObj> & operator=( RefObj* p)$/;" f class:Mem::Ref operator = showgraph/Utils/mem_ref.h /^ Ref< RefObj> & operator=( const Ref< RefObj>& orig)$/;" f class:Mem::Ref operator = showgraph/Utils/utils_utest.cpp /^ classA& operator =( const classA&){};$/;" f class:classA file: operator == querylib/small_lib.cpp /^bool smartFILE::operator ==(FILE* fptr) const {return (m_fp == fptr);}$/;" f class:smartFILE operator == querylib/small_lib.cpp /^bool smartFILE::operator ==(const smartFILE& sfp) const {return (m_fp == sfp.m_fp);}$/;" f class:smartFILE operator == showgraph/Graph/node_inline.h /^EdgeIterIface< EdgeIterImpl>::operator==(const EdgeIterIface< EdgeIterImpl>& o) const$/;" f class:EdgeIterIface operator == showgraph/Graph/node_iter.h /^ inline bool operator==(const PredIterImpl& o) const \/**< Comparison operator *\/$/;" f class:PredIterImpl operator == showgraph/Graph/node_iter.h /^ inline bool operator==(const SuccIterImpl& o) const \/**< Comparison operator *\/$/;" f class:SuccIterImpl operator == showgraph/Graph/node_iter.h /^ inline bool operator==(const UnDirIterImpl& o) const \/**< Comparison operator *\/$/;" f class:UnDirIterImpl operator == showgraph/Utils/mem_ref.h /^ inline bool operator == ( Ref< RefObj> &r)$/;" f class:Mem::Ref operator RefObj* showgraph/Utils/mem_ref.h /^ inline operator RefObj*()$/;" f class:Mem::Ref operator [] querylib/small_lib.cpp /^char tempbuf::operator[] (unsigned int i)$/;" f class:tempbuf operator bool showgraph/Utils/mem_ref.h /^ inline operator bool()$/;" f class:Mem::Ref operator delete showgraph/Utils/mem_chunk.h /^ Chunk< Data>::operator delete( void* mem)$/;" f class:MemImpl::Chunk operator delete showgraph/Utils/mem_chunk.h /^ Chunk< Data>::operator delete( void* ptr, void* mem)$/;" f class:MemImpl::Chunk operator delete showgraph/Utils/mem_pool.cpp /^PoolObj::operator delete( void *ptr)$/;" f class:PoolObj operator delete showgraph/Utils/mem_pool.h /^ PoolObj::operator delete( void *ptr, Pool* pool)$/;" f class:Mem::PoolObj operator delete[] showgraph/Utils/mem_pool.cpp /^PoolObj::operator delete[]( void *ptr)$/;" f class:PoolObj operator new showgraph/Utils/mem_chunk.h /^ Chunk< Data>::operator new ( size_t size, void* mem)$/;" f class:MemImpl::Chunk operator new showgraph/Utils/mem_pool.cpp /^PoolObj::operator new( size_t size)$/;" f class:PoolObj operator new showgraph/Utils/mem_pool.h /^ PoolObj::operator new ( size_t size, Pool* pool)$/;" f class:Mem::PoolObj operator new[] showgraph/Utils/mem_pool.cpp /^PoolObj::operator new[]( size_t size)$/;" f class:PoolObj option makedb/optlist.h /^ char option;$/;" m struct:option_t option showgraph/Utils/conf.h /^ inline Option* option( QString name)$/;" f class:Conf option_t makedb/optlist.h /^typedef struct option_t$/;" s option_t makedb/optlist.h /^} option_t;$/;" t typeref:struct:option_t order showgraph/Layout/aux_graph.h /^ Numeration order;$/;" m class:AuxGraph order showgraph/Layout/aux_node.h /^ inline int order() const$/;" f class:AuxNode orderNodesByDFS showgraph/Layout/layout.cpp /^void AuxGraph::orderNodesByDFS()$/;" f class:AuxGraph otherEnd showgraph/GraphView/navigation.cpp /^NodeNav::otherEnd( GEdge *edge) const$/;" f class:NodeNav out showgraph/Utils/print.h /^ inline void out( const char* format, ...)$/;" f namespace:PrintUtils paint showgraph/GraphView/edge_helper.cpp /^EdgeHelper::paint( QPainter *painter,$/;" f class:EdgeHelper paint showgraph/GraphView/edge_item.cpp /^EdgeItem::paint( QPainter *painter,$/;" f class:EdgeItem paint showgraph/GraphView/node_item.cpp /^NodeItem::paint( QPainter *painter,$/;" f class:NodeItem paintEvent gui/obsolete/CodeEditor.h /^ void paintEvent(QPaintEvent *event) {$/;" f class:LineNumberArea paintEvent showgraph/GraphView/style_edit.cpp /^void ColorButton::paintEvent( QPaintEvent *event)$/;" f class:ColorButton parse makedb/csdbheader.cpp /^bool csdbheader::parse(void)$/;" f class:csdbheader parse_headers makedb/csdbparser.cpp /^csdbparser::enResult csdbparser::parse_headers(void)$/;" f class:csdbparser pattern gui/obsolete/highlighter.h /^ QRegExp pattern;$/;" m struct:Highlighter::HighlightingRule peer showgraph/Utils/list.h /^ ListItem * peer[ LIST_DIR_NUM];$/;" m class:ListItem peer showgraph/Utils/list.h /^ MListItem< 1> * peer[ LIST_DIR_NUM];$/;" m class:MListItem peer showgraph/Utils/list.h /^ MListItem< dim> * peer[ dim][ LIST_DIR_NUM];$/;" m class:MListItem peerInDir showgraph/Utils/list.h /^ inline MListItem< 1> * peerInDir( ListDir dir) const$/;" f class:MListItem peerInDir showgraph/Utils/list.h /^ inline MListItem< dim> * peerInDir( ListId list, ListDir dir) const$/;" f class:MListItem pen showgraph/GraphView/gstyle.h /^inline QPen GStyle::pen() const$/;" f class:GStyle pen_priv showgraph/GraphView/gstyle.h /^ QPen pen_priv;$/;" m class:GStyle perform_grep gui/searchhandler.cpp /^sqlqueryresultlist searchhandler::perform_grep(QString searchtxt, sqlqueryresultlist searchlist, bool exactmatch)$/;" f class:searchhandler perform_open_db gui/searchhandler.cpp /^void searchhandler::perform_open_db(void)$/;" f class:searchhandler perform_search gui/searchhandler.cpp /^void searchhandler::perform_search(QString searchtxt,$/;" f class:searchhandler placeNodes showgraph/Layout/node_group.cpp /^void NodeGroup::placeNodes()$/;" f class:NodeGroup placeNodesFinal showgraph/Layout/node_group.cpp /^void NodeGroup::placeNodesFinal( GraphDir dir)$/;" f class:NodeGroup pool showgraph/Utils/mem_chunk.h /^ void *pool; $/;" m class:MemImpl::Chunk pool showgraph/Utils/mem_obj.h /^ inline Pool* pool() const$/;" f class:Mem::Obj populateList gui/listhandler.cpp /^void listhandler::populateList(sqlqueryresultlist resultlist, int selectitem)$/;" f class:listhandler pos showgraph/Utils/mem_entry.h /^ Entry< Data>::pos() const$/;" f class:MemImpl::Entry pred showgraph/Graph/agraph.h /^ inline ANode *pred() const $/;" f class:AEdge pred showgraph/Graph/edge_inline.h /^inline Node *Edge::pred() const$/;" f class:Edge pred showgraph/GraphView/edge_item.h /^ inline GNode *pred() const $/;" f class:GEdge pred showgraph/GraphView/edge_item.h /^ inline GNode* pred() const$/;" f class:EdgeItem pred showgraph/GraphView/visible_edge.h /^GNode* VEdge::pred() const$/;" f class:VEdge pred showgraph/Layout/aux_edge.h /^ inline AuxNode *pred() const $/;" f class:AuxEdge pred_priv showgraph/GraphView/visible_edge.h /^ GNode *pred_priv;$/;" m class:VEdge predsBegin showgraph/Graph/node_inline.h /^inline Node::Pred Node::predsBegin()$/;" f class:Node predsEnd showgraph/Graph/node_inline.h /^inline Node::Pred Node::predsEnd()$/;" f class:Node preferred_zoom showgraph/GraphView/graph_view.h /^ qreal preferred_zoom;$/;" m class:GraphView prepareToExit gui/listhandler.cpp /^void listhandler::prepareToExit(void)$/;" f class:listhandler prepareToExit gui/mainwindow.cpp /^void mainwindow::prepareToExit()$/;" f class:mainwindow prepare_cqdb makedb/ctagread.cpp /^ctagread::enResult ctagread::prepare_cqdb(void)$/;" f class:ctagread prepare_stmt makedb/sqlbase.cpp /^int sqlbase::prepare_stmt(sqlite3_stmt** pStmt, const char* sqlquery)$/;" f class:sqlbase prev showgraph/GraphView/graph_view.cpp /^NavEvent *GraphViewHistory::prev()$/;" f class:GraphViewHistory prev showgraph/Utils/list.h /^ inline Item* prev( ListId list) const$/;" f class:MListIface prev showgraph/Utils/list.h /^ inline Item* prev() const$/;" f class:MListIface prev showgraph/Utils/list.h /^ inline Item* prev() const$/;" f class:SListIface prev showgraph/Utils/list.h /^ inline ListItem* prev() const$/;" f class:ListItem prev showgraph/Utils/list.h /^ inline MListItem< 1>* prev() const$/;" f class:MListItem prev showgraph/Utils/list.h /^ inline MListItem< dim>* prev( ListId list) const$/;" f class:MListItem prevNode showgraph/Graph/agraph.h /^ inline ANode* prevNode()$/;" f class:ANode prevNode showgraph/Graph/node_inline.h /^inline Node* Node::prevNode()$/;" f class:Node prevNode showgraph/GraphView/node_item.h /^ inline GNode* prevNode()$/;" f class:GNode prevNode showgraph/Layout/aux_node.h /^ inline AuxNode* prevNode()$/;" f class:AuxNode print showgraph/Utils/conf.cpp /^Option::print( QTextStream &stream)$/;" f class:Option printDefaults showgraph/Utils/conf.cpp /^void Conf::printDefaults()$/;" f class:Conf printOpts showgraph/Utils/conf.cpp /^void Conf::printOpts()$/;" f class:Conf print_contents makedb/csdbheader.cpp /^void csdbheader::print_contents(void)$/;" f class:csdbheader printhelp cli/main_cli.cpp /^void printhelp(const char* str)$/;" f printhelp makedb/main.cpp /^void printhelp(const char* str)$/;" f printlicense cli/main_cli.cpp /^void printlicense(void)$/;" f printlicense makedb/main.cpp /^void printlicense(void)$/;" f priority showgraph/Layout/aux_node.h /^ inline int priority() const$/;" f class:AuxNode priv_field showgraph/Utils/mem_utest.cpp /^ quint32 priv_field;$/;" m class:MyPoolObj file: priv_fixed showgraph/Layout/aux_edge.h /^ bool priv_fixed;$/;" m class:AuxEdge priv_height showgraph/Layout/aux_node.h /^ double priv_height;$/;" m class:AuxNode priv_level showgraph/Layout/aux_node.h /^ Level * priv_level;$/;" m class:AuxNode priv_order showgraph/Layout/aux_node.h /^ int priv_order;$/;" m class:AuxNode priv_priority showgraph/Layout/aux_node.h /^ int priv_priority;$/;" m class:AuxNode priv_rank showgraph/Layout/aux_node.h /^ Rank priv_rank;$/;" m class:AuxNode priv_type showgraph/Layout/aux_edge.h /^ AuxEdgeType priv_type;$/;" m class:AuxEdge priv_width showgraph/Layout/aux_node.h /^ double priv_width;$/;" m class:AuxNode priv_x showgraph/Layout/aux_node.h /^ double priv_x;$/;" m class:AuxNode priv_y showgraph/Layout/aux_node.h /^ double priv_y;$/;" m class:AuxNode process_argwithopt cli/main_cli.cpp /^void process_argwithopt(option_t* thisOpt, bool& err, tStr& fnstr, bool filemustexist)$/;" f process_argwithopt makedb/main.cpp /^void process_argwithopt(option_t* thisOpt, bool& err, std::string& fnstr, bool filemustexist)$/;" f process_cscope makedb/main.cpp /^int process_cscope(const char* cscopefn, const char* sqfn, bool debug)$/;" f process_ctags makedb/ctagread.cpp /^ctagread::enResult ctagread::process_ctags(void)$/;" f class:ctagread process_ctags makedb/main.cpp /^int process_ctags(const char* ctagsfn, const char* sqfn, bool debug)$/;" f process_query cli/main_cli.cpp /^int process_query(tStr sqfn, tStr term, tStr param, bool exact, bool debug)$/;" f process_searchterm querylib/sqlquery.cpp /^tStr sqlquery::process_searchterm(const char* searchterm, const bool& exactmatch)$/;" f class:sqlquery process_searchterm_autocomplete querylib/sqlquery.cpp /^tStr sqlquery::process_searchterm_autocomplete(const char* searchterm)$/;" f class:sqlquery processfile gui/themes/parse_themes.pl /^sub processfile$/;" s ptr showgraph/Utils/mem_ref.h /^ RefObj *ptr;$/;" m class:Mem::Ref pyAdditionalRules gui/obsolete/highlighter.cpp /^ void Highlighter::pyAdditionalRules(const QString &text)$/;" f class:Highlighter pyHighlightingRules gui/obsolete/highlighter.h /^ QVector pyHighlightingRules;$/;" m class:Highlighter python_Bespin gui/themes_gen.cpp /^static const lexstyle python_Bespin[] = {$/;" v file: python_Black_board gui/themes_gen.cpp /^static const lexstyle python_Black_board[] = {$/;" v file: python_Choco gui/themes_gen.cpp /^static const lexstyle python_Choco[] = {$/;" v file: python_Deep_Black gui/themes_gen.cpp /^static const lexstyle python_Deep_Black[] = {$/;" v file: python_Eclipse_Default gui/themes_gen.cpp /^static const lexstyle python_Eclipse_Default[] = {$/;" v file: python_Hello_Kitty gui/themes_gen.cpp /^static const lexstyle python_Hello_Kitty[] = {$/;" v file: python_HotFudgeSundae gui/themes_gen.cpp /^static const lexstyle python_HotFudgeSundae[] = {$/;" v file: python_Mono_Industrial gui/themes_gen.cpp /^static const lexstyle python_Mono_Industrial[] = {$/;" v file: python_Monokai gui/themes_gen.cpp /^static const lexstyle python_Monokai[] = {$/;" v file: python_MossyLawn gui/themes_gen.cpp /^static const lexstyle python_MossyLawn[] = {$/;" v file: python_Navajo gui/themes_gen.cpp /^static const lexstyle python_Navajo[] = {$/;" v file: python_NotepadPlusPlus gui/themes_gen.cpp /^static const lexstyle python_NotepadPlusPlus[] = {$/;" v file: python_Obsidian gui/themes_gen.cpp /^static const lexstyle python_Obsidian[] = {$/;" v file: python_Plastic_Code_Wrap gui/themes_gen.cpp /^static const lexstyle python_Plastic_Code_Wrap[] = {$/;" v file: python_Ruby_Blue gui/themes_gen.cpp /^static const lexstyle python_Ruby_Blue[] = {$/;" v file: python_Solarized gui/themes_gen.cpp /^static const lexstyle python_Solarized[] = {$/;" v file: python_Solarized_light gui/themes_gen.cpp /^static const lexstyle python_Solarized_light[] = {$/;" v file: python_Twilight gui/themes_gen.cpp /^static const lexstyle python_Twilight[] = {$/;" v file: python_Vibrant_Ink gui/themes_gen.cpp /^static const lexstyle python_Vibrant_Ink[] = {$/;" v file: python_Zenburn gui/themes_gen.cpp /^static const lexstyle python_Zenburn[] = {$/;" v file: python_khaki gui/themes_gen.cpp /^static const lexstyle python_khaki[] = {$/;" v file: python_vim_Dark_Blue gui/themes_gen.cpp /^static const lexstyle python_vim_Dark_Blue[] = {$/;" v file: pythonstyle gui/themes_gen.cpp /^static const langstyle pythonstyle[] = {$/;" v file: qry querylib/sqlquery.h /^tStr qry;$/;" m class:tempstmt qt2str gui/std2qt.h /^inline tStr qt2str(const QString& inp)$/;" f qt2strLst gui/std2qt.cpp /^tVecStr qt2strLst(const QStringList& inpLst)$/;" f qtype gui/searchhandler.h /^ sqlquery::en_queryType qtype;$/;" m class:searchitem quotationFormat gui/obsolete/highlighter.h /^ QTextCharFormat quotationFormat;$/;" m class:Highlighter rank showgraph/Layout/aux_graph.h /^ inline Rank rank() const$/;" f class:Level rank showgraph/Layout/aux_node.h /^ inline int rank() const$/;" f class:AuxNode rankNodes showgraph/Layout/layout.cpp /^Numeration AuxGraph::rankNodes()$/;" f class:AuxGraph ranking showgraph/Layout/aux_graph.h /^ Numeration ranking;$/;" m class:AuxGraph rankingValid showgraph/Layout/aux_graph.h /^ inline bool rankingValid() const$/;" f class:AuxGraph ranking_valid showgraph/Layout/aux_graph.h /^ bool ranking_valid;$/;" m class:AuxGraph ranks showgraph/Layout/aux_graph.h /^ inline Numeration ranks() const$/;" f class:AuxGraph rboxPath showgraph/GraphView/node_item.cpp /^inline QPainterPath rboxPath( QRectF rect)$/;" f rboxRect showgraph/GraphView/node_item.cpp /^inline QRectF rboxRect( QRectF rect)$/;" f readArgs showgraph/Utils/conf.cpp /^void Conf::readArgs( int argc, char** argv)$/;" f class:Conf readFromElement showgraph/Graph/edge.cpp /^Edge::readFromElement( QDomElement e)$/;" f class:Edge readFromElement showgraph/Graph/node_inline.h /^Node::readFromElement( QDomElement e)$/;" f class:Node readFromElement showgraph/GraphView/edge_item.cpp /^GEdge::readFromElement( QDomElement e)$/;" f class:GEdge readFromElement showgraph/GraphView/node_item.cpp /^GNode::readFromElement( QDomElement e)$/;" f class:GNode readFromXML showgraph/Graph/graph.cpp /^Graph::readFromXML( QString txt) \/\/ changed to read from QString rather than from file$/;" f class:Graph readFromXML showgraph/GraphView/graph_view.cpp /^GGraph::readFromXML( QString txt)$/;" f class:GGraph readSettings gui/mainwindow.cpp /^void mainwindow::readSettings()$/;" f class:mainwindow read_configtbl querylib/sqlquery.cpp /^tStr sqlquery::read_configtbl(const char *key, sqlite3_stmt *stmt)$/;" f class:sqlquery realNode showgraph/GraphView/edge_item.cpp /^GEdge::realNode( GraphDir dir) const $/;" f class:GEdge realNode showgraph/Layout/aux_edge.h /^ inline AuxNode* realNode( GraphDir dir) const$/;" f class:AuxEdge realPred showgraph/GraphView/edge_item.h /^ inline GNode* realPred() const$/;" f class:GEdge realPred showgraph/Layout/aux_edge.h /^ inline AuxNode* realPred() const$/;" f class:AuxEdge realSucc showgraph/GraphView/edge_item.h /^ inline GNode* realSucc() const$/;" f class:GEdge realSucc showgraph/Layout/aux_edge.h /^ inline AuxNode* realSucc() const$/;" f class:AuxEdge recvDBtimestamp gui/fileviewer.cpp /^void fileviewer::recvDBtimestamp(QDateTime dt)$/;" f class:fileviewer reduceCrossings showgraph/Layout/layout.cpp /^void AuxGraph::reduceCrossings()$/;" f class:AuxGraph refCount showgraph/Utils/mem_obj.h /^ inline RefNumber refCount() const$/;" f class:Mem::Obj ref_count showgraph/Utils/mem_obj.h /^ RefNumber ref_count; \/* Additional memory used, the overhead of counted references *\/$/;" m class:Mem::Obj reinit querylib/small_lib.cpp /^char* tempbuf::reinit(unsigned int n)$/;" f class:tempbuf remove showgraph/GraphView/edge_item.h /^ inline void remove()$/;" f class:EdgeItem remove showgraph/GraphView/node_item.h /^ inline void remove()$/;" f class:NodeItem remove_symname gui/sqlqueryadv.cpp /^void sqlqueryadv::remove_symname(sqlqueryresultlist& res, tStr name)$/;" f class:sqlqueryadv replaceLexer gui/fileviewer.cpp /^void fileviewer::replaceLexer(const char* langstr, int lang)$/;" f class:fileviewer replacechar querylib/small_lib.cpp /^int replacechar(std::string::iterator i1, std::string::iterator i2, const char o, const char r)$/;" f replayNavigationEvent showgraph/GraphView/graph_view.cpp /^void GraphView::replayNavigationEvent( NavEvent *ev)$/;" f class:GraphView requestToProvideResultCurrentListItemSymbolName gui/listhandler.cpp /^void listhandler::requestToProvideResultCurrentListItemSymbolName()$/;" f class:listhandler resCSDBPError makedb/cs2sq.h /^ resCSDBPError,$/;" e enum:cs2sq::enResult resCSDBPFileNotOpen makedb/cs2sq.h /^ resCSDBPFileNotOpen,$/;" e enum:cs2sq::enResult resFILE_ACCESS_ERR makedb/cs2sq.h /^ resFILE_ACCESS_ERR,$/;" e enum:cs2sq::enResult resFILE_ACCESS_ERR makedb/csdbparser.h /^ resFILE_ACCESS_ERR,$/;" e enum:csdbparser::enResult resFILE_ACCESS_ERR makedb/ctagread.h /^ resFILE_ACCESS_ERR,$/;" e enum:ctagread::enResult resFILE_NOT_FOUND makedb/csdbparser.h /^ resFILE_NOT_FOUND,$/;" e enum:csdbparser::enResult resFILE_NOT_FOUND makedb/ctagread.h /^ resFILE_NOT_FOUND,$/;" e enum:ctagread::enResult resFILE_NOT_OPEN makedb/csdbparser.h /^ resFILE_NOT_OPEN$/;" e enum:csdbparser::enResult resFILE_NOT_OPEN makedb/ctagread.h /^ resFILE_NOT_OPEN$/;" e enum:ctagread::enResult resFilenameError makedb/cs2sq.h /^ resFilenameError,$/;" e enum:cs2sq::enResult resINCORRECT_VER makedb/csdbparser.h /^ resINCORRECT_VER,$/;" e enum:csdbparser::enResult resINCORRECT_VER makedb/ctagread.h /^ resINCORRECT_VER,$/;" e enum:ctagread::enResult resOK makedb/cs2sq.h /^ resOK = 0,$/;" e enum:cs2sq::enResult resOK makedb/csdbparser.h /^ resOK = 0,$/;" e enum:csdbparser::enResult resOK makedb/ctagread.h /^ resOK = 0,$/;" e enum:ctagread::enResult resOTHER_ERR makedb/cs2sq.h /^ resOTHER_ERR$/;" e enum:cs2sq::enResult resOTHER_ERR makedb/csdbparser.h /^ resOTHER_ERR,$/;" e enum:csdbparser::enResult resOTHER_ERR makedb/ctagread.h /^ resOTHER_ERR,$/;" e enum:ctagread::enResult resSQLError makedb/cs2sq.h /^ resSQLError,$/;" e enum:cs2sq::enResult resSQLError makedb/ctagread.h /^ resSQLError,$/;" e enum:ctagread::enResult resUNKNOWN_ERR makedb/csdbparser.h /^ resUNKNOWN_ERR,$/;" e enum:csdbparser::enResult resUNKNOWN_ERR makedb/ctagread.h /^ resUNKNOWN_ERR,$/;" e enum:ctagread::enResult resUNRECOG_FORMAT makedb/csdbparser.h /^ resUNRECOG_FORMAT,$/;" e enum:csdbparser::enResult resUNRECOG_FORMAT makedb/ctagread.h /^ resUNRECOG_FORMAT,$/;" e enum:ctagread::enResult resUNSUPPORTED_PARAM makedb/csdbparser.h /^ resUNSUPPORTED_PARAM,$/;" e enum:csdbparser::enResult resUNSUPPORTED_PARAM makedb/ctagread.h /^ resUNSUPPORTED_PARAM,$/;" e enum:ctagread::enResult reset querylib/small_lib.cpp /^void idxcounter::reset(void) {m_ctr = 0;}$/;" f class:idxcounter reset showgraph/GraphView/edge_helper.h /^EdgeHelper::reset()$/;" f class:EdgeHelper resizeColumns gui/listhandler.cpp /^void listhandler::resizeColumns(void)$/;" f class:listhandler resizeEvent gui/obsolete/CodeEditor.cpp /^ void CodeEditor::resizeEvent(QResizeEvent *e)$/;" f class:CodeEditor restoreSearchMemoryItem gui/searchhandler.cpp /^void searchhandler::restoreSearchMemoryItem(void)$/;" f class:searchhandler resultCurrentListItemSymbolName gui/searchhandler.cpp /^void searchhandler::resultCurrentListItemSymbolName(const QString symName)$/;" f class:searchhandler result_type querylib/sqlquery.h /^ en_resultType result_type;$/;" m class:sqlqueryresultlist resultlist querylib/sqlquery.h /^ std::vector resultlist;$/;" m class:sqlqueryresultlist retranslateUi gui/listhandler.cpp /^void listhandler::retranslateUi(void)$/;" f class:listhandler retranslateUi gui/mainwindow.cpp /^void mainwindow::retranslateUi(void)$/;" f class:mainwindow retranslateUi gui/searchhandler.cpp /^void searchhandler::retranslateUi(void)$/;" f class:searchhandler right showgraph/Layout/node_group.h /^ inline qreal right() const$/;" f class:NodeGroup rootNode showgraph/Layout/aux_graph.cpp /^AuxGraph::rootNode()$/;" f class:AuxGraph rownum gui/searchhandler.h /^ int rownum;$/;" m class:searchitem ruby_Bespin gui/themes_gen.cpp /^static const lexstyle ruby_Bespin[] = {$/;" v file: ruby_Black_board gui/themes_gen.cpp /^static const lexstyle ruby_Black_board[] = {$/;" v file: ruby_Choco gui/themes_gen.cpp /^static const lexstyle ruby_Choco[] = {$/;" v file: ruby_Deep_Black gui/themes_gen.cpp /^static const lexstyle ruby_Deep_Black[] = {$/;" v file: ruby_Eclipse_Default gui/themes_gen.cpp /^static const lexstyle ruby_Eclipse_Default[] = {$/;" v file: ruby_Hello_Kitty gui/themes_gen.cpp /^static const lexstyle ruby_Hello_Kitty[] = {$/;" v file: ruby_HotFudgeSundae gui/themes_gen.cpp /^static const lexstyle ruby_HotFudgeSundae[] = {$/;" v file: ruby_Mono_Industrial gui/themes_gen.cpp /^static const lexstyle ruby_Mono_Industrial[] = {$/;" v file: ruby_Monokai gui/themes_gen.cpp /^static const lexstyle ruby_Monokai[] = {$/;" v file: ruby_MossyLawn gui/themes_gen.cpp /^static const lexstyle ruby_MossyLawn[] = {$/;" v file: ruby_Navajo gui/themes_gen.cpp /^static const lexstyle ruby_Navajo[] = {$/;" v file: ruby_NotepadPlusPlus gui/themes_gen.cpp /^static const lexstyle ruby_NotepadPlusPlus[] = {$/;" v file: ruby_Obsidian gui/themes_gen.cpp /^static const lexstyle ruby_Obsidian[] = {$/;" v file: ruby_Plastic_Code_Wrap gui/themes_gen.cpp /^static const lexstyle ruby_Plastic_Code_Wrap[] = {$/;" v file: ruby_Ruby_Blue gui/themes_gen.cpp /^static const lexstyle ruby_Ruby_Blue[] = {$/;" v file: ruby_Solarized gui/themes_gen.cpp /^static const lexstyle ruby_Solarized[] = {$/;" v file: ruby_Solarized_light gui/themes_gen.cpp /^static const lexstyle ruby_Solarized_light[] = {$/;" v file: ruby_Twilight gui/themes_gen.cpp /^static const lexstyle ruby_Twilight[] = {$/;" v file: ruby_Vibrant_Ink gui/themes_gen.cpp /^static const lexstyle ruby_Vibrant_Ink[] = {$/;" v file: ruby_Zenburn gui/themes_gen.cpp /^static const lexstyle ruby_Zenburn[] = {$/;" v file: ruby_khaki gui/themes_gen.cpp /^static const lexstyle ruby_khaki[] = {$/;" v file: ruby_vim_Dark_Blue gui/themes_gen.cpp /^static const lexstyle ruby_vim_Dark_Blue[] = {$/;" v file: rubystyle gui/themes_gen.cpp /^static const langstyle rubystyle[] = {$/;" v file: runLayout showgraph/GraphView/graph_view.cpp /^void GraphView::runLayout()$/;" f class:GraphView runLayoutAct showgraph/GraphView/graph_view.h /^ QAction *runLayoutAct;$/;" m class:GraphView savetodotfile gui/graphdialog.cpp /^void cqDialogGraph::savetodotfile()$/;" f class:cqDialogGraph savetoimagefile gui/graphdialog.cpp /^void cqDialogGraph::savetoimagefile()$/;" f class:cqDialogGraph scaleImage gui/graphdialog.cpp /^void cqDialogGraph::scaleImage(double factor)$/;" f class:cqDialogGraph scaleVal showgraph/GraphView/graph_view.cpp /^inline qreal scaleVal( qreal zoom_scale)$/;" f search querylib/sqlquery.cpp /^sqlqueryresultlist sqlquery::search($/;" f class:sqlquery searchNode showgraph/GraphView/graph_view.h /^ inline GNode * searchNode() const$/;" f class:GraphView searchTextEdited gui/searchhandler.cpp /^void searchhandler::searchTextEdited(const QString& searchtxt)$/;" f class:searchhandler search_autocomplete querylib/sqlquery.cpp /^tVecStr sqlquery::search_autocomplete(const char* searchstr)$/;" f class:sqlquery search_autocomplete_qt gui/searchhandler.cpp /^QStringList searchhandler::search_autocomplete_qt(QString searchtxt)$/;" f class:searchhandler search_classinheritgraph gui/sqlqueryadv.cpp /^bool sqlqueryadv::search_classinheritgraph(QString searchstr, bool exactmatch, QString& xmlout, QString& dotout)$/;" f class:sqlqueryadv search_file_line querylib/sqlquery.cpp /^sqlqueryresultlist sqlquery::search_file_line(sqlite3_stmt* stmt)$/;" f class:sqlquery search_file_only querylib/sqlquery.cpp /^sqlqueryresultlist sqlquery::search_file_only(sqlite3_stmt* stmt)$/;" f class:sqlquery search_full querylib/sqlquery.cpp /^sqlqueryresultlist sqlquery::search_full(sqlite3_stmt* stmt)$/;" f class:sqlquery search_funcgraph gui/sqlqueryadv.cpp /^bool sqlqueryadv::search_funcgraph(QString searchstr, bool exactmatch, QString& xmlout, QString& dotout)$/;" f class:sqlqueryadv search_node showgraph/GraphView/graph_view.h /^ GNode *search_node;$/;" m class:GraphView searchhandler gui/searchhandler.cpp /^searchhandler::searchhandler(mainwindow* pmw)$/;" f class:searchhandler searchhandler gui/searchhandler.h /^class searchhandler : public QObject$/;" c searchitem gui/searchhandler.cpp /^searchitem::searchitem()$/;" f class:searchitem searchitem gui/searchhandler.cpp /^searchitem::searchitem(const searchitem& otheritem)$/;" f class:searchitem searchitem gui/searchhandler.h /^class searchitem$/;" c searchterm gui/searchhandler.h /^ QString searchterm;$/;" m class:searchitem sector showgraph/GraphView/navigation.h /^NavSector NodeNav::sector() const$/;" f class:NodeNav sectorMaxAngle showgraph/GraphView/navigation.cpp /^qreal NodeNav::sectorMaxAngle() const$/;" f class:NodeNav sectorMinAngle showgraph/GraphView/navigation.cpp /^qreal NodeNav::sectorMinAngle() const$/;" f class:NodeNav sector_priv showgraph/GraphView/navigation.h /^ NavSector sector_priv;$/;" m class:NodeNav sel_edges showgraph/GraphView/graph_view.h /^ QList< GEdge* > sel_edges;$/;" m class:GGraph sel_nodes showgraph/GraphView/graph_view.h /^ QList< GNode* > sel_nodes;$/;" m class:GGraph selectEdge showgraph/GraphView/graph_view.h /^ inline void selectEdge( GEdge *e)$/;" f class:GGraph selectFillColor showgraph/GraphView/style_edit.cpp /^void StyleEdit::selectFillColor()$/;" f class:StyleEdit selectLineColor showgraph/GraphView/style_edit.cpp /^void StyleEdit::selectLineColor()$/;" f class:StyleEdit selectNode showgraph/GraphView/graph_view.h /^ inline void selectNode( GNode *n)$/;" f class:GGraph selectOneNode showgraph/GraphView/graph_view.cpp /^void GGraph::selectOneNode( GNode* n)$/;" f class:GGraph selfEdgePath showgraph/GraphView/edge_helper.cpp /^QPainterPath EdgeHelper::selfEdgePath() const$/;" f class:EdgeHelper selfEdgePath showgraph/GraphView/edge_item.cpp /^QPainterPath EdgeItem::selfEdgePath() const$/;" f class:EdgeItem setBack showgraph/Layout/aux_edge.h /^ inline void setBack()$/;" f class:AuxEdge setBc showgraph/Layout/aux_node.h /^ inline void setBc( qreal center)$/;" f class:AuxNode setBoolVal showgraph/Utils/conf.h /^ inline void setBoolVal( bool val)$/;" f class:Option setBrush showgraph/GraphView/gstyle.h /^inline void GStyle::setBrush( QBrush &br)$/;" f class:GStyle setBrushColor showgraph/GraphView/gstyle.h /^inline void GStyle::setBrushColor( QColor &color)$/;" f class:GStyle setColor showgraph/GraphView/style_edit.h /^ void setColor( QColor &cl) $/;" f class:ColorButton setCounterVal querylib/small_lib.cpp /^void idxcounter::setCounterVal(long unsigned int i) {m_ctr = i;}$/;" f class:idxcounter setCurrPos showgraph/GraphView/graph_view.h /^ inline void setCurrPos( QPointF p)$/;" f class:GraphView setCurrentFontType gui/fileviewsettingsdialog.cpp /^void cqDialogFileViewSettings::setCurrentFontType(const QString& fonttype)$/;" f class:cqDialogFileViewSettings setCurrentTheme gui/fileviewsettingsdialog.cpp /^void cqDialogFileViewSettings::setCurrentTheme(const QString& theme)$/;" f class:cqDialogFileViewSettings setData showgraph/Utils/list.h /^ inline void setData( Data* d)$/;" f class:ListItem setDebug makedb/csdbparser.cpp /^void csdbparser::setDebug(bool val)$/;" f class:csdbparser setDebug makedb/sqlbase.cpp /^void sqlbase::setDebug(bool val)$/;" f class:sqlbase setDefined showgraph/Utils/conf.h /^ inline void setDefined( bool def = true)$/;" f class:Option setDoc showgraph/GraphView/node_item.h /^ inline void setDoc( QTextDocument* doc)$/;" f class:GNode setDst showgraph/GraphView/edge_helper.h /^EdgeHelper::setDst( NodeItem *item)$/;" f class:EdgeHelper setDstP showgraph/GraphView/edge_helper.h /^EdgeHelper::setDstP( QPointF p)$/;" f class:EdgeHelper setEdge showgraph/Graph/node_iter.h /^ inline void setEdge( Edge *e){ edge_p = e;}$/;" f class:IterImplBase setEdgeStyle showgraph/GraphView/graph_view.cpp /^void GGraph::setEdgeStyle( GStyle *style)$/;" f class:GGraph setEdgeStyle showgraph/GraphView/graph_view.cpp /^void GraphView::setEdgeStyle( GStyle *style)$/;" f class:GraphView setEditable showgraph/GraphView/graph_view.h /^ inline void setEditable( bool val = true)$/;" f class:GraphView setElement showgraph/Graph/edge_inline.h /^inline void Edge::setElement( QDomElement elem)$/;" f class:Edge setElement showgraph/Graph/node_inline.h /^inline void Node::setElement( QDomElement elem)$/;" f class:Node setFixed showgraph/Layout/aux_edge.h /^ inline void setFixed( bool fx)$/;" f class:AuxEdge setFloatVal showgraph/Utils/conf.h /^ inline void setFloatVal( qreal val)$/;" f class:Option setForPlacement showgraph/Layout/aux_node.h /^ inline void setForPlacement( bool placed = true)$/;" f class:AuxNode setForward showgraph/Layout/aux_edge.h /^ inline void setForward()$/;" f class:AuxEdge setGStyle showgraph/GraphView/style_edit.cpp /^void StyleEdit::setGStyle( GStyle *st)$/;" f class:StyleEdit setGraph showgraph/GraphView/graph_view.h /^ inline void setGraph( GGraph *g)$/;" f class:GraphView setHeight showgraph/Layout/aux_graph.h /^ inline void setHeight( qreal h)$/;" f class:Level setHeight showgraph/Layout/aux_node.h /^ inline void setHeight( double h) $/;" f class:AuxNode setIRId showgraph/GraphView/node_item.h /^ inline void setIRId( GraphNum i)$/;" f class:GNode setIntVal showgraph/Utils/conf.h /^ inline void setIntVal( int val)$/;" f class:Option setLeft showgraph/Layout/node_group.h /^ inline void setLeft( qreal pos)$/;" f class:NodeGroup setLevel showgraph/Layout/aux_node.h /^ inline void setLevel( Level* l) $/;" f class:AuxNode setLexer gui/fileviewer.cpp /^void fileviewer::setLexer(int lang)$/;" f class:fileviewer setMode showgraph/GraphView/edge_item.h /^ inline void setMode( EdgeMode m)$/;" f class:EdgeItem setName showgraph/GraphView/gstyle.h /^inline void GStyle::setName( QString &str)$/;" f class:GStyle setNext showgraph/Utils/list.h /^ inline void setNext( ListId list, MListItem< dim> *n)$/;" f class:MListItem setNext showgraph/Utils/list.h /^ inline void setNext( MListItem< 1> *n)$/;" f class:MListItem setNextFree showgraph/Utils/mem_entry.h /^ Entry< Data>::setNextFree( ChunkPos next)$/;" f class:MemImpl::Entry setNode showgraph/Graph/edge_inline.h /^Edge::setNode( Node *n, GraphDir dir)$/;" f class:Edge setNode showgraph/GraphView/edge_item.h /^ inline void setNode( GNode *n, GraphDir dir)$/;" f class:GEdge setNode showgraph/GraphView/graph_view.h /^ inline void setNode( GNode *n)$/;" f class:NavEvent setNodeInFocus showgraph/GraphView/graph_view.h /^ inline void setNodeInFocus( GNode *n, NavSector sector = UNDEF_SECTOR)$/;" f class:GGraph setNodeStyle showgraph/GraphView/graph_view.cpp /^void GGraph::setNodeStyle( GStyle *style)$/;" f class:GGraph setNodeStyle showgraph/GraphView/graph_view.cpp /^void GraphView::setNodeStyle( GStyle *style)$/;" f class:GraphView setNumber showgraph/Graph/num.h /^Numbered::setNumber( Numeration num,$/;" f class:Numbered setOpacityLevel showgraph/GraphView/node_item.h /^ inline void setOpacityLevel( qreal op_l)$/;" f class:NodeItem setOrder showgraph/Layout/aux_node.h /^ inline void setOrder( int order)$/;" f class:AuxNode setPeerInDir showgraph/Utils/list.h /^ inline void setPeerInDir( ListId list, MListItem< dim> *p, ListDir dir)$/;" f class:MListItem setPeerInDir showgraph/Utils/list.h /^ inline void setPeerInDir( MListItem< 1> *p, ListDir dir)$/;" f class:MListItem setPen showgraph/GraphView/gstyle.h /^inline void GStyle::setPen( QPen &pn)$/;" f class:GStyle setPenColor showgraph/GraphView/gstyle.h /^inline void GStyle::setPenColor( QColor &color)$/;" f class:GStyle setPenStyle showgraph/GraphView/gstyle.h /^inline void GStyle::setPenStyle( Qt::PenStyle st)$/;" f class:GStyle setPenWidth showgraph/GraphView/gstyle.h /^inline void GStyle::setPenWidth( qreal width)$/;" f class:GStyle setPos showgraph/Utils/mem_entry.h /^ Entry< Data>::setPos( ChunkPos pos)$/;" f class:MemImpl::Entry setPred showgraph/Graph/edge_inline.h /^inline void Edge::setPred( Node *n)$/;" f class:Edge setPred showgraph/GraphView/edge_item.h /^ inline void setPred( GNode *n)$/;" f class:GEdge setPrev showgraph/Utils/list.h /^ inline void setPrev( ListId list, MListItem< dim> *p)$/;" f class:MListItem setPrev showgraph/Utils/list.h /^ inline void setPrev( MListItem< 1> *p)$/;" f class:MListItem setPriority showgraph/Layout/aux_node.h /^ inline void setPriority( int p) $/;" f class:AuxNode setRank showgraph/Layout/aux_graph.h /^ inline void setRank( Rank r)$/;" f class:Level setRank showgraph/Layout/aux_node.h /^ inline void setRank( Rank r)$/;" f class:AuxNode setRight showgraph/Layout/node_group.h /^ inline void setRight( qreal pos)$/;" f class:NodeGroup setSelf showgraph/Layout/aux_edge.h /^ inline void setSelf()$/;" f class:AuxEdge setShape showgraph/GraphView/gstyle.h /^inline void GStyle::setShape( NodeShape new_shape)$/;" f class:GStyle setSrc showgraph/GraphView/edge_helper.h /^EdgeHelper::setSrc( NodeItem *item)$/;" f class:EdgeHelper setStable showgraph/Layout/aux_node.h /^ inline void setStable( bool st = true)$/;" f class:AuxNode setState showgraph/GraphView/gstyle.h /^inline void GStyle::setState( bool default_state)$/;" f class:GStyle setStringVal showgraph/Utils/conf.h /^ inline void setStringVal( QString val)$/;" f class:Option setStyle showgraph/GraphView/edge_item.h /^inline void GEdge::setStyle( GStyle *st)$/;" f class:GEdge setStyle showgraph/GraphView/node_item.h /^ inline void setStyle( GStyle *st)$/;" f class:GNode setStyleEditInfo showgraph/GraphView/graph_view.h /^ inline void setStyleEditInfo( StyleEditInfo* info)$/;" f class:GraphView setSucc showgraph/Graph/edge_inline.h /^inline void Edge::setSucc( Node *n)$/;" f class:Edge setSucc showgraph/GraphView/edge_item.h /^ inline void setSucc( GNode *n)$/;" f class:GEdge setTabWidth gui/fileviewsettingsdialog.cpp /^void cqDialogFileViewSettings::setTabWidth(const int& width)$/;" f class:cqDialogFileViewSettings setTextDock showgraph/GraphView/node_item.h /^ inline void setTextDock( QDockWidget *dock)$/;" f class:NodeItem setTextShown showgraph/GraphView/node_item.h /^ inline void setTextShown( bool shown = true)$/;" f class:GNode setTheme gui/themes.cpp /^void themes::setTheme(const QString& theme, int lang, QsciLexer* lexer, const QFont& fontt)$/;" f class:themes setTree showgraph/Layout/aux_edge.h /^ inline void setTree()$/;" f class:AuxEdge setType showgraph/Layout/aux_edge.h /^ inline void setType( AuxEdgeType t = UNKNOWN_TYPE_EDGE)$/;" f class:AuxEdge setType showgraph/Layout/aux_node.h /^ inline void setType( AuxNodeType t)$/;" f class:AuxNode setTypeEdgeControl showgraph/Layout/aux_node.h /^ inline void setTypeEdgeControl()$/;" f class:AuxNode setTypeEdgeLabel showgraph/Layout/aux_node.h /^ inline void setTypeEdgeLabel()$/;" f class:AuxNode setTypeSimple showgraph/Layout/aux_node.h /^ inline void setTypeSimple()$/;" f class:AuxNode setUnknown showgraph/Layout/aux_edge.h /^ inline void setUnknown()$/;" f class:AuxEdge setVal showgraph/Utils/mem_utest.cpp /^ void setVal( quint32 val)$/;" f class:MyPoolObj setWidth showgraph/Layout/aux_node.h /^ inline void setWidth( double w) $/;" f class:AuxNode setX showgraph/Layout/aux_node.h /^ inline void setX( double x)$/;" f class:AuxNode setY showgraph/Layout/aux_graph.h /^ inline void setY( qreal yy)$/;" f class:Level setY showgraph/Layout/aux_node.h /^ inline void setY( double y)$/;" f class:AuxNode set_header makedb/csdbheader.cpp /^void csdbheader::set_header(const char* hdr)$/;" f class:csdbheader set_header makedb/csdbheader.cpp /^void csdbheader::set_header(tStr hdr)$/;" f class:csdbheader setme querylib/small_lib.cpp /^void smartFILE::setme(FILE *fptr) {close_file(); m_fp = fptr;}$/;" f class:smartFILE setupGraphFromXML gui/graphdialog.cpp /^void cqDialogGraph::setupGraphFromXML(QString grpxml, QString grpdot, QString desc)$/;" f class:cqDialogGraph setup_CPP gui/obsolete/highlighter.cpp /^ void Highlighter::setup_CPP(void)$/;" f class:Highlighter setup_Java gui/obsolete/highlighter.cpp /^ void Highlighter::setup_Java(void)$/;" f class:Highlighter setup_Python gui/obsolete/highlighter.cpp /^ void Highlighter::setup_Python(void)$/;" f class:Highlighter setup_fileviewer gui/mainwindow.cpp /^void mainwindow::setup_fileviewer(void)$/;" f class:mainwindow setup_listhandler gui/mainwindow.cpp /^void mainwindow::setup_listhandler(void)$/;" f class:mainwindow setup_searchhandler gui/mainwindow.cpp /^void mainwindow::setup_searchhandler(void)$/;" f class:mainwindow setup_srcfil_read makedb/csdbparser.cpp /^csdbparser::enResult csdbparser::setup_srcfil_read(void)$/;" f class:csdbparser setup_symbol_read makedb/csdbparser.cpp /^csdbparser::enResult csdbparser::setup_symbol_read(void)$/;" f class:csdbparser setup_tables makedb/cs2sq.cpp /^cs2sq::enResult cs2sq::setup_tables(void)$/;" f class:cs2sq shape showgraph/GraphView/edge_helper.cpp /^EdgeHelper::shape() const$/;" f class:EdgeHelper shape showgraph/GraphView/edge_item.cpp /^EdgeItem::shape() const$/;" f class:EdgeItem shape showgraph/GraphView/gstyle.h /^inline NodeShape GStyle::shape() const$/;" f class:GStyle shape showgraph/GraphView/node_item.cpp /^NodeItem::shape() const$/;" f class:NodeItem shape2Path showgraph/GraphView/node_item.cpp /^shape2Path( NodeShape shape, QRectF rect)$/;" f shape2Rect showgraph/GraphView/node_item.cpp /^shape2Rect( NodeShape shape, QRectF rect)$/;" f shapeChanged showgraph/GraphView/node_item.cpp /^void NodeItem::shapeChanged()$/;" f class:NodeItem shape_combo showgraph/GraphView/style_edit.h /^ QComboBox *shape_combo;$/;" m class:StyleEdit shape_label showgraph/GraphView/style_edit.h /^ QLabel *shape_label;$/;" m class:StyleEdit shape_priv showgraph/GraphView/gstyle.h /^ NodeShape shape_priv;$/;" m class:GStyle shiftEdge showgraph/Layout/layout.cpp /^ void shiftEdge()$/;" f struct:DfsStepInfo shortName showgraph/Utils/conf.h /^ inline QString shortName() const$/;" f class:Option shortOption showgraph/Utils/conf.h /^ inline Option* shortOption( QString name)$/;" f class:Conf short_name showgraph/Utils/conf.h /^ QString short_name;$/;" m class:Option short_opts showgraph/Utils/conf.h /^ QHash< QString, Option *> short_opts;$/;" m class:Conf showEdgePred showgraph/GraphView/graph_view.cpp /^void GGraph::showEdgePred()$/;" f class:GGraph showEdgePred showgraph/GraphView/graph_view.cpp /^void GraphView::showEdgePred()$/;" f class:GraphView showEdgeSucc showgraph/GraphView/graph_view.cpp /^void GGraph::showEdgeSucc()$/;" f class:GGraph showEdgeSucc showgraph/GraphView/graph_view.cpp /^void GraphView::showEdgeSucc()$/;" f class:GraphView showEditEdgeStyle showgraph/GraphView/graph_view.cpp /^void GGraph::showEditEdgeStyle()$/;" f class:GGraph showEditEdgeStyle showgraph/GraphView/graph_view.cpp /^void GraphView::showEditEdgeStyle()$/;" f class:GraphView showEditEdgeStyleAct showgraph/GraphView/graph_view.h /^ QAction *showEditEdgeStyleAct;$/;" m class:GraphView showEditNodeStyle showgraph/GraphView/graph_view.cpp /^void GGraph::showEditNodeStyle()$/;" f class:GGraph showEditNodeStyle showgraph/GraphView/graph_view.cpp /^void GraphView::showEditNodeStyle()$/;" f class:GraphView showEditNodeStyleAct showgraph/GraphView/graph_view.h /^ QAction *showEditNodeStyleAct;$/;" m class:GraphView showHelper showgraph/GraphView/graph_view.h /^ inline void showHelper()$/;" f class:GraphView showNodeText showgraph/GraphView/graph_view.h /^ inline void showNodeText( GNode * n)$/;" f class:GraphView showNodesText showgraph/GraphView/graph_view.cpp /^void GGraph::showNodesText()$/;" f class:GGraph showPredAct showgraph/GraphView/graph_view.h /^ QAction *showPredAct;$/;" m class:GraphView showSelectedNodesText showgraph/GraphView/graph_view.cpp /^void GraphView::showSelectedNodesText()$/;" f class:GraphView showSuccAct showgraph/GraphView/graph_view.h /^ QAction *showSuccAct;$/;" m class:GraphView showTextAct showgraph/GraphView/graph_view.h /^ QAction *showTextAct;$/;" m class:GraphView showWholeGraph showgraph/GraphView/graph_view.cpp /^void GGraph::showWholeGraph()$/;" f class:GGraph show_menus showgraph/GraphView/graph_view.h /^ bool show_menus;$/;" m class:GraphView showgraph showgraph/showgraph.cpp /^showgraph::showgraph()$/;" f class:showgraph showgraph showgraph/showgraph.h /^class showgraph$/;" c singleLineCommentFormat gui/obsolete/highlighter.h /^ QTextCharFormat singleLineCommentFormat;$/;" m class:Highlighter single_line_symbol makedb/csdbparser.cpp /^csdbparser::enResult csdbparser::single_line_symbol(bool& endOfSymbData, bool& foundSomething)$/;" f class:csdbparser singlequotationFormat gui/obsolete/highlighter.h /^ QTextCharFormat singlequotationFormat;$/;" m class:Highlighter size querylib/small_lib.cpp /^unsigned int tempbuf::size(void) const {return m_size;}$/;" f class:tempbuf sizeHint gui/obsolete/CodeEditor.h /^ QSize sizeHint() const {$/;" f class:LineNumberArea sizeHint showgraph/GraphView/style_edit.cpp /^QSize ColorButton::sizeHint() const$/;" f class:ColorButton smartFILE querylib/small_lib.cpp /^smartFILE::smartFILE() :m_fp(NULL) {}$/;" f class:smartFILE smartFILE querylib/small_lib.cpp /^smartFILE::smartFILE(FILE *fptr) :m_fp(fptr) {}$/;" f class:smartFILE smartFILE querylib/small_lib.cpp /^smartFILE::smartFILE(const smartFILE& sfp) :m_fp(sfp.m_fp) {}$/;" f class:smartFILE smartFILE querylib/small_lib.h /^class smartFILE$/;" c smooth_focus showgraph/GraphView/graph_view.h /^ bool smooth_focus;$/;" m class:GraphView smooth_layout_adjustment showgraph/GraphView/graph_view.h /^ bool smooth_layout_adjustment;$/;" m class:GraphView sortNodesByOrder showgraph/Layout/layout.cpp /^void Level::sortNodesByOrder()$/;" f class:Level spacing showgraph/Layout/aux_node.h /^ inline qreal spacing( AuxNodeType prev_type) const$/;" f class:AuxNode splitCmdLine gui/winmain.cpp /^vector splitCmdLine()$/;" f splitstr querylib/small_lib.cpp /^std::vector splitstr(const char* inpstr, const char delim)$/;" f sq gui/searchhandler.cpp /^sqlqueryadv* searchhandler::sq = NULL;$/;" m class:searchhandler file: sq gui/searchhandler.h /^static sqlqueryadv* sq;$/;" m class:searchhandler sqlbase makedb/sqlbase.cpp /^sqlbase::sqlbase()$/;" f class:sqlbase sqlbase makedb/sqlbase.h /^class sqlbase$/;" c sqlerrmsg querylib/sqlquery.h /^ tStr sqlerrmsg;$/;" m class:sqlqueryresultlist sqlerrormsg gui/searchhandler.cpp /^QString searchhandler::sqlerrormsg(sqlquery::en_filereadstatus status)$/;" f class:searchhandler sqlfileINCORRECTVER querylib/sqlquery.h /^ sqlfileINCORRECTVER,$/;" e enum:sqlquery::en_filereadstatus sqlfileNOTCORRECTDB querylib/sqlquery.h /^ sqlfileNOTCORRECTDB,$/;" e enum:sqlquery::en_filereadstatus sqlfileOK querylib/sqlquery.h /^ sqlfileOK = 0,$/;" e enum:sqlquery::en_filereadstatus sqlfileOPENERROR querylib/sqlquery.h /^ sqlfileOPENERROR,$/;" e enum:sqlquery::en_filereadstatus sqlfileUNKNOWNERROR querylib/sqlquery.h /^ sqlfileUNKNOWNERROR$/;" e enum:sqlquery::en_filereadstatus sqlquery querylib/sqlquery.cpp /^sqlquery::sqlquery()$/;" f class:sqlquery sqlquery querylib/sqlquery.h /^class sqlquery$/;" c sqlquerySYMBOL querylib/sqlquery.h /^ sqlquerySYMBOL = 0,$/;" e enum:sqlquery::en_queryType sqlqueryadv gui/sqlqueryadv.cpp /^sqlqueryadv::sqlqueryadv()$/;" f class:sqlqueryadv sqlqueryadv gui/sqlqueryadv.h /^class sqlqueryadv : public sqlquery$/;" c sqlqueryresult querylib/sqlquery.h /^ sqlqueryresult() : linenum((const char*)"1"){}$/;" f class:sqlqueryresult sqlqueryresult querylib/sqlquery.h /^class sqlqueryresult$/;" c sqlqueryresultlist querylib/sqlquery.cpp /^sqlqueryresultlist::sqlqueryresultlist()$/;" f class:sqlqueryresultlist sqlqueryresultlist querylib/sqlquery.cpp /^sqlqueryresultlist::sqlqueryresultlist(const sqlqueryresultlist& copy)$/;" f class:sqlqueryresultlist sqlqueryresultlist querylib/sqlquery.h /^class sqlqueryresultlist$/;" c sqlresultAUTOCOMPLETE querylib/sqlquery.h /^ sqlresultAUTOCOMPLETE,$/;" e enum:sqlquery::en_queryType sqlresultCALLEDFUNC querylib/sqlquery.h /^ sqlresultCALLEDFUNC,$/;" e enum:sqlquery::en_queryType sqlresultCALLINGFUNC querylib/sqlquery.h /^ sqlresultCALLINGFUNC,$/;" e enum:sqlquery::en_queryType sqlresultCALLSOFFUNC querylib/sqlquery.h /^ sqlresultCALLSOFFUNC,$/;" e enum:sqlquery::en_queryType sqlresultCHILDCLASS querylib/sqlquery.h /^ sqlresultCHILDCLASS,$/;" e enum:sqlquery::en_queryType sqlresultCLASS_STRUCT querylib/sqlquery.h /^ sqlresultCLASS_STRUCT,$/;" e enum:sqlquery::en_queryType sqlresultDEFAULT querylib/sqlquery.h /^ sqlresultDEFAULT = 100$/;" e enum:sqlquery::en_queryType sqlresultERROR querylib/sqlquery.h /^ sqlresultERROR$/;" e enum:sqlqueryresultlist::en_resultType sqlresultFILEPATH querylib/sqlquery.h /^ sqlresultFILEPATH,$/;" e enum:sqlquery::en_queryType sqlresultFILE_LINE querylib/sqlquery.h /^ sqlresultFILE_LINE,$/;" e enum:sqlqueryresultlist::en_resultType sqlresultFILE_ONLY querylib/sqlquery.h /^ sqlresultFILE_ONLY,$/;" e enum:sqlqueryresultlist::en_resultType sqlresultFULL querylib/sqlquery.h /^ sqlresultFULL = 0,$/;" e enum:sqlqueryresultlist::en_resultType sqlresultFUNCSINFILE querylib/sqlquery.h /^ sqlresultFUNCSINFILE,$/;" e enum:sqlquery::en_queryType sqlresultFUNC_MACRO querylib/sqlquery.h /^ sqlresultFUNC_MACRO,$/;" e enum:sqlquery::en_queryType sqlresultGREP querylib/sqlquery.h /^ sqlresultGREP,$/;" e enum:sqlquery::en_queryType sqlresultINCLUDE querylib/sqlquery.h /^ sqlresultINCLUDE,$/;" e enum:sqlquery::en_queryType sqlresultMEMBERS querylib/sqlquery.h /^ sqlresultMEMBERS,$/;" e enum:sqlquery::en_queryType sqlresultOWNERCLASS querylib/sqlquery.h /^ sqlresultOWNERCLASS,$/;" e enum:sqlquery::en_queryType sqlresultPARENTCLASS querylib/sqlquery.h /^ sqlresultPARENTCLASS,$/;" e enum:sqlquery::en_queryType sqlresultSYM_ONLY querylib/sqlquery.h /^ sqlresultSYM_ONLY,$/;" e enum:sqlqueryresultlist::en_resultType src showgraph/GraphView/edge_helper.h /^EdgeHelper::src() const$/;" f class:EdgeHelper srcP showgraph/GraphView/edge_helper.h /^ QPointF srcP;$/;" m class:EdgeHelper srcP showgraph/GraphView/edge_item.h /^ QPointF srcP;$/;" m class:EdgeItem src_item showgraph/GraphView/edge_helper.h /^ NodeItem *src_item;$/;" m class:EdgeHelper stClsID makedb/ctagread.h /^} stClsID;$/;" t typeref:struct:__anon6 stIDLE makedb/csdbparser.h /^ stIDLE = 0,$/;" e enum:csdbparser::enState stSYMB_SETUP_DONE makedb/csdbparser.h /^ stSYMB_SETUP_DONE$/;" e enum:csdbparser::enState stStrID makedb/cs2sq.h /^} stStrID;$/;" t typeref:struct:__anon4 stable showgraph/Layout/aux_node.h /^ bool stable;$/;" m class:AuxNode startAnimationNodes showgraph/GraphView/graph_view.cpp /^void GraphView::startAnimationNodes()$/;" f class:GraphView state showgraph/GraphView/edge_helper.h /^ EdgeHelperState state;$/;" m class:EdgeHelper str makedb/cs2sq.h /^ std::string str;$/;" m struct:__anon4 str2NodeShape showgraph/GraphView/gstyle.h /^str2NodeShape( const QString &str)$/;" f str2qt gui/std2qt.h /^inline QString str2qt(const tStr& inp)$/;" f strIDList makedb/cs2sq.h /^typedef std::vector strIDList;$/;" t strLst2qt gui/std2qt.cpp /^QStringList strLst2qt(const tVecStr& inpLst)$/;" f strctagIDList makedb/ctagread.h /^typedef std::vector strctagIDList;$/;" t string showgraph/Utils/conf.h /^ inline QString string() const$/;" f class:Option string_val showgraph/Utils/conf.h /^ QString string_val;$/;" m class:Option strrevcmp querylib/small_lib.cpp /^bool strrevcmp(tStr str, tStr cmpstr)$/;" f strvect makedb/csdbparser.h /^typedef std::vector strvect;$/;" t style showgraph/GraphView/edge_item.h /^ inline GStyle * style() const$/;" f class:GEdge style showgraph/GraphView/node_item.h /^ inline GStyle * style() const$/;" f class:GNode styleEditFinished showgraph/GraphView/graph_view.cpp /^void GraphView::styleEditFinished( int result)$/;" f class:GraphView style_edit_info showgraph/GraphView/graph_view.h /^ StyleEditInfo *style_edit_info;$/;" m class:GraphView styleid gui/themes.cpp /^ int styleid;$/;" m struct:__anon2 file: styles showgraph/GraphView/graph_view.h /^ QHash< QString, GStyle *> styles;$/;" m class:GGraph succ showgraph/Graph/agraph.h /^ inline ANode *succ() const $/;" f class:AEdge succ showgraph/Graph/edge_inline.h /^inline Node *Edge::succ() const$/;" f class:Edge succ showgraph/GraphView/edge_item.h /^ inline GNode *succ() const $/;" f class:GEdge succ showgraph/GraphView/edge_item.h /^ inline GNode* succ() const$/;" f class:EdgeItem succ showgraph/GraphView/visible_edge.h /^GNode *VEdge::succ() const$/;" f class:VEdge succ showgraph/Layout/aux_edge.h /^ inline AuxNode *succ() const $/;" f class:AuxEdge succ_priv showgraph/GraphView/visible_edge.h /^ GNode *succ_priv;$/;" m class:VEdge succsBegin showgraph/Graph/node_inline.h /^inline Node::Succ Node::succsBegin()$/;" f class:Node succsEnd showgraph/Graph/node_inline.h /^inline Node::Succ Node::succsEnd()$/;" f class:Node switchToRegular showgraph/GraphView/edge_helper.h /^EdgeHelper::switchToRegular()$/;" f class:EdgeHelper symClass makedb/csdbparser.h /^ symClass,$/;" e enum:sym_data::enSymType symDrctAssgnIncrDecr makedb/csdbparser.h /^ symDrctAssgnIncrDecr,$/;" e enum:sym_data::enSymType symEnum makedb/csdbparser.h /^ symEnum,$/;" e enum:sym_data::enSymType symFile makedb/csdbparser.h /^ symFile$/;" e enum:sym_data::enSymType symFuncCall makedb/csdbparser.h /^ symFuncCall,$/;" e enum:sym_data::enSymType symFuncDef makedb/csdbparser.h /^ symFuncDef,$/;" e enum:sym_data::enSymType symFuncParam makedb/csdbparser.h /^ symFuncParam,$/;" e enum:sym_data::enSymType symGlobal makedb/csdbparser.h /^ symGlobal,$/;" e enum:sym_data::enSymType symGlobalEnumStructUnion makedb/csdbparser.h /^ symGlobalEnumStructUnion,$/;" e enum:sym_data::enSymType symIncl makedb/csdbparser.h /^ symIncl,$/;" e enum:sym_data::enSymType symLocalFuncBlockDef makedb/csdbparser.h /^ symLocalFuncBlockDef,$/;" e enum:sym_data::enSymType symMacroDef makedb/csdbparser.h /^ symMacroDef,$/;" e enum:sym_data::enSymType symNone makedb/csdbparser.h /^ symNone = 0,$/;" e enum:sym_data::enSymType symStruct makedb/csdbparser.h /^ symStruct,$/;" e enum:sym_data::enSymType symTypeDef makedb/csdbparser.h /^ symTypeDef,$/;" e enum:sym_data::enSymType symUnion makedb/csdbparser.h /^ symUnion,$/;" e enum:sym_data::enSymType sym_data makedb/csdbparser.cpp /^sym_data::sym_data()$/;" f class:sym_data sym_data makedb/csdbparser.cpp /^sym_data::sym_data(const sym_data& copy)$/;" f class:sym_data sym_data makedb/csdbparser.h /^class sym_data$/;" c sym_type makedb/csdbparser.h /^enSymType sym_type;$/;" m class:sym_data symbname makedb/csdbparser.h /^std::string symbname;$/;" m class:sym_data symbname_escaped makedb/csdbparser.cpp /^std::string sym_data::symbname_escaped(void)$/;" f class:sym_data symbolread makedb/csdbparser.cpp /^csdbparser::enResult csdbparser::symbolread(sym_data *data, symdata_pack* pack)$/;" f class:csdbparser symbols makedb/csdbparser.h /^symdatalist symbols;$/;" m class:symdata_pack symbtypetbl makedb/csdbparser.cpp /^static const chr2enum symbtypetbl[] =$/;" v file: symbtypetbl_SIZE makedb/csdbparser.cpp /^#define symbtypetbl_SIZE /;" d file: symdata_pack makedb/csdbparser.cpp /^symdata_pack::symdata_pack()$/;" f class:symdata_pack symdata_pack makedb/csdbparser.cpp /^symdata_pack::symdata_pack(const symdata_pack& copy)$/;" f class:symdata_pack symdata_pack makedb/csdbparser.h /^class symdata_pack$/;" c symdatalist makedb/csdbparser.h /^typedef std::vector symdatalist;$/;" t symname querylib/sqlquery.h /^ tStr symname;$/;" m class:sqlqueryresult symtype querylib/sqlquery.h /^ tStr symtype;$/;" m class:sqlqueryresult tStr querylib/small_lib.h /^typedef std::string tStr;$/;" t tVecStr querylib/small_lib.h /^typedef std::vector tVecStr;$/;" t tabWidthSelectionTemporary gui/fileviewer.cpp /^void fileviewer::tabWidthSelectionTemporary(const QString &width)$/;" f class:fileviewer tempbuf querylib/small_lib.cpp /^tempbuf::tempbuf(unsigned int n)$/;" f class:tempbuf tempbuf querylib/small_lib.h /^class tempbuf$/;" c tempstmt querylib/sqlquery.cpp /^tempstmt::tempstmt()$/;" f class:tempstmt tempstmt querylib/sqlquery.h /^class tempstmt$/;" c test gui/obsolete/highlighter.cpp /^void test(void)$/;" f test_csdb makedb/cs2sq.cpp /^csdbparser::enResult cs2sq::test_csdb(void)$/;" f class:cs2sq textDock showgraph/GraphView/node_item.h /^ inline QDockWidget *textDock() const$/;" f class:NodeItem textRect showgraph/GraphView/node_item.h /^ inline QRectF textRect() const$/;" f class:NodeItem textSizeChange gui/fileviewer.cpp /^void fileviewer::textSizeChange(int n)$/;" f class:fileviewer text_dock showgraph/GraphView/node_item.h /^ QDockWidget *text_dock;$/;" m class:NodeItem text_shown showgraph/GraphView/node_item.h /^ bool text_shown;$/;" m class:GNode themeSelectionTemporary gui/fileviewer.cpp /^void fileviewer::themeSelectionTemporary(const QString &themetxt)$/;" f class:fileviewer themelist gui/themes_gen.cpp /^static const char* themelist[] = {$/;" v file: themename gui/themes.cpp /^ const char *themename;$/;" m struct:__anon3 file: themes gui/themes.h /^class themes$/;" c timerEvent showgraph/GraphView/graph_view.cpp /^void GraphView::timerEvent( QTimerEvent *event)$/;" f class:GraphView timer_id showgraph/GraphView/graph_view.h /^ int timer_id;$/;" m class:GraphView tmpSrc showgraph/GraphView/graph_view.h /^ GNode *tmpSrc;$/;" m class:GraphView toBeDeleted showgraph/Utils/mem_pool.h /^ inline void toBeDeleted()$/;" f class:Mem::PoolObj toRegular showgraph/GraphView/node_item.h /^ inline void toRegular()$/;" f class:NodeItem to_be_deleted showgraph/Utils/mem_pool.h /^ bool to_be_deleted;$/;" m class:Mem::PoolObj toggleEditableAction showgraph/GraphView/graph_view.h /^ inline QAction* toggleEditableAction() const$/;" f class:GraphView toggleEdition showgraph/GraphView/graph_view.cpp /^void GraphView::toggleEdition( bool e)$/;" f class:GraphView toggleSmoothFocus showgraph/GraphView/graph_view.cpp /^void GraphView::toggleSmoothFocus( bool smooth)$/;" f class:GraphView toggleViewMode showgraph/GraphView/graph_view.cpp /^void GraphView::toggleViewMode( bool context)$/;" f class:GraphView toolTip gui/obsolete/CodeEditorWidgetPlugin/CodeEditorWidgetPlugin.cpp /^ QString CodeEditorWidgetPlugin::toolTip() const$/;" f class:CodeEditorWidgetPlugin topLeft showgraph/GraphView/edge_helper.h /^ QPointF topLeft;$/;" m class:EdgeHelper topLeft showgraph/GraphView/edge_item.h /^ QPointF topLeft;$/;" m class:EdgeItem translatedoc gui/translations/dowebtranslate.pl /^sub translatedoc$/;" s type makedb/csdbparser.cpp /^sym_data::enSymType type;$/;" m struct:__anon5 file: type showgraph/GraphView/edge_helper.h /^inline int EdgeHelper::type() const$/;" f class:EdgeHelper type showgraph/GraphView/edge_item.h /^ int type() const$/;" f class:EdgeItem type showgraph/GraphView/graph_view.h /^ NavEventType type;$/;" m class:NavEvent type showgraph/GraphView/node_item.h /^ inline int type() const$/;" f class:NodeItem type showgraph/Layout/aux_edge.h /^ inline AuxEdgeType type() const$/;" f class:AuxEdge type showgraph/Layout/aux_node.h /^ inline AuxNodeType type() const$/;" f class:AuxNode type showgraph/Utils/conf.h /^ inline OptType type() const$/;" f class:Option uTestConf showgraph/Utils/conf_utest.cpp /^bool uTestConf()$/;" f uTestList showgraph/Utils/list_utest.cpp /^bool uTestList()$/;" f uTestMList showgraph/Utils/list_utest.cpp /^static bool uTestMList()$/;" f file: uTestMem showgraph/Utils/mem_utest.cpp /^bool uTestMem()$/;" f uTestPools showgraph/Utils/mem_utest.cpp /^uTestPools()$/;" f file: uTestRef showgraph/Utils/mem_utest.cpp /^uTestRef()$/;" f file: uTestSingle showgraph/Utils/utils_utest.cpp /^bool uTestSingle()$/;" f uTestUtils showgraph/Utils/utils_utest.cpp /^bool uTestUtils()$/;" f ui gui/mainwindow.h /^Ui::MainWindow *ui;$/;" m class:mainwindow uid showgraph/Graph/edge.h /^ GraphUid uid; \/\/Unique ID$/;" m class:Edge uid showgraph/Graph/node.h /^ GraphUid uid; \/**< Unique id *\/$/;" m class:Node unNumber showgraph/Graph/num.h /^Numbered::unNumber( Numeration num)$/;" f class:Numbered unique_symnames gui/sqlqueryadv.cpp /^void sqlqueryadv::unique_symnames(sqlqueryresultlist& res)$/;" f class:sqlqueryadv unknownOptsNum showgraph/Utils/conf.h /^ inline int unknownOptsNum() const$/;" f class:Conf unknown_options showgraph/Utils/conf.h /^ QList< QString> unknown_options;$/;" m class:Conf unmark showgraph/Graph/marker.h /^inline bool Marked::unmark( Marker marker)$/;" f class:Marked updateAssociates showgraph/GraphView/node_item.cpp /^void NodeItem::updateAssociates()$/;" f class:NodeItem updateElement showgraph/Graph/edge.cpp /^Edge::updateElement()$/;" f class:Edge updateElement showgraph/Graph/node_inline.h /^Node::updateElement()$/;" f class:Node updateElement showgraph/GraphView/edge_item.cpp /^GEdge::updateElement()$/;" f class:GEdge updateElement showgraph/GraphView/node_item.cpp /^GNode::updateElement()$/;" f class:GNode updateFilePathLabel gui/fileviewer.cpp /^void fileviewer::updateFilePathLabel(void)$/;" f class:fileviewer updateFilterHistory gui/searchhandler.cpp /^void searchhandler::updateFilterHistory(QString filtertxt)$/;" f class:searchhandler updateLineNumberArea gui/obsolete/CodeEditor.cpp /^ void CodeEditor::updateLineNumberArea(const QRect &rect, int dy)$/;" f class:CodeEditor updateLineNumberAreaWidth gui/obsolete/CodeEditor.cpp /^ void CodeEditor::updateLineNumberAreaWidth(int \/* newBlockCount *\/)$/;" f class:CodeEditor updateList gui/listhandler.cpp /^void listhandler::updateList(void)$/;" f class:listhandler updateListHeaders gui/listhandler.cpp /^void listhandler::updateListHeaders(void)$/;" f class:listhandler updateListItemRowNum gui/searchhandler.cpp /^void searchhandler::updateListItemRowNum(const int& row)$/;" f class:searchhandler updateMatrix showgraph/GraphView/graph_view.cpp /^void GraphView::updateMatrix()$/;" f class:GraphView updateSearchHistory gui/searchhandler.cpp /^void searchhandler::updateSearchHistory(const QString& searchtxt)$/;" f class:searchhandler updateTextEdit gui/fileviewer.cpp /^void fileviewer::updateTextEdit(void)$/;" f class:fileviewer vacuum makedb/sqlbase.cpp /^int sqlbase::vacuum(const char* fn, const bool& debug)$/;" f class:sqlbase val showgraph/Utils/mem_utest.cpp /^ quint32 val() const$/;" f class:MyPoolObj valid makedb/csdbparser.h /^bool valid;$/;" m class:sym_data valid makedb/csdbparser.h /^bool valid;$/;" m class:symdata_pack validateRanking showgraph/Layout/aux_graph.h /^ inline void validateRanking()$/;" f class:AuxGraph value showgraph/Graph/marker.h /^ MarkerValue value;$/;" m class:Marker value showgraph/Graph/num.h /^ NumValue value;$/;" m class:Numeration values showgraph/Utils/conf.h /^ OptValues values;$/;" m class:Option view showgraph/GraphView/graph_view.h /^ inline GraphView *view() const$/;" f class:GGraph viewEvent showgraph/GraphView/graph_view.cpp /^void GraphViewHistory::viewEvent( NavEventType t, GNode *n)$/;" f class:GraphViewHistory viewHistory showgraph/GraphView/graph_view.h /^ inline GraphViewHistory * viewHistory() const$/;" f class:GraphView view_history showgraph/GraphView/graph_view.h /^ GraphViewHistory *view_history;$/;" m class:GraphView view_mode showgraph/GraphView/graph_view.h /^ GraphViewMode view_mode;$/;" m class:GraphView view_p showgraph/GraphView/graph_view.h /^ GraphView *view_p;$/;" m class:GGraph watcher showgraph/Layout/aux_graph.h /^ QFutureWatcher< void> *watcher;$/;" m class:AuxGraph weight showgraph/Layout/node_group.h /^ inline float weight() const$/;" f class:NodeGroup whatsThis gui/obsolete/CodeEditorWidgetPlugin/CodeEditorWidgetPlugin.cpp /^ QString CodeEditorWidgetPlugin::whatsThis() const$/;" f class:CodeEditorWidgetPlugin wheelEvent showgraph/GraphView/graph_view.cpp /^void GraphView::wheelEvent(QWheelEvent *event)$/;" f class:GraphView width showgraph/GraphView/node_item.h /^ virtual inline double width() const$/;" f class:GNode width showgraph/Layout/aux_node.h /^ virtual double width() const$/;" f class:AuxNode writeElement showgraph/GraphView/gstyle.h /^GStyle::writeElement( QDomElement e, bool save_name)$/;" f class:GStyle writeSettings gui/mainwindow.cpp /^void mainwindow::writeSettings()$/;" f class:mainwindow writeToXML showgraph/Graph/graph.cpp /^Graph::writeToXML( QString filename)$/;" f class:Graph writeToXML showgraph/GraphView/graph_view.cpp /^GGraph::writeToXML( QString filename)$/;" f class:GGraph y showgraph/Layout/aux_graph.h /^ inline qreal y() const$/;" f class:Level y_pos showgraph/Layout/aux_graph.h /^ qreal y_pos;$/;" m class:Level zeroLinks showgraph/Utils/list.h /^ inline void zeroLinks()$/;" f class:MListItem zoomIn showgraph/GraphView/graph_view.cpp /^void GraphView::zoomIn()$/;" f class:GraphView zoomOrig showgraph/GraphView/graph_view.cpp /^void GraphView::zoomOrig()$/;" f class:GraphView zoomOut showgraph/GraphView/graph_view.cpp /^void GraphView::zoomOut()$/;" f class:GraphView zoom_out_done showgraph/GraphView/graph_view.h /^ bool zoom_out_done;$/;" m class:GraphView zoom_scale showgraph/GraphView/graph_view.h /^ qreal zoom_scale;$/;" m class:GraphView zoomin gui/graphdialog.cpp /^void cqDialogGraph::zoomin()$/;" f class:cqDialogGraph zoomout gui/graphdialog.cpp /^void cqDialogGraph::zoomout()$/;" f class:cqDialogGraph ~AuxGraph showgraph/Layout/aux_graph.cpp /^AuxGraph::~AuxGraph()$/;" f class:AuxGraph ~AuxNode showgraph/Layout/aux_graph.cpp /^AuxNode::~AuxNode()$/;" f class:AuxNode ~Conf showgraph/Utils/conf.h /^ ~Conf()$/;" f class:Conf ~Edge showgraph/Graph/edge.cpp /^Edge::~Edge()$/;" f class:Edge ~EdgeIterIface showgraph/Graph/node_inline.h /^inline EdgeIterIface< EdgeIterImpl>::~EdgeIterIface()$/;" f class:EdgeIterIface ~Entry showgraph/Utils/mem_entry.h /^ Entry< Data>::~Entry()$/;" f class:MemImpl::Entry ~FixedPool showgraph/Utils/mem_fixed_pool.h /^ FixedPool< Data>::~FixedPool()$/;" f class:Mem::FixedPool ~GEdge showgraph/GraphView/edge_item.cpp /^GEdge::~GEdge()$/;" f class:GEdge ~GGraph showgraph/GraphView/graph_view.cpp /^GGraph::~GGraph()$/;" f class:GGraph ~GNode showgraph/GraphView/node_item.cpp /^GNode::~GNode()$/;" f class:GNode ~GStyle showgraph/GraphView/gstyle.h /^ virtual ~GStyle(){};$/;" f class:GStyle ~Graph showgraph/Graph/graph.cpp /^Graph::~Graph()$/;" f class:Graph ~GraphView showgraph/GraphView/graph_view.cpp /^GraphView::~GraphView()$/;" f class:GraphView ~GraphViewHistory showgraph/GraphView/graph_view.h /^ ~GraphViewHistory()$/;" f class:GraphViewHistory ~ListItem showgraph/Utils/list.h /^ ~ListItem()$/;" f class:ListItem ~MListItem showgraph/Utils/list.h /^ virtual ~MListItem()$/;" f class:MListItem ~MemInfo showgraph/Utils/mem_mgr.h /^ ~MemInfo(){};$/;" f class:MemImpl::MemInfo ~MyPoolObj showgraph/Utils/mem_utest.cpp /^ ~MyPoolObj()$/;" f class:MyPoolObj ~Node showgraph/Graph/node.cpp /^Node::~Node()$/;" f class:Node ~Obj showgraph/Utils/mem_obj.h /^ ~Obj()$/;" f class:Mem::Obj ~Pool showgraph/Utils/mem_pool.h /^ virtual ~Pool(){};$/;" f class:Mem::Pool ~PoolObj showgraph/Utils/mem_pool.h /^ virtual ~PoolObj()$/;" f class:Mem::PoolObj ~Ref showgraph/Utils/mem_ref.h /^ ~Ref()$/;" f class:Mem::Ref ~classA showgraph/Utils/utils_utest.cpp /^ ~classA(){};$/;" f class:classA file: ~cqDialogAbout gui/aboutdialog.cpp /^cqDialogAbout::~cqDialogAbout()$/;" f class:cqDialogAbout ~cqDialogFileViewSettings gui/fileviewsettingsdialog.cpp /^cqDialogFileViewSettings::~cqDialogFileViewSettings()$/;" f class:cqDialogFileViewSettings ~cqDialogGraph gui/graphdialog.cpp /^cqDialogGraph::~cqDialogGraph()$/;" f class:cqDialogGraph ~cs2sq makedb/cs2sq.cpp /^cs2sq::~cs2sq()$/;" f class:cs2sq ~csdbparser makedb/csdbparser.cpp /^csdbparser::~csdbparser()$/;" f class:csdbparser ~ctagread makedb/ctagread.cpp /^ctagread::~ctagread()$/;" f class:ctagread ~fileviewer gui/fileviewer.cpp /^fileviewer::~fileviewer()$/;" f class:fileviewer ~idxcounter querylib/small_lib.cpp /^idxcounter::~idxcounter(){}$/;" f class:idxcounter ~listhandler gui/listhandler.cpp /^listhandler::~listhandler()$/;" f class:listhandler ~mainwindow gui/mainwindow.cpp /^mainwindow::~mainwindow()$/;" f class:mainwindow ~searchhandler gui/searchhandler.cpp /^searchhandler::~searchhandler()$/;" f class:searchhandler ~searchitem gui/searchhandler.h /^ ~searchitem(){}$/;" f class:searchitem ~showgraph showgraph/showgraph.cpp /^showgraph::~showgraph()$/;" f class:showgraph ~smartFILE querylib/small_lib.cpp /^smartFILE::~smartFILE() {close_file();}$/;" f class:smartFILE ~sqlbase makedb/sqlbase.cpp /^sqlbase::~sqlbase()$/;" f class:sqlbase ~sqlquery querylib/sqlquery.cpp /^sqlquery::~sqlquery()$/;" f class:sqlquery ~sqlqueryadv gui/sqlqueryadv.cpp /^sqlqueryadv::~sqlqueryadv()$/;" f class:sqlqueryadv ~sym_data makedb/csdbparser.h /^~sym_data() { \/* nothing to do *\/ }$/;" f class:sym_data ~symdata_pack makedb/csdbparser.h /^~symdata_pack() { \/* nothing to do *\/ }$/;" f class:symdata_pack ~tempbuf querylib/small_lib.cpp /^tempbuf::~tempbuf()$/;" f class:tempbuf ~tempstmt querylib/sqlquery.cpp /^tempstmt::~tempstmt()$/;" f class:tempstmt codequery-0.18.1/windows-install/000077500000000000000000000000001300045745200167375ustar00rootroot00000000000000codequery-0.18.1/windows-install/HOWTO-WINDOWS.txt000066400000000000000000000077771300045745200215520ustar00rootroot00000000000000 This HOWTO guide applies to Windows only HOW TO USE CODEQUERY WITH C/C++ CODE? 1. Change directory to the base folder of your source code like this: cd c:\projects\myproject\src 2. Create a cscope.files file with all the C/C++ source files listed in it. Files with inline assembly code should be excluded from this list. See: http://en.wikipedia.org/wiki/Inline_assembler dir /b/a/s *.c > cscope.files dir /b/a/s *.cpp >> cscope.files dir /b/a/s *.cxx >> cscope.files dir /b/a/s *.cc >> cscope.files dir /b/a/s *.h >> cscope.files dir /b/a/s *.hpp >> cscope.files dir /b/a/s *.hxx >> cscope.files dir /b/a/s *.hh >> cscope.files 3. Create a cscope database like this (add k, if you don't want standard include paths like for stdio.h): cscope -cb 4. Create a ctags database like this. ctags --fields=+i -n -R -L cscope.files 5. Run cqmakedb to create a CodeQuery database out of the cscope and ctags databases, like this: cqmakedb -s .\myproject.db -c cscope.out -t tags -p 6. Open myproject.db using the CodeQuery GUI tool. Wild card search (* and ?) supported if Exact Match is switched off. Or use cqsearch, the CLI-version of CodeQuery (type `cqsearch -h` for more info). Use cqmakedb -h to get help on cqmakedb command line arguments. HOW TO USE CODEQUERY WITH JAVA CODE? 1. Change directory to the base folder of your source code like this: cd c:\projects\myproject\src 2. Create a cscope.files file with all the Java source files listed in it. dir /b/a/s *.java > cscope.files 3. Create a cscope database like this: cscope -cbR 4. Create a ctags database like this: ctags --fields=+i -n -R -L cscope.files 5. Run cqmakedb to create a CodeQuery database out of the cscope and ctags databases, like this: cqmakedb -s .\myproject.db -c cscope.out -t tags -p 6. Open myproject.db using the CodeQuery GUI tool. Wild card search (* and ?) supported if Exact Match is switched off. Or use cqsearch, the CLI-version of CodeQuery (type `cqsearch -h` for more info). Use cqmakedb -h to get help on cqmakedb command line arguments. HOW TO USE CODEQUERY WITH PYTHON CODE? 1. Change directory to the base folder of your source code like this: cd c:\projects\myproject\src 2. Create a cscope.files file with all the Python source files listed in it. dir /b/a/s *.py > cscope.files 3. Create a cscope database like this: pycscope -i cscope.files 4. Create a ctags database like this. ctags --fields=+i -n -R -L cscope.files 5. Run cqmakedb to create a CodeQuery database out of the cscope and ctags databases, like this: cqmakedb -s .\myproject.db -c cscope.out -t tags -p 6. Open myproject.db using the CodeQuery GUI tool. Wild card search (* and ?) supported if Exact Match is switched off. Or use cqsearch, the CLI-version of CodeQuery (type `cqsearch -h` for more info). Use cqmakedb -h to get help on cqmakedb command line arguments. HOW TO USE CODEQUERY WITH RUBY, GO AND JAVASCRIPT CODE? 1. Change directory to the base folder of your source code like this: cd c:\projects\myproject\src 2. Create a cscope.files file with all the Ruby, Go or Javascript source files listed in it. dir /b/a/s *.rb > cscope.files dir /b/a/s *.go > cscope.files dir /b/a/s *.js > cscope.files 3. Create a cscope database like this: starscope -e cscope 4. Create a ctags database like this. ctags --fields=+i -n -R -L cscope.files 5. Run cqmakedb to create a CodeQuery database out of the cscope and ctags databases, like this: cqmakedb -s .\myproject.db -c cscope.out -t tags -p 6. Open myproject.db using the CodeQuery GUI tool. Wild card search (* and ?) supported if Exact Match is switched off. Or use cqsearch, the CLI-version of CodeQuery (type `cqsearch -h` for more info). Use cqmakedb -h to get help on cqmakedb command line arguments. codequery-0.18.1/windows-install/LICENSE.txt000066400000000000000000000440011300045745200205610ustar00rootroot00000000000000 GNU GENERAL PUBLIC LICENSE Version 2, June 1991 Copyright (C) 1989, 1991 Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This General Public License applies to most of the Free Software Foundation's software and to any other program whose authors commit to using it. (Some other Free Software Foundation software is covered by the GNU Lesser General Public License instead.) You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs; and that you know you can do these things. To protect your rights, we need to make restrictions that forbid anyone to deny you these rights or to ask you to surrender the rights. These restrictions translate to certain responsibilities for you if you distribute copies of the software, or if you modify it. For example, if you distribute copies of such a program, whether gratis or for a fee, you must give the recipients all the rights that you have. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. We protect your rights with two steps: (1) copyright the software, and (2) offer you this license which gives you legal permission to copy, distribute and/or modify the software. Also, for each author's protection and ours, we want to make certain that everyone understands that there is no warranty for this free software. If the software is modified by someone else and passed on, we want its recipients to know that what they have is not the original, so that any problems introduced by others will not reflect on the original authors' reputations. Finally, any free program is threatened constantly by software patents. We wish to avoid the danger that redistributors of a free program will individually obtain patent licenses, in effect making the program proprietary. To prevent this, we have made it clear that any patent must be licensed for everyone's free use or not licensed at all. The precise terms and conditions for copying, distribution and modification follow. GNU GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License applies to any program or other work which contains a notice placed by the copyright holder saying it may be distributed under the terms of this General Public License. The "Program", below, refers to any such program or work, and a "work based on the Program" means either the Program or any derivative work under copyright law: that is to say, a work containing the Program or a portion of it, either verbatim or with modifications and/or translated into another language. (Hereinafter, translation is included without limitation in the term "modification".) Each licensee is addressed as "you". Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running the Program is not restricted, and the output from the Program is covered only if its contents constitute a work based on the Program (independent of having been made by running the Program). Whether that is true depends on what the Program does. 1. You may copy and distribute verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and give any other recipients of the Program a copy of this License along with the Program. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Program or any portion of it, thus forming a work based on the Program, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) You must cause the modified files to carry prominent notices stating that you changed the files and the date of any change. b) You must cause any work that you distribute or publish, that in whole or in part contains or is derived from the Program or any part thereof, to be licensed as a whole at no charge to all third parties under the terms of this License. c) If the modified program normally reads commands interactively when run, you must cause it, when started running for such interactive use in the most ordinary way, to print or display an announcement including an appropriate copyright notice and a notice that there is no warranty (or else, saying that you provide a warranty) and that users may redistribute the program under these conditions, and telling the user how to view a copy of this License. (Exception: if the Program itself is interactive but does not normally print such an announcement, your work based on the Program is not required to print an announcement.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Program, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Program, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Program. In addition, mere aggregation of another work not based on the Program with the Program (or with a work based on the Program) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may copy and distribute the Program (or a work based on it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you also do one of the following: a) Accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, b) Accompany it with a written offer, valid for at least three years, to give any third party, for a charge no more than your cost of physically performing source distribution, a complete machine-readable copy of the corresponding source code, to be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, c) Accompany it with the information you received as to the offer to distribute corresponding source code. (This alternative is allowed only for noncommercial distribution and only if you received the program in object code or executable form with such an offer, in accord with Subsection b above.) The source code for a work means the preferred form of the work for making modifications to it. For an executable work, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the executable. However, as a special exception, the source code distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. If distribution of executable or object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place counts as distribution of the source code, even though third parties are not compelled to copy the source along with the object code. 4. You may not copy, modify, sublicense, or distribute the Program except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense or distribute the Program is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 5. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Program or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Program (or any work based on the Program), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Program or works based on it. 6. Each time you redistribute the Program (or any work based on the Program), the recipient automatically receives a license from the original licensor to copy, distribute or modify the Program subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties to this License. 7. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Program at all. For example, if a patent license would not permit royalty-free redistribution of the Program by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Program. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system, which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 8. If the distribution and/or use of the Program is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Program under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 9. The Free Software Foundation may publish revised and/or new versions of the General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of this License, you may choose any version ever published by the Free Software Foundation. 10. If you wish to incorporate parts of the Program into other free programs whose distribution conditions are different, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. Also add information on how to contact you by electronic and paper mail. If the program is interactive, make it output a short notice like this when it starts in an interactive mode: Gnomovision version 69, Copyright (C) year name of author Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, the commands you use may be called something other than `show w' and `show c'; they could even be mouse-clicks or menu items--whatever suits your program. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the program, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision' (which makes passes at compilers) written by James Hacker. , 1 April 1989 Ty Coon, President of Vice This General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Lesser General Public License instead of this License. codequery-0.18.1/windows-install/README.txt000066400000000000000000000236671300045745200204530ustar00rootroot00000000000000![CodeQuery](doc/logotitle.png) =============================== This is a tool to index, then query or search C, C++, Java, Python, Ruby, Go and Javascript source code. It builds upon the databases of [cscope](http://cscope.sourceforge.net/) and [Exuberant ctags](http://ctags.sourceforge.net/). The databases of *cscope* and *ctags* would be processed by the *cqmakedb* tool to generate the CodeQuery database file. The CodeQuery database file can be viewed and queried using the *codequery* GUI tool. [![Build Status](https://api.travis-ci.org/ruben2020/codequery.svg)](https://travis-ci.org/ruben2020/codequery) [![Coverity Status](https://scan.coverity.com/projects/10066/badge.svg)](https://scan.coverity.com/projects/ruben2020-codequery) ## Latest version Windows and Linux binaries available here for download: [CodeQuery@sourceforge downloads](https://sourceforge.net/projects/codequery/files/) To build on Linux, please read the [INSTALL-LINUX](doc/INSTALL-LINUX.md) file. On Mac, the software can be installed through [Brew](http://brew.sh/) using `brew install codequery`. Please read [NEWS](NEWS.txt) to find out more. ## How is it different from cscope and ctags? What are the advantages? Both cscope and ctags can do symbol lookup and identify functions, macros, classes and structs. cscope is very C-centric, but is fuzzy enough to cover C++ and Java, but not very well for e.g. it doesn't understand destructors and class member instantiations. It can't provide relationships of class inheritance and membership. cscope can do "functions that call this function" and "functions called by this function". This is a very powerful feature that makes cscope stand out among comparable tools. ctags does many languages well and understands destructors, member instantiations, and the relationships of class membership and inheritance. From ctags, we can find out "members and methods of this class", "class which owns this member or method", "parent of this class", "child of this class" etc. However, it doesn't do "functions that call this function" or "functions called by this function". So both these tools have their pros and cons, but complement each other. CodeQuery is a project that attempts to combine the features available from both cscope and ctags, provide faster database access compared to cscope (because it uses sqlite) and provides a nice GUI tool as well. Due to this faster database access, fast auto-completion of search terms and multiple complex queries to perform visualization is possible. In addition, [pycscope](https://github.com/portante/pycscope) is used to add support for Python, in place of cscope. In addition, [starscope](https://github.com/eapache/starscope) is used to add support for Ruby, Go and Javascript, in place of cscope. ## What features does CodeQuery have? * Combines the best of both cscope and ctags * Faster due to the use of sqlite for the CodeQuery database * Cross-platform GUI tool * Fast auto-completion of search term * Case-insensitive, partial keyword search - wildcard search supported * and ? * Exact match search * Filter search results by file path * File viewer with syntax highlighting * Ability to open viewed file in an external editor or IDE * Visualization of function call graph and class inheritance based on search term * Visualization graphs can be saved to PNG or Graphviz DOT files ## What types of query can I make? * Symbol * Function or macro definition * Class or struct * Functions calling this function * Functions called by this function * Calls of this function or macro * Class which owns this member or method * Members and methods of this class * Parent of this class (inheritance) * Children of this class (inheritance) * Files including this file * Full path for file * Functions and macros inside this file * Grep ## What does it look like? ![CodeQuery screenshot](doc/screenshot.png) ## How does the visualization look like? Here's a function call graph based on the search term of "updateFilePathLabel". A -> B means A calls B: ![Visualization screenshot](doc/screenshot2.png) ## Are other editors like vim or emacs supported? Yes! There is a vim plugin for CodeQuery called [vim-codequery](https://github.com/devjoe/vim-codequery) by [devjoe](https://github.com/devjoe). We welcome contributors to develop plugins for other editors too. ## What does it cost? How is it licensed? It's freeware and free open source software. This software is licensed under the [GNU GPL v2](https://www.gnu.org/licenses/old-licenses/gpl-2.0.html). See [LICENSE.md](LICENSE.md) or [LICENSE.txt](windows-install/LICENSE.txt). Files under the `querylib` directory are licensed under the [MIT license](http://opensource.org/licenses/MIT). See [QueryLib README](querylib/README.txt). This is a library to query CodeQuery database files. This library is MIT-licensed, so that it may be used to create plugins for editors, IDEs and other software without license restrictions. It's only dependency is on sqlite3. ## Can I use it in a commercial environment without purchasing, for an unlimited time? Yes. However, donations are welcomed. ## Which platforms are supported? It has been tested on Windows 7 64-bit, Windows XP 32-bit, Mac OS X, Ubuntu and Fedora Linux 64-bit and, Ubuntu and Fedora Linux 32-bit. Contributions are welcomed to attempt ports to other operating systems. ## Is the software available in other languages? Yes. This applies only to the GUI tool. Contributions are welcomed to update or provide new translations. ## How to install it? On Windows, EXE setup packages will be provided here: [CodeQuery@sourceforge downloads](https://sourceforge.net/projects/codequery/files/). The EXE setup package shall also contain cscope.exe, ctags.exe and the required DLLs. So, everything you need is in one package. However, [pycscope](https://github.com/portante/pycscope) (optional - only for Python) and [starscope](https://github.com/eapache/starscope) (optional - only for Ruby, Go and Javascript) are not bundled together with this setup package and need to be installed separately. On Linux, tar.gz, RPM and Debian package installations will be provided here: [CodeQuery@sourceforge downloads](https://sourceforge.net/projects/codequery/files/). On Mac, the software can be installed through [Brew](http://brew.sh/) using `brew install codequery`. To build on Linux and Mac, please read the [INSTALL-LINUX](doc/INSTALL-LINUX.md) file. Version 15.8a of [cscope](http://cscope.sourceforge.net/) or higher, works best with CodeQuery. ## How do I use it? On Windows: [HOWTO-WINDOWS](windows-install/HOWTO-WINDOWS.txt). This file is included in the EXE setup package. On Linux and Mac: [HOWTO-LINUX](doc/HOWTO-LINUX.md) Please read the HOWTO file provided for each platform. The workflow looks like this: ![CodeQuery workflow](doc/workflow.png) ## How do I generate whole-program call graphs or UML class diagrams? CodeQuery cannot do this at the moment. To generate whole-program call graphs, please use [GNU cflow](https://www.gnu.org/software/cflow/) or [CodeViz](https://github.com/petersenna/codeviz) for C and C++. For Java, there is [Javashot](http://code.google.com/p/javashot/). To generate whole-program UML class diagrams for various object-oriented languages, please use [tags2uml](https://github.com/ruben2020/tags2uml). ## Are there any known limitations? For C and C++, [inline assembly code](http://en.wikipedia.org/wiki/Inline_assembler) is not supported by all the tools. This mainly affects embedded software, OS and driver code. Please exclude files with inline assembly code from the list of files (cscope.files) to be scanned. ## How do I contact the authors for support, issues, bug reports, fix patches, feature requests etc.? Please see the email address below, and also the Issues tab in GitHub. Email address: ![Contact address](doc/emailaddr.png) Website: [CodeQuery website](https://github.com/ruben2020/codequery) ## How can I contribute? * Report bugs * Provide feedback, new ideas, suggestions etc. What would you like to see? * Tell your friends, propose it on StackOverflow, write about it, tweet it * Fix bugs (see Issues tab) * Update translations (Deutsch, Francais, Japanese etc.) * Port to other platforms * Write plugins for emacs, eclipse, Notepad++ etc. * Write a web-based interface to CodeQuery's database * Add support for other languages e.g. Javascript ## List of Contributors [ruben2020](https://github.com/ruben2020) [naseer](https://github.com/naseer) [bruno-](https://github.com/bruno-) [devjoe](https://github.com/devjoe) [jonashaag](https://github.com/jonashaag) [ilovezfs](https://github.com/ilovezfs) [JCount](https://github.com/JCount) (More welcomed) ## Credits We thank the people behind the following projects: [cscope](http://cscope.sourceforge.net/) - our database is derived from this [Exuberant ctags](http://ctags.sourceforge.net/)- our database is derived from this [pycscope](https://github.com/portante/pycscope) - our database (for Python) is derived from this [starscope](https://github.com/eapache/starscope) - our database (for Ruby, Go and Javascript) is derived from this [sqlite3](http://www.sqlite.org/) - our database is using this format [CMake](http://www.cmake.org/) - cross-platform build toolchain for CodeQuery [Qt open source](http://qt-project.org/) - GUI toolkit used to build CodeQuery [showgraph](http://code.google.com/p/showgraph/) - visualization done using this library [scintilla](http://www.scintilla.org/) - our code editing widget (in the form of QScintilla) [vim-codequery](https://github.com/devjoe/vim-codequery) - vim plugin for CodeQuery [Axialis](http://www.axialis.com/iconworkshop) - free images for CodeQuery and this website [brew](http://brew.sh/) - binaries for Mac here codequery-0.18.1/windows-install/codequery.iss000066400000000000000000000057141300045745200214660ustar00rootroot00000000000000[Files] Source: "\workspace\codequery\build\cqmakedb.exe"; DestDir: "{app}"; Flags: 32bit overwritereadonly Source: "\workspace\codequery\build\cqsearch.exe"; DestDir: "{app}"; Flags: 32bit overwritereadonly Source: "\workspace\codequery\build\codequery.exe"; DestDir: "{app}"; Flags: 32bit overwritereadonly Source: "\workspace\codequery\windows-install\README.txt"; DestDir: "{app}"; Flags: overwritereadonly isreadme Source: "\workspace\codequery\windows-install\LICENSE.txt"; DestDir: "{app}"; Flags: overwritereadonly Source: "\workspace\codequery\windows-install\HOWTO-WINDOWS.txt"; DestDir: "{app}"; Flags: overwritereadonly Source: "\workspace\codequery\windows-install\cscope.exe"; DestDir: "{app}"; Flags: 32bit overwritereadonly Source: "\workspace\codequery\windows-install\ctags.exe"; DestDir: "{app}"; Flags: 32bit overwritereadonly Source: "\Qt\4.8.6\bin\qscintilla2.dll"; DestDir: "{app}"; Flags: 32bit overwritereadonly Source: "\Qt\4.8.6\bin\QtCore4.dll"; DestDir: "{app}"; Flags: 32bit overwritereadonly Source: "\Qt\4.8.6\bin\QtGui4.dll"; DestDir: "{app}"; Flags: 32bit overwritereadonly Source: "\Qt\4.8.6\bin\QtXml4.dll"; DestDir: "{app}"; Flags: 32bit overwritereadonly Source: "\mingw32\bin\sqlite3.dll"; DestDir: "{app}"; Flags: 32bit overwritereadonly Source: "\mingw32\bin\libgcc_s_dw2-1.dll"; DestDir: "{app}"; Flags: 32bit overwritereadonly Source: "\mingw32\bin\libstdc++-6.dll"; DestDir: "{app}"; Flags: 32bit overwritereadonly Source: "\mingw32\bin\libwinpthread-1.dll"; DestDir: "{app}"; Flags: 32bit overwritereadonly [Icons] Name: "{group}\CodeQuery"; Filename: "{app}\codequery.exe"; WorkingDir: "{app}"; IconFilename: "{app}\codequery.exe" Name: "{group}\README"; Filename: "{app}\README.txt"; WorkingDir: "{app}" Name: "{group}\LICENSE"; Filename: "{app}\LICENSE.txt"; WorkingDir: "{app}" Name: "{group}\How to Use CodeQuery"; Filename: "{app}\HOWTO-WINDOWS.txt"; WorkingDir: "{app}" Name: "{group}\Uninstall"; Filename: "{uninstallexe}"; WorkingDir: "{app}" [Setup] ShowLanguageDialog=auto AppName=CodeQuery AppVersion=0.18.0 AppCopyright=Copyright 2013-2016 (C) ruben2020 AppId={{D95A3CC0-CC79-4CF1-A92B-50E909B60EF1} LicenseFile=\workspace\codequery\windows-install\LICENSE.txt DefaultDirName={pf}\CodeQuery AppPublisher=ruben2020 AppPublisherURL=https://github.com/ruben2020/codequery AppSupportURL=https://github.com/ruben2020/codequery AppUpdatesURL=https://github.com/ruben2020/codequery DefaultGroupName=CodeQuery ChangesEnvironment=true DisableStartupPrompt=False [Tasks] Name: "modifypath"; Description: "Add application directory to your environmental path"; Flags: [Run] Filename: "{app}\codequery.exe"; Description: "Launch application"; Flags: postinstall nowait skipifsilent unchecked [Code] const ModPathName = 'modifypath'; ModPathType = 'user'; function ModPathDir(): TArrayOfString; begin setArrayLength(Result, 1) Result[0] := ExpandConstant('{app}'); end; #include "modpath.iss" codequery-0.18.1/windows-install/modpath.iss000066400000000000000000000154461300045745200211250ustar00rootroot00000000000000// ---------------------------------------------------------------------------- // // Inno Setup Ver: 5.4.2 // Script Version: 1.4.2 // Author: Jared Breland // Homepage: http://www.legroom.net/software // License: GNU Lesser General Public License (LGPL), version 3 // http://www.gnu.org/licenses/lgpl.html // // Script Function: // Allow modification of environmental path directly from Inno Setup installers // // Instructions: // Copy modpath.iss to the same directory as your setup script // // Add this statement to your [Setup] section // ChangesEnvironment=true // // Add this statement to your [Tasks] section // You can change the Description or Flags // You can change the Name, but it must match the ModPathName setting below // Name: modifypath; Description: &Add application directory to your environmental path; Flags: unchecked // // Add the following to the end of your [Code] section // ModPathName defines the name of the task defined above // ModPathType defines whether the 'user' or 'system' path will be modified; // this will default to user if anything other than system is set // setArrayLength must specify the total number of dirs to be added // Result[0] contains first directory, Result[1] contains second, etc. // const // ModPathName = 'modifypath'; // ModPathType = 'user'; // // function ModPathDir(): TArrayOfString; // begin // setArrayLength(Result, 1); // Result[0] := ExpandConstant('{app}'); // end; // #include "modpath.iss" // ---------------------------------------------------------------------------- procedure ModPath(); var oldpath: String; newpath: String; updatepath: Boolean; pathArr: TArrayOfString; aExecFile: String; aExecArr: TArrayOfString; i, d: Integer; pathdir: TArrayOfString; regroot: Integer; regpath: String; begin // Get constants from main script and adjust behavior accordingly // ModPathType MUST be 'system' or 'user'; force 'user' if invalid if ModPathType = 'system' then begin regroot := HKEY_LOCAL_MACHINE; regpath := 'SYSTEM\CurrentControlSet\Control\Session Manager\Environment'; end else begin regroot := HKEY_CURRENT_USER; regpath := 'Environment'; end; // Get array of new directories and act on each individually pathdir := ModPathDir(); for d := 0 to GetArrayLength(pathdir)-1 do begin updatepath := true; // Modify WinNT path if UsingWinNT() = true then begin // Get current path, split into an array RegQueryStringValue(regroot, regpath, 'Path', oldpath); oldpath := oldpath + ';'; i := 0; while (Pos(';', oldpath) > 0) do begin SetArrayLength(pathArr, i+1); pathArr[i] := Copy(oldpath, 0, Pos(';', oldpath)-1); oldpath := Copy(oldpath, Pos(';', oldpath)+1, Length(oldpath)); i := i + 1; // Check if current directory matches app dir if pathdir[d] = pathArr[i-1] then begin // if uninstalling, remove dir from path if IsUninstaller() = true then begin continue; // if installing, flag that dir already exists in path end else begin updatepath := false; end; end; // Add current directory to new path if i = 1 then begin newpath := pathArr[i-1]; end else begin newpath := newpath + ';' + pathArr[i-1]; end; end; // Append app dir to path if not already included if (IsUninstaller() = false) AND (updatepath = true) then newpath := newpath + ';' + pathdir[d]; // Write new path RegWriteStringValue(regroot, regpath, 'Path', newpath); // Modify Win9x path end else begin // Convert to shortened dirname pathdir[d] := GetShortName(pathdir[d]); // If autoexec.bat exists, check if app dir already exists in path aExecFile := 'C:\AUTOEXEC.BAT'; if FileExists(aExecFile) then begin LoadStringsFromFile(aExecFile, aExecArr); for i := 0 to GetArrayLength(aExecArr)-1 do begin if IsUninstaller() = false then begin // If app dir already exists while installing, skip add if (Pos(pathdir[d], aExecArr[i]) > 0) then updatepath := false; break; end else begin // If app dir exists and = what we originally set, then delete at uninstall if aExecArr[i] = 'SET PATH=%PATH%;' + pathdir[d] then aExecArr[i] := ''; end; end; end; // If app dir not found, or autoexec.bat didn't exist, then (create and) append to current path if (IsUninstaller() = false) AND (updatepath = true) then begin SaveStringToFile(aExecFile, #13#10 + 'SET PATH=%PATH%;' + pathdir[d], True); // If uninstalling, write the full autoexec out end else begin SaveStringsToFile(aExecFile, aExecArr, False); end; end; end; end; // Split a string into an array using passed delimeter procedure MPExplode(var Dest: TArrayOfString; Text: String; Separator: String); var i: Integer; begin i := 0; repeat SetArrayLength(Dest, i+1); if Pos(Separator,Text) > 0 then begin Dest[i] := Copy(Text, 1, Pos(Separator, Text)-1); Text := Copy(Text, Pos(Separator,Text) + Length(Separator), Length(Text)); i := i + 1; end else begin Dest[i] := Text; Text := ''; end; until Length(Text)=0; end; procedure CurStepChanged(CurStep: TSetupStep); var taskname: String; begin taskname := ModPathName; if CurStep = ssPostInstall then if IsTaskSelected(taskname) then ModPath(); end; procedure CurUninstallStepChanged(CurUninstallStep: TUninstallStep); var aSelectedTasks: TArrayOfString; i: Integer; taskname: String; regpath: String; regstring: String; appid: String; begin // only run during actual uninstall if CurUninstallStep = usUninstall then begin // get list of selected tasks saved in registry at install time appid := '{#emit SetupSetting("AppId")}'; if appid = '' then appid := '{#emit SetupSetting("AppName")}'; regpath := ExpandConstant('Software\Microsoft\Windows\CurrentVersion\Uninstall\'+appid+'_is1'); RegQueryStringValue(HKLM, regpath, 'Inno Setup: Selected Tasks', regstring); if regstring = '' then RegQueryStringValue(HKCU, regpath, 'Inno Setup: Selected Tasks', regstring); // check each task; if matches modpath taskname, trigger patch removal if regstring <> '' then begin taskname := ModPathName; MPExplode(aSelectedTasks, regstring, ','); if GetArrayLength(aSelectedTasks) > 0 then begin for i := 0 to GetArrayLength(aSelectedTasks)-1 do begin if comparetext(aSelectedTasks[i], taskname) = 0 then ModPath(); end; end; end; end; end; function NeedRestart(): Boolean; var taskname: String; begin taskname := ModPathName; if IsTaskSelected(taskname) and not UsingWinNT() then begin Result := True; end else begin Result := False; end; end; codequery-0.18.1/windows-install/updatesnoti.htm000066400000000000000000000007651300045745200220200ustar00rootroot00000000000000 CodeQuery updates notification

Do you want to be notified of new version updates for CodeQuery?

Follow us on our FreeCode page and you should receive emails notifying you of new version releases.

And don't forget to up-vote CodeQuery on FreeCode and star it on Github if you like this project.